./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.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_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 30c34688967b08e009ee7c945b5c905ca7f15dd9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:58:35,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:58:35,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:58:35,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:58:35,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:58:35,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:58:35,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:58:35,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:58:35,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:58:35,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:58:35,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:58:35,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:58:35,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:58:35,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:58:35,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:58:35,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:58:35,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:58:35,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:58:35,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:58:35,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:58:35,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:58:35,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:58:35,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:58:35,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:58:35,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:58:35,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:58:35,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:58:35,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:58:35,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:58:35,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:58:35,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:58:35,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:58:35,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:58:35,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:58:35,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:58:35,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:58:35,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:58:35,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:58:35,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:58:35,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:58:35,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:58:35,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:58:35,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:58:35,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:58:35,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:58:35,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:58:35,356 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:58:35,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:58:35,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:58:35,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:58:35,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:58:35,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:58:35,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:58:35,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:58:35,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:58:35,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:58:35,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:58:35,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:58:35,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:58:35,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:58:35,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:58:35,361 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_a278f87f-096e-49bd-9443-236653260019/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 -> 30c34688967b08e009ee7c945b5c905ca7f15dd9 [2019-12-07 18:58:35,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:58:35,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:58:35,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:58:35,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:58:35,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:58:35,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-12-07 18:58:35,512 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/data/dfdf81395/7168968683464d0ab48da87f9630587c/FLAG8fe2cd1ce [2019-12-07 18:58:36,032 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:58:36,032 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/sv-benchmarks/c/eca-rers2012/Problem15_label59.c [2019-12-07 18:58:36,045 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/data/dfdf81395/7168968683464d0ab48da87f9630587c/FLAG8fe2cd1ce [2019-12-07 18:58:36,543 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/data/dfdf81395/7168968683464d0ab48da87f9630587c [2019-12-07 18:58:36,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:58:36,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:58:36,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:58:36,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:58:36,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:58:36,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:58:36" (1/1) ... [2019-12-07 18:58:36,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:36, skipping insertion in model container [2019-12-07 18:58:36,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:58:36" (1/1) ... [2019-12-07 18:58:36,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:58:36,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:58:37,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:58:37,035 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:58:37,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:58:37,217 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:58:37,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37 WrapperNode [2019-12-07 18:58:37,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:58:37,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:58:37,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:58:37,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:58:37,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:58:37,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:58:37,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:58:37,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:58:37,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... [2019-12-07 18:58:37,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:58:37,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:58:37,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:58:37,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:58:37,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:58:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:58:37,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:58:39,578 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:58:39,579 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:58:39,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:39 BoogieIcfgContainer [2019-12-07 18:58:39,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:58:39,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:58:39,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:58:39,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:58:39,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:58:36" (1/3) ... [2019-12-07 18:58:39,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eae59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:58:39, skipping insertion in model container [2019-12-07 18:58:39,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:58:37" (2/3) ... [2019-12-07 18:58:39,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eae59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:58:39, skipping insertion in model container [2019-12-07 18:58:39,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:39" (3/3) ... [2019-12-07 18:58:39,586 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label59.c [2019-12-07 18:58:39,592 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:58:39,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:58:39,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:58:39,625 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:58:39,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:58:39,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:58:39,626 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:58:39,626 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:58:39,626 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:58:39,626 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:58:39,626 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:58:39,643 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:58:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 18:58:39,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:39,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:39,649 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-12-07 18:58:39,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:39,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 18:58:39,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:39,867 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 18:58:39,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784602347] [2019-12-07 18:58:39,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:39,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880546209] [2019-12-07 18:58:39,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:39,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:39,888 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:58:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:42,821 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-12-07 18:58:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:42,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 18:58:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:42,840 INFO L225 Difference]: With dead ends: 1514 [2019-12-07 18:58:42,840 INFO L226 Difference]: Without dead ends: 1008 [2019-12-07 18:58:42,844 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 18:58:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-07 18:58:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-12-07 18:58:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-07 18:58:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-12-07 18:58:42,924 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 54 [2019-12-07 18:58:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:42,925 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-12-07 18:58:42,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-12-07 18:58:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 18:58:42,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:42,930 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:42,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1246806213, now seen corresponding path program 1 times [2019-12-07 18:58:42,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:42,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635105182] [2019-12-07 18:58:42,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:43,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635105182] [2019-12-07 18:58:43,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:43,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:43,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602739922] [2019-12-07 18:58:43,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:43,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:43,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:43,101 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-12-07 18:58:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:46,707 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-12-07 18:58:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:46,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-12-07 18:58:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:46,714 INFO L225 Difference]: With dead ends: 2303 [2019-12-07 18:58:46,714 INFO L226 Difference]: Without dead ends: 1628 [2019-12-07 18:58:46,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-12-07 18:58:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-12-07 18:58:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-07 18:58:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-12-07 18:58:46,737 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 119 [2019-12-07 18:58:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-12-07 18:58:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-12-07 18:58:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 18:58:46,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:46,740 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:46,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash -214871010, now seen corresponding path program 1 times [2019-12-07 18:58:46,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:46,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656758958] [2019-12-07 18:58:46,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:46,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656758958] [2019-12-07 18:58:46,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:46,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:46,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196375168] [2019-12-07 18:58:46,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:46,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:46,808 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-12-07 18:58:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:48,792 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-12-07 18:58:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:48,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 18:58:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:48,803 INFO L225 Difference]: With dead ends: 3777 [2019-12-07 18:58:48,803 INFO L226 Difference]: Without dead ends: 2790 [2019-12-07 18:58:48,805 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 18:58:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-12-07 18:58:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-12-07 18:58:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-12-07 18:58:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-12-07 18:58:48,835 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 120 [2019-12-07 18:58:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:48,835 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-12-07 18:58:48,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-12-07 18:58:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 18:58:48,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:48,836 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 18:58:48,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1115564308, now seen corresponding path program 1 times [2019-12-07 18:58:48,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:48,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511109548] [2019-12-07 18:58:48,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:48,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511109548] [2019-12-07 18:58:48,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:48,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:48,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039337094] [2019-12-07 18:58:48,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:48,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:48,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:48,904 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-12-07 18:58:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:51,565 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-12-07 18:58:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:51,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 18:58:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:51,583 INFO L225 Difference]: With dead ends: 7368 [2019-12-07 18:58:51,584 INFO L226 Difference]: Without dead ends: 5484 [2019-12-07 18:58:51,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-12-07 18:58:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-12-07 18:58:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-12-07 18:58:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-12-07 18:58:51,660 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 124 [2019-12-07 18:58:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:51,661 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-12-07 18:58:51,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-12-07 18:58:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 18:58:51,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:51,662 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:51,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:51,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1684612182, now seen corresponding path program 1 times [2019-12-07 18:58:51,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:51,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120040644] [2019-12-07 18:58:51,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:51,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120040644] [2019-12-07 18:58:51,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:51,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:51,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801691083] [2019-12-07 18:58:51,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:51,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:51,742 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 4 states. [2019-12-07 18:58:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:55,020 INFO L93 Difference]: Finished difference Result 17833 states and 23134 transitions. [2019-12-07 18:58:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:55,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 18:58:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:55,047 INFO L225 Difference]: With dead ends: 17833 [2019-12-07 18:58:55,047 INFO L226 Difference]: Without dead ends: 8469 [2019-12-07 18:58:55,055 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 18:58:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2019-12-07 18:58:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 8469. [2019-12-07 18:58:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8469 states. [2019-12-07 18:58:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 9448 transitions. [2019-12-07 18:58:55,155 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 9448 transitions. Word has length 145 [2019-12-07 18:58:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:55,156 INFO L462 AbstractCegarLoop]: Abstraction has 8469 states and 9448 transitions. [2019-12-07 18:58:55,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 9448 transitions. [2019-12-07 18:58:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-12-07 18:58:55,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:55,158 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:55,158 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1210416382, now seen corresponding path program 1 times [2019-12-07 18:58:55,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:55,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546485003] [2019-12-07 18:58:55,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:55,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546485003] [2019-12-07 18:58:55,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:55,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:55,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3267078] [2019-12-07 18:58:55,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:55,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:55,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:55,374 INFO L87 Difference]: Start difference. First operand 8469 states and 9448 transitions. Second operand 5 states. [2019-12-07 18:58:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:57,561 INFO L93 Difference]: Finished difference Result 20244 states and 22382 transitions. [2019-12-07 18:58:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:57,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 287 [2019-12-07 18:58:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:57,598 INFO L225 Difference]: With dead ends: 20244 [2019-12-07 18:58:57,598 INFO L226 Difference]: Without dead ends: 11179 [2019-12-07 18:58:57,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2019-12-07 18:58:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 9667. [2019-12-07 18:58:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9667 states. [2019-12-07 18:58:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9667 states to 9667 states and 10707 transitions. [2019-12-07 18:58:57,697 INFO L78 Accepts]: Start accepts. Automaton has 9667 states and 10707 transitions. Word has length 287 [2019-12-07 18:58:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:57,698 INFO L462 AbstractCegarLoop]: Abstraction has 9667 states and 10707 transitions. [2019-12-07 18:58:57,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9667 states and 10707 transitions. [2019-12-07 18:58:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-12-07 18:58:57,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:57,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:57,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:57,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1076396748, now seen corresponding path program 1 times [2019-12-07 18:58:57,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:57,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384166175] [2019-12-07 18:58:57,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:58,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384166175] [2019-12-07 18:58:58,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443646900] [2019-12-07 18:58:58,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:58:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:58,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:58:58,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:58:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:58,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:58:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:58:58,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546926558] [2019-12-07 18:58:58,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:58,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:58,367 INFO L87 Difference]: Start difference. First operand 9667 states and 10707 transitions. Second operand 3 states. [2019-12-07 18:58:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:59,297 INFO L93 Difference]: Finished difference Result 19034 states and 21112 transitions. [2019-12-07 18:58:59,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:59,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-12-07 18:58:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:59,315 INFO L225 Difference]: With dead ends: 19034 [2019-12-07 18:58:59,315 INFO L226 Difference]: Without dead ends: 9668 [2019-12-07 18:58:59,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9668 states. [2019-12-07 18:58:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9668 to 9665. [2019-12-07 18:58:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9665 states. [2019-12-07 18:58:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9665 states to 9665 states and 10555 transitions. [2019-12-07 18:58:59,424 INFO L78 Accepts]: Start accepts. Automaton has 9665 states and 10555 transitions. Word has length 324 [2019-12-07 18:58:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:59,425 INFO L462 AbstractCegarLoop]: Abstraction has 9665 states and 10555 transitions. [2019-12-07 18:58:59,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9665 states and 10555 transitions. [2019-12-07 18:58:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-12-07 18:58:59,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:59,436 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:59,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:58:59,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -864696258, now seen corresponding path program 1 times [2019-12-07 18:58:59,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:59,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854416804] [2019-12-07 18:58:59,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-12-07 18:59:00,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854416804] [2019-12-07 18:59:00,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:00,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:59:00,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807325380] [2019-12-07 18:59:00,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:59:00,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:59:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:59:00,234 INFO L87 Difference]: Start difference. First operand 9665 states and 10555 transitions. Second operand 5 states. [2019-12-07 18:59:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:02,054 INFO L93 Difference]: Finished difference Result 19629 states and 21436 transitions. [2019-12-07 18:59:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:59:02,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 505 [2019-12-07 18:59:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:02,081 INFO L225 Difference]: With dead ends: 19629 [2019-12-07 18:59:02,081 INFO L226 Difference]: Without dead ends: 10265 [2019-12-07 18:59:02,090 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 18:59:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2019-12-07 18:59:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 10263. [2019-12-07 18:59:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-12-07 18:59:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 11158 transitions. [2019-12-07 18:59:02,218 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 11158 transitions. Word has length 505 [2019-12-07 18:59:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:02,218 INFO L462 AbstractCegarLoop]: Abstraction has 10263 states and 11158 transitions. [2019-12-07 18:59:02,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:59:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 11158 transitions. [2019-12-07 18:59:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-12-07 18:59:02,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:02,226 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:59:02,226 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:02,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash 535763756, now seen corresponding path program 1 times [2019-12-07 18:59:02,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:02,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163670271] [2019-12-07 18:59:02,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 435 proven. 70 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-12-07 18:59:02,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163670271] [2019-12-07 18:59:02,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664526821] [2019-12-07 18:59:02,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:59:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:02,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:03,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-12-07 18:59:03,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:03,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:59:03,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808734204] [2019-12-07 18:59:03,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:03,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:59:03,172 INFO L87 Difference]: Start difference. First operand 10263 states and 11158 transitions. Second operand 3 states. [2019-12-07 18:59:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:04,259 INFO L93 Difference]: Finished difference Result 23217 states and 25265 transitions. [2019-12-07 18:59:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:04,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 579 [2019-12-07 18:59:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:04,271 INFO L225 Difference]: With dead ends: 23217 [2019-12-07 18:59:04,271 INFO L226 Difference]: Without dead ends: 13255 [2019-12-07 18:59:04,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 579 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:59:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-12-07 18:59:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 13252. [2019-12-07 18:59:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13252 states. [2019-12-07 18:59:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13252 states to 13252 states and 14238 transitions. [2019-12-07 18:59:04,383 INFO L78 Accepts]: Start accepts. Automaton has 13252 states and 14238 transitions. Word has length 579 [2019-12-07 18:59:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:04,383 INFO L462 AbstractCegarLoop]: Abstraction has 13252 states and 14238 transitions. [2019-12-07 18:59:04,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 13252 states and 14238 transitions. [2019-12-07 18:59:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-12-07 18:59:04,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:04,390 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:59:04,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:04,591 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash 112753897, now seen corresponding path program 1 times [2019-12-07 18:59:04,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:04,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585660548] [2019-12-07 18:59:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 462 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 18:59:05,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585660548] [2019-12-07 18:59:05,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531689735] [2019-12-07 18:59:05,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:59:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:05,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:05,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 18:59:05,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:05,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:59:05,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617692957] [2019-12-07 18:59:05,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:05,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:59:05,577 INFO L87 Difference]: Start difference. First operand 13252 states and 14238 transitions. Second operand 3 states. [2019-12-07 18:59:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:06,340 INFO L93 Difference]: Finished difference Result 25907 states and 27873 transitions. [2019-12-07 18:59:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:06,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 587 [2019-12-07 18:59:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:06,351 INFO L225 Difference]: With dead ends: 25907 [2019-12-07 18:59:06,351 INFO L226 Difference]: Without dead ends: 13255 [2019-12-07 18:59:06,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 588 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:59:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-12-07 18:59:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 12654. [2019-12-07 18:59:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-07 18:59:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 13391 transitions. [2019-12-07 18:59:06,450 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 13391 transitions. Word has length 587 [2019-12-07 18:59:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:06,450 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 13391 transitions. [2019-12-07 18:59:06,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 13391 transitions. [2019-12-07 18:59:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-12-07 18:59:06,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:06,457 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:06,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:06,658 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -637061868, now seen corresponding path program 1 times [2019-12-07 18:59:06,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:06,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102884422] [2019-12-07 18:59:06,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-12-07 18:59:06,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102884422] [2019-12-07 18:59:06,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:06,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:59:06,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662105207] [2019-12-07 18:59:06,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:59:06,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:59:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:59:06,993 INFO L87 Difference]: Start difference. First operand 12654 states and 13391 transitions. Second operand 4 states. [2019-12-07 18:59:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:08,300 INFO L93 Difference]: Finished difference Result 27103 states and 28751 transitions. [2019-12-07 18:59:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:59:08,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 634 [2019-12-07 18:59:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:08,311 INFO L225 Difference]: With dead ends: 27103 [2019-12-07 18:59:08,311 INFO L226 Difference]: Without dead ends: 15049 [2019-12-07 18:59:08,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:59:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15049 states. [2019-12-07 18:59:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15049 to 13549. [2019-12-07 18:59:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13549 states. [2019-12-07 18:59:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13549 states to 13549 states and 14130 transitions. [2019-12-07 18:59:08,459 INFO L78 Accepts]: Start accepts. Automaton has 13549 states and 14130 transitions. Word has length 634 [2019-12-07 18:59:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:08,460 INFO L462 AbstractCegarLoop]: Abstraction has 13549 states and 14130 transitions. [2019-12-07 18:59:08,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:59:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13549 states and 14130 transitions. [2019-12-07 18:59:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2019-12-07 18:59:08,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:08,467 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:08,468 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 434787481, now seen corresponding path program 1 times [2019-12-07 18:59:08,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:08,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634121589] [2019-12-07 18:59:08,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 534 proven. 191 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:59:09,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634121589] [2019-12-07 18:59:09,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731566937] [2019-12-07 18:59:09,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:59:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:09,158 INFO L264 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:59:09,164 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:09,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:09,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 638 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:59:09,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:09,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-12-07 18:59:09,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377202568] [2019-12-07 18:59:09,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:59:09,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:59:09,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:59:09,840 INFO L87 Difference]: Start difference. First operand 13549 states and 14130 transitions. Second operand 9 states. [2019-12-07 18:59:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:22,128 INFO L93 Difference]: Finished difference Result 43591 states and 45334 transitions. [2019-12-07 18:59:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 18:59:22,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 670 [2019-12-07 18:59:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:22,149 INFO L225 Difference]: With dead ends: 43591 [2019-12-07 18:59:22,149 INFO L226 Difference]: Without dead ends: 30943 [2019-12-07 18:59:22,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 696 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=972, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:59:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2019-12-07 18:59:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 20433. [2019-12-07 18:59:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20433 states. [2019-12-07 18:59:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 21158 transitions. [2019-12-07 18:59:22,350 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 21158 transitions. Word has length 670 [2019-12-07 18:59:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:22,351 INFO L462 AbstractCegarLoop]: Abstraction has 20433 states and 21158 transitions. [2019-12-07 18:59:22,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:59:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 21158 transitions. [2019-12-07 18:59:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-12-07 18:59:22,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:22,359 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:22,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:22,560 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1969280993, now seen corresponding path program 1 times [2019-12-07 18:59:22,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:22,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133464263] [2019-12-07 18:59:22,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 590 proven. 106 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-12-07 18:59:23,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133464263] [2019-12-07 18:59:23,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406846674] [2019-12-07 18:59:23,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:59:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:23,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:59:23,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:25,889 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse5 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse4 278887) (not (= (mod (+ .cse4 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< .cse5 0) (<= c_~a0~0 (+ (div (+ .cse4 (- 278886)) 5) 1)) (not (= (mod .cse5 5) 0)) (< .cse4 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse7 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse6 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse7 0) (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= 278886 .cse6) (not (= (mod .cse7 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse9 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (<= 278887 .cse8) (= (mod .cse9 5) 0) (< .cse8 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse11 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse10 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (<= 0 .cse11) (<= 278886 .cse10)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse13 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse12 278887) (not (= (mod (+ .cse12 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (= (mod .cse13 5) 0) (<= 278886 .cse12)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse15 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse14 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse14 4) 5))) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= 0 .cse15) (< .cse14 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse16 278887) (not (= (mod (+ .cse16 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse16 4) 5)) (< .cse17 0) (<= c_~a0~0 (div (+ .cse16 (- 278886)) 5)) (not (= (mod .cse17 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse19 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse18 278887) (not (= (mod (+ .cse18 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse18 4) 5))) (<= c_~a0~0 (+ (div (+ .cse18 (- 278887)) 5) 1)) (<= 0 .cse19) (< .cse18 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse21 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse20 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse20 4) 5)) (< .cse21 0) (<= c_~a0~0 (div (+ .cse20 (- 278886)) 5)) (not (= (mod .cse21 5) 0)))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse23 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse22 278887) (not (= (mod (+ .cse22 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse22 4) 5))) (<= c_~a0~0 (+ (div (+ .cse22 (- 278887)) 5) 1)) (= (mod .cse23 5) 0) (< .cse22 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse25 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse24 278887) (not (= (mod (+ .cse24 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse24 4) 5)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (= (mod .cse25 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse27 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse26 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse26 4) 5))) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (= (mod .cse27 5) 0) (< .cse26 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse29 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse28 4) 5)) (<= 278887 .cse28) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (not (= (mod .cse29 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse31 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse30 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse30 4) 5))) (< .cse31 0) (<= c_~a0~0 (+ (div (+ .cse30 (- 278886)) 5) 1)) (not (= (mod .cse31 5) 0)) (< .cse30 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse33 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse32 278887) (not (= (mod (+ .cse32 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse33 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)) (<= 278886 .cse32) (not (= (mod .cse33 5) 0))))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse35 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse34 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse34 4) 5)) (<= c_~a0~0 (div (+ .cse34 (- 278887)) 5)) (= (mod .cse35 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse37 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse36 4) 5))) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (<= 278887 .cse36) (<= 0 .cse37) (< .cse36 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse39 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse38 4) 5)) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 278887 .cse38) (= (mod .cse39 5) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse41 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse40 278887) (not (= (mod (+ .cse40 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse40 4) 5)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= 0 .cse41)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse43 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (<= 278887 .cse42) (<= 0 .cse43) (<= 278886 .cse42))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse45 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= 278887 .cse44) (< .cse45 0) (<= c_~a0~0 (div (+ .cse44 (- 278886)) 5)) (<= 278886 .cse44) (not (= (mod .cse45 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse47 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse46 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= 0 .cse47))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse49 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse48 278887) (not (= (mod (+ .cse48 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse48 (- 278887)) 5) 1)) (<= 0 .cse49) (<= 278886 .cse48)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse51 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse50 4) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)) (<= 278887 .cse50) (<= 0 .cse51)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse53 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= 278887 .cse52) (= (mod .cse53 5) 0) (<= 278886 .cse52)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse55 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (= (mod .cse55 5) 0) (<= 278886 .cse54)))))))) is different from false [2019-12-07 18:59:27,934 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_prenex_2 Int)) (let ((.cse5 (div (* v_prenex_2 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_prenex_2 147)) (<= (+ v_prenex_2 98) 0) (= (mod (+ .cse4 3) 5) 0) (<= 278886 .cse4) (<= (* 250 v_prenex_2) 0) (<= c_~a0~0 (div (+ .cse4 (- 278886)) 5)) (< .cse5 0) (not (= (mod .cse5 5) 0))))))) (and .cse2 (exists ((v_prenex_13 Int)) (let ((.cse7 (div (* v_prenex_13 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= (+ v_prenex_13 98) 0) (< 0 (+ v_prenex_13 147)) (= 0 (mod (+ .cse6 4) 5)) (<= (* 250 v_prenex_13) 0) (< .cse7 0) (not (= (mod .cse7 5) 0)) (<= 278887 .cse6))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (div (* v_prenex_1 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (+ (div (+ .cse8 (- 278886)) 5) 1)) (<= (* 250 v_prenex_1) 0) (<= (+ v_prenex_1 98) 0) (not (= (mod .cse9 5) 0)) (< .cse8 278886) (< 0 (+ v_prenex_1 147)) (< .cse8 278887) (not (= (mod (+ .cse8 3) 5) 0)) (< .cse9 0)))))) (and .cse2 .cse3 (exists ((v_prenex_5 Int)) (let ((.cse11 (div (* v_prenex_5 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (<= (+ v_prenex_5 98) 0) (<= (* 250 v_prenex_5) 0) (< .cse10 278887) (<= c_~a0~0 (+ (div (+ .cse10 (- 278887)) 5) 1)) (= (mod .cse11 5) 0) (< 0 (+ v_prenex_5 147)) (not (= (mod (+ .cse10 3) 5) 0))))))) (and .cse2 (exists ((v_prenex_3 Int)) (let ((.cse13 (div (* v_prenex_3 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< .cse12 278886) (<= (* 250 v_prenex_3) 0) (not (= 0 (mod (+ .cse12 4) 5))) (<= (+ v_prenex_3 98) 0) (<= 278887 .cse12) (< 0 (+ v_prenex_3 147)) (= (mod .cse13 5) 0) (<= c_~a0~0 (div (+ .cse12 (- 278887)) 5)))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_18 Int)) (let ((.cse15 (div (* v_prenex_18 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_prenex_18 147)) (<= 278887 .cse14) (= 0 (mod (+ .cse14 4) 5)) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= (* 250 v_prenex_18) 0) (= (mod .cse15 5) 0) (<= (+ v_prenex_18 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_8 Int)) (let ((.cse17 (div (* v_prenex_8 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (<= (* 250 v_prenex_8) 0) (< .cse16 278887) (< .cse16 278886) (<= (+ v_prenex_8 98) 0) (<= 0 .cse17) (not (= 0 (mod (+ .cse16 4) 5))) (< 0 (+ v_prenex_8 147)) (not (= (mod (+ .cse16 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1))))))) (and .cse2 .cse3 (exists ((v_prenex_9 Int)) (let ((.cse18 (div (* v_prenex_9 (- 250)) 9))) (let ((.cse19 (div .cse18 5))) (and (<= (+ v_prenex_9 98) 0) (not (= (mod .cse18 5) 0)) (< .cse18 0) (<= (* 250 v_prenex_9) 0) (= (mod (+ .cse19 3) 5) 0) (< 0 (+ v_prenex_9 147)) (= 0 (mod (+ .cse19 4) 5)) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5))))))) (and .cse2 .cse3 (exists ((v_prenex_26 Int)) (let ((.cse21 (div (* v_prenex_26 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_prenex_26 147)) (<= 278886 .cse20) (<= (+ v_prenex_26 98) 0) (<= (* 250 v_prenex_26) 0) (= (mod .cse21 5) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (= (mod (+ .cse20 3) 5) 0)))))) (and .cse2 (exists ((v_prenex_11 Int)) (let ((.cse22 (div (* v_prenex_11 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (= (mod .cse22 5) 0) (< 0 (+ v_prenex_11 147)) (<= (* 250 v_prenex_11) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278887)) 5) 1)) (< .cse23 278887) (not (= (mod (+ .cse23 3) 5) 0)) (= 0 (mod (+ .cse23 4) 5)) (<= (+ v_prenex_11 98) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_22 Int)) (let ((.cse25 (div (* v_prenex_22 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (<= (* 250 v_prenex_22) 0) (= 0 (mod (+ .cse24 4) 5)) (<= 0 .cse25) (< 0 (+ v_prenex_22 147)) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= (mod (+ .cse24 3) 5) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_12 Int)) (let ((.cse27 (div (* v_prenex_12 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (<= (* 250 v_prenex_12) 0) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (not (= 0 (mod (+ .cse26 4) 5))) (= (mod (+ .cse26 3) 5) 0) (< 0 (+ v_prenex_12 147)) (< .cse26 278886) (= (mod .cse27 5) 0) (<= (+ v_prenex_12 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_24 Int)) (let ((.cse28 (div (* v_prenex_24 (- 250)) 9))) (let ((.cse29 (div .cse28 5))) (and (<= 0 .cse28) (= 0 (mod (+ .cse29 4) 5)) (< 0 (+ v_prenex_24 147)) (<= c_~a0~0 (div (+ .cse29 (- 278887)) 5)) (<= (+ v_prenex_24 98) 0) (<= 278887 .cse29) (<= (* 250 v_prenex_24) 0)))))) (and .cse2 (exists ((v_prenex_20 Int)) (let ((.cse31 (div (* v_prenex_20 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (<= (+ v_prenex_20 98) 0) (<= c_~a0~0 (div (+ .cse30 (- 278887)) 5)) (< 0 (+ v_prenex_20 147)) (<= 278887 .cse30) (<= 278886 .cse30) (<= (* 250 v_prenex_20) 0) (<= 0 .cse31))))) .cse3) (and .cse2 (exists ((v_prenex_17 Int)) (let ((.cse32 (div (* v_prenex_17 (- 250)) 9))) (let ((.cse33 (div .cse32 5))) (and (<= 0 .cse32) (<= (+ v_prenex_17 98) 0) (< 0 (+ v_prenex_17 147)) (< .cse33 278886) (not (= 0 (mod (+ .cse33 4) 5))) (<= 278887 .cse33) (<= (* 250 v_prenex_17) 0) (<= c_~a0~0 (div (+ .cse33 (- 278887)) 5)))))) .cse3) (and .cse2 (exists ((v_prenex_23 Int)) (let ((.cse35 (div (* v_prenex_23 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= (* 250 v_prenex_23) 0) (<= (+ v_prenex_23 98) 0) (not (= (mod (+ .cse34 3) 5) 0)) (<= c_~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (< 0 (+ v_prenex_23 147)) (< .cse34 278887) (<= 0 .cse35))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_14 Int)) (let ((.cse37 (div (* v_prenex_14 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (= (mod (+ .cse36 3) 5) 0) (not (= (mod .cse37 5) 0)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278886)) 5) 1)) (<= (+ v_prenex_14 98) 0) (< 0 (+ v_prenex_14 147)) (not (= 0 (mod (+ .cse36 4) 5))) (<= (* 250 v_prenex_14) 0) (< .cse36 278886) (< .cse37 0)))))) (and .cse2 .cse3 (exists ((v_prenex_7 Int)) (let ((.cse38 (div (* v_prenex_7 (- 250)) 9))) (let ((.cse39 (div .cse38 5))) (and (< .cse38 0) (= 0 (mod (+ .cse39 4) 5)) (not (= (mod (+ .cse39 3) 5) 0)) (<= (* 250 v_prenex_7) 0) (<= (+ v_prenex_7 98) 0) (not (= (mod .cse38 5) 0)) (< 0 (+ v_prenex_7 147)) (< .cse39 278887) (<= c_~a0~0 (div (+ .cse39 (- 278886)) 5))))))) (and .cse2 .cse3 (exists ((v_prenex_15 Int)) (let ((.cse40 (div (* v_prenex_15 (- 250)) 9))) (let ((.cse41 (div .cse40 5))) (and (not (= (mod .cse40 5) 0)) (< .cse41 278887) (< 0 (+ v_prenex_15 147)) (<= 278886 .cse41) (not (= (mod (+ .cse41 3) 5) 0)) (<= c_~a0~0 (div (+ .cse41 (- 278886)) 5)) (< .cse40 0) (<= (* 250 v_prenex_15) 0) (<= (+ v_prenex_15 98) 0)))))) (and .cse2 .cse3 (exists ((v_prenex_19 Int)) (let ((.cse43 (div (* v_prenex_19 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= (+ v_prenex_19 98) 0) (<= c_~a0~0 (+ (div (+ .cse42 (- 278887)) 5) 1)) (< .cse42 278887) (<= 0 .cse43) (<= (* 250 v_prenex_19) 0) (= 0 (mod (+ .cse42 4) 5)) (< 0 (+ v_prenex_19 147)) (not (= (mod (+ .cse42 3) 5) 0))))))) (and .cse2 .cse3 (exists ((v_prenex_10 Int)) (let ((.cse45 (div (* v_prenex_10 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< .cse44 278887) (<= c_~a0~0 (+ (div (+ .cse44 (- 278887)) 5) 1)) (<= (* 250 v_prenex_10) 0) (<= (+ v_prenex_10 98) 0) (not (= 0 (mod (+ .cse44 4) 5))) (< .cse44 278886) (= (mod .cse45 5) 0) (not (= (mod (+ .cse44 3) 5) 0)) (< 0 (+ v_prenex_10 147))))))) (and .cse2 (exists ((v_prenex_16 Int)) (let ((.cse47 (div (* v_prenex_16 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (= (mod (+ .cse46 3) 5) 0) (< 0 (+ v_prenex_16 147)) (= (mod .cse47 5) 0) (<= (+ v_prenex_16 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= (* 250 v_prenex_16) 0) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* v_prenex_6 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (not (= 0 (mod (+ .cse48 4) 5))) (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (= (mod (+ .cse48 3) 5) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49) (<= (* 250 v_prenex_6) 0) (< .cse48 278886)))))) (and .cse2 (exists ((v_prenex_25 Int)) (let ((.cse50 (div (* v_prenex_25 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (<= (+ v_prenex_25 98) 0) (= (mod .cse50 5) 0) (< 0 (+ v_prenex_25 147)) (<= c_~a0~0 (div (+ .cse51 (- 278887)) 5)) (<= 278886 .cse51) (<= (* 250 v_prenex_25) 0) (<= 278887 .cse51))))) .cse3) (and .cse2 .cse3 (exists ((v_prenex_21 Int)) (let ((.cse53 (div (* v_prenex_21 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (<= (+ v_prenex_21 98) 0) (< 0 (+ v_prenex_21 147)) (<= 278886 .cse52) (< .cse53 0) (<= c_~a0~0 (div (+ .cse52 (- 278886)) 5)) (not (= (mod .cse53 5) 0)) (<= (* 250 v_prenex_21) 0) (<= 278887 .cse52)))))) (and .cse2 (exists ((v_prenex_4 Int)) (let ((.cse55 (div (* v_prenex_4 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (<= 0 .cse55) (< 0 (+ v_prenex_4 147)) (<= (+ v_prenex_4 98) 0) (<= 278886 .cse54) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_prenex_4) 0))))) .cse3))) is different from false [2019-12-07 18:59:28,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 27 terms [2019-12-07 18:59:28,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:28,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 19 refuted. 0 times theorem prover too weak. 344 trivial. 33 not checked. [2019-12-07 18:59:35,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:35,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-12-07 18:59:35,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952048708] [2019-12-07 18:59:35,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:59:35,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:35,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:59:35,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=95, Unknown=2, NotChecked=42, Total=182 [2019-12-07 18:59:35,463 INFO L87 Difference]: Start difference. First operand 20433 states and 21158 transitions. Second operand 14 states. [2019-12-07 18:59:40,185 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (<= (+ c_~a4~0 86) 0)) (.cse3 (= 1 c_~a2~0))) (or (and (exists ((v_~a0~0_825 Int)) (let ((.cse1 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse0 4) 5))) (<= 278887 .cse0) (< .cse1 0) (<= c_~a0~0 (+ (div (+ .cse0 (- 278886)) 5) 1)) (not (= (mod .cse1 5) 0)) (< .cse0 278886))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse5 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse4 278887) (not (= (mod (+ .cse4 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse4 4) 5))) (< .cse5 0) (<= c_~a0~0 (+ (div (+ .cse4 (- 278886)) 5) 1)) (not (= (mod .cse5 5) 0)) (< .cse4 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse7 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse6 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse7 0) (<= c_~a0~0 (div (+ .cse6 (- 278886)) 5)) (<= 278886 .cse6) (not (= (mod .cse7 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse9 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse8 4) 5))) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (<= 278887 .cse8) (= (mod .cse9 5) 0) (< .cse8 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse11 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse10 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (<= 0 .cse11) (<= 278886 .cse10)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse13 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse12 278887) (not (= (mod (+ .cse12 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (= (mod .cse13 5) 0) (<= 278886 .cse12)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse15 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse14 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse14 4) 5))) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (<= 0 .cse15) (< .cse14 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse16 278887) (not (= (mod (+ .cse16 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse16 4) 5)) (< .cse17 0) (<= c_~a0~0 (div (+ .cse16 (- 278886)) 5)) (not (= (mod .cse17 5) 0)))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse19 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse18 278887) (not (= (mod (+ .cse18 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse18 4) 5))) (<= c_~a0~0 (+ (div (+ .cse18 (- 278887)) 5) 1)) (<= 0 .cse19) (< .cse18 278886))))) .cse3) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse21 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse20 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse20 4) 5)) (< .cse21 0) (<= c_~a0~0 (div (+ .cse20 (- 278886)) 5)) (not (= (mod .cse21 5) 0)))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse23 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse22 278887) (not (= (mod (+ .cse22 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse22 4) 5))) (<= c_~a0~0 (+ (div (+ .cse22 (- 278887)) 5) 1)) (= (mod .cse23 5) 0) (< .cse22 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse25 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse24 278887) (not (= (mod (+ .cse24 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse24 4) 5)) (<= c_~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (= (mod .cse25 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse27 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse26 (div .cse27 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse26 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse26 4) 5))) (<= c_~a0~0 (div (+ .cse26 (- 278887)) 5)) (= (mod .cse27 5) 0) (< .cse26 278886)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse29 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse28 4) 5)) (<= 278887 .cse28) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (not (= (mod .cse29 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse31 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse30 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse30 4) 5))) (< .cse31 0) (<= c_~a0~0 (+ (div (+ .cse30 (- 278886)) 5) 1)) (not (= (mod .cse31 5) 0)) (< .cse30 278886))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse33 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse32 278887) (not (= (mod (+ .cse32 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (< .cse33 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)) (<= 278886 .cse32) (not (= (mod .cse33 5) 0))))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse35 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse34 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse34 4) 5)) (<= c_~a0~0 (div (+ .cse34 (- 278887)) 5)) (= (mod .cse35 5) 0)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse37 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (not (= 0 (mod (+ .cse36 4) 5))) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (<= 278887 .cse36) (<= 0 .cse37) (< .cse36 278886)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse39 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse38 4) 5)) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 278887 .cse38) (= (mod .cse39 5) 0))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse41 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse40 278887) (not (= (mod (+ .cse40 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse40 4) 5)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= 0 .cse41)))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse43 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (<= 278887 .cse42) (<= 0 .cse43) (<= 278886 .cse42))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse45 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= 278887 .cse44) (< .cse45 0) (<= c_~a0~0 (div (+ .cse44 (- 278886)) 5)) (<= 278886 .cse44) (not (= (mod .cse45 5) 0))))))) (and .cse2 (exists ((v_~a0~0_825 Int)) (let ((.cse47 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse46 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse46 4) 5)) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= 0 .cse47))))) .cse3) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse49 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_~a0~0_825 147)) (< .cse48 278887) (not (= (mod (+ .cse48 3) 5) 0)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (+ (div (+ .cse48 (- 278887)) 5) 1)) (<= 0 .cse49) (<= 278886 .cse48)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse51 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (= 0 (mod (+ .cse50 4) 5)) (<= c_~a0~0 (div (+ .cse50 (- 278887)) 5)) (<= 278887 .cse50) (<= 0 .cse51)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse53 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (< 0 (+ v_~a0~0_825 147)) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (<= 278887 .cse52) (= (mod .cse53 5) 0) (<= 278886 .cse52)))))) (and .cse2 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse55 (div (* v_~a0~0_825 (- 250)) 9))) (let ((.cse54 (div .cse55 5))) (and (< 0 (+ v_~a0~0_825 147)) (= (mod (+ .cse54 3) 5) 0) (<= (* 250 v_~a0~0_825) 0) (<= (+ v_~a0~0_825 98) 0) (<= c_~a0~0 (div (+ .cse54 (- 278887)) 5)) (= (mod .cse55 5) 0) (<= 278886 .cse54)))))))) (<= (+ c_~a29~0 144) 0) (not (= 3 c_~a2~0))) is different from false [2019-12-07 18:59:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:45,104 INFO L93 Difference]: Finished difference Result 48869 states and 50525 transitions. [2019-12-07 18:59:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:59:45,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 706 [2019-12-07 18:59:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:45,122 INFO L225 Difference]: With dead ends: 48869 [2019-12-07 18:59:45,122 INFO L226 Difference]: Without dead ends: 28737 [2019-12-07 18:59:45,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 705 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=62, Invalid=157, Unknown=3, NotChecked=84, Total=306 [2019-12-07 18:59:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-07 18:59:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 22827. [2019-12-07 18:59:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2019-12-07 18:59:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 23624 transitions. [2019-12-07 18:59:45,332 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 23624 transitions. Word has length 706 [2019-12-07 18:59:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:45,332 INFO L462 AbstractCegarLoop]: Abstraction has 22827 states and 23624 transitions. [2019-12-07 18:59:45,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:59:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 23624 transitions. [2019-12-07 18:59:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-12-07 18:59:45,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:45,350 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:59:45,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:45,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:45,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1995279578, now seen corresponding path program 1 times [2019-12-07 18:59:45,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:45,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709469942] [2019-12-07 18:59:45,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-12-07 18:59:46,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709469942] [2019-12-07 18:59:46,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:46,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:59:46,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389363130] [2019-12-07 18:59:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:59:46,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:59:46,016 INFO L87 Difference]: Start difference. First operand 22827 states and 23624 transitions. Second operand 3 states. [2019-12-07 18:59:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:46,793 INFO L93 Difference]: Finished difference Result 37519 states and 38767 transitions. [2019-12-07 18:59:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 861 [2019-12-07 18:59:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:46,807 INFO L225 Difference]: With dead ends: 37519 [2019-12-07 18:59:46,807 INFO L226 Difference]: Without dead ends: 16490 [2019-12-07 18:59:46,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:59:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2019-12-07 18:59:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 15892. [2019-12-07 18:59:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15892 states. [2019-12-07 18:59:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15892 states to 15892 states and 16283 transitions. [2019-12-07 18:59:46,980 INFO L78 Accepts]: Start accepts. Automaton has 15892 states and 16283 transitions. Word has length 861 [2019-12-07 18:59:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:46,981 INFO L462 AbstractCegarLoop]: Abstraction has 15892 states and 16283 transitions. [2019-12-07 18:59:46,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:59:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 15892 states and 16283 transitions. [2019-12-07 18:59:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2019-12-07 18:59:46,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:46,994 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:59:46,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1791373101, now seen corresponding path program 1 times [2019-12-07 18:59:46,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:46,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421225957] [2019-12-07 18:59:46,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-12-07 18:59:47,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421225957] [2019-12-07 18:59:47,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:47,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:59:47,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373180237] [2019-12-07 18:59:47,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:59:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:59:47,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:59:47,881 INFO L87 Difference]: Start difference. First operand 15892 states and 16283 transitions. Second operand 5 states. [2019-12-07 18:59:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:49,807 INFO L93 Difference]: Finished difference Result 32398 states and 33201 transitions. [2019-12-07 18:59:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:59:49,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 870 [2019-12-07 18:59:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:49,826 INFO L225 Difference]: With dead ends: 32398 [2019-12-07 18:59:49,826 INFO L226 Difference]: Without dead ends: 17106 [2019-12-07 18:59:49,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:59:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-12-07 18:59:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 15890. [2019-12-07 18:59:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15890 states. [2019-12-07 18:59:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15890 states to 15890 states and 16269 transitions. [2019-12-07 18:59:49,970 INFO L78 Accepts]: Start accepts. Automaton has 15890 states and 16269 transitions. Word has length 870 [2019-12-07 18:59:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:49,971 INFO L462 AbstractCegarLoop]: Abstraction has 15890 states and 16269 transitions. [2019-12-07 18:59:49,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:59:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15890 states and 16269 transitions. [2019-12-07 18:59:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-12-07 18:59:49,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:49,985 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:59:49,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash -323160536, now seen corresponding path program 1 times [2019-12-07 18:59:49,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:49,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986054444] [2019-12-07 18:59:49,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1025 proven. 286 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-12-07 18:59:51,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986054444] [2019-12-07 18:59:51,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127953762] [2019-12-07 18:59:51,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/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 18:59:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:51,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 18:59:51,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:51,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:59:51,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:51,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:59:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1239 proven. 2 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-12-07 18:59:52,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:52,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-12-07 18:59:52,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834553296] [2019-12-07 18:59:52,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:59:52,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:59:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:52,652 INFO L87 Difference]: Start difference. First operand 15890 states and 16269 transitions. Second operand 16 states. [2019-12-07 18:59:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:57,917 INFO L93 Difference]: Finished difference Result 32897 states and 33666 transitions. [2019-12-07 18:59:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:59:57,918 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 896 [2019-12-07 18:59:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:57,929 INFO L225 Difference]: With dead ends: 32897 [2019-12-07 18:59:57,929 INFO L226 Difference]: Without dead ends: 17607 [2019-12-07 18:59:57,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 909 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:59:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17607 states. [2019-12-07 18:59:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17607 to 14991. [2019-12-07 18:59:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-12-07 18:59:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 15320 transitions. [2019-12-07 18:59:58,067 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 15320 transitions. Word has length 896 [2019-12-07 18:59:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:58,067 INFO L462 AbstractCegarLoop]: Abstraction has 14991 states and 15320 transitions. [2019-12-07 18:59:58,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:59:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 15320 transitions. [2019-12-07 18:59:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-12-07 18:59:58,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:58,082 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:59:58,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:58,283 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash -542640556, now seen corresponding path program 1 times [2019-12-07 18:59:58,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:58,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590870959] [2019-12-07 18:59:58,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 1032 proven. 198 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 18:59:59,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590870959] [2019-12-07 18:59:59,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188906623] [2019-12-07 18:59:59,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:59,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:59:59,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:59:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:02,948 WARN L192 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2019-12-07 19:01:02,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:01:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-12-07 19:01:03,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:01:03,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-12-07 19:01:03,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742771632] [2019-12-07 19:01:03,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:03,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:01:03,818 INFO L87 Difference]: Start difference. First operand 14991 states and 15320 transitions. Second operand 5 states. [2019-12-07 19:01:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:09,140 INFO L93 Difference]: Finished difference Result 34579 states and 35341 transitions. [2019-12-07 19:01:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:01:09,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 902 [2019-12-07 19:01:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:09,154 INFO L225 Difference]: With dead ends: 34579 [2019-12-07 19:01:09,154 INFO L226 Difference]: Without dead ends: 20689 [2019-12-07 19:01:09,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 903 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:01:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20689 states. [2019-12-07 19:01:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20689 to 16791. [2019-12-07 19:01:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2019-12-07 19:01:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 17136 transitions. [2019-12-07 19:01:09,308 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 17136 transitions. Word has length 902 [2019-12-07 19:01:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:09,308 INFO L462 AbstractCegarLoop]: Abstraction has 16791 states and 17136 transitions. [2019-12-07 19:01:09,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 17136 transitions. [2019-12-07 19:01:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2019-12-07 19:01:09,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:09,318 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 19:01:09,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:09,520 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 411928055, now seen corresponding path program 1 times [2019-12-07 19:01:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:09,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377938556] [2019-12-07 19:01:09,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 1024 proven. 188 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-12-07 19:01:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377938556] [2019-12-07 19:01:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712048684] [2019-12-07 19:01:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:10,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:01:10,457 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:10,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:18,692 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 30 [2019-12-07 19:01:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:01:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-12-07 19:01:19,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:01:19,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 19:01:19,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671923054] [2019-12-07 19:01:19,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:19,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:01:19,437 INFO L87 Difference]: Start difference. First operand 16791 states and 17136 transitions. Second operand 5 states. [2019-12-07 19:01:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:22,435 INFO L93 Difference]: Finished difference Result 37812 states and 38607 transitions. [2019-12-07 19:01:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:01:22,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 931 [2019-12-07 19:01:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:22,449 INFO L225 Difference]: With dead ends: 37812 [2019-12-07 19:01:22,449 INFO L226 Difference]: Without dead ends: 22487 [2019-12-07 19:01:22,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 930 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:01:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-12-07 19:01:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 16191. [2019-12-07 19:01:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16191 states. [2019-12-07 19:01:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16191 states to 16191 states and 16531 transitions. [2019-12-07 19:01:22,613 INFO L78 Accepts]: Start accepts. Automaton has 16191 states and 16531 transitions. Word has length 931 [2019-12-07 19:01:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:22,614 INFO L462 AbstractCegarLoop]: Abstraction has 16191 states and 16531 transitions. [2019-12-07 19:01:22,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16191 states and 16531 transitions. [2019-12-07 19:01:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-12-07 19:01:22,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:22,626 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:22,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:22,827 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 20026544, now seen corresponding path program 1 times [2019-12-07 19:01:22,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:22,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999487537] [2019-12-07 19:01:22,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1017 proven. 150 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 19:01:23,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999487537] [2019-12-07 19:01:23,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612170665] [2019-12-07 19:01:23,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:23,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:01:23,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:01:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-12-07 19:01:24,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:01:24,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 19:01:24,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956316313] [2019-12-07 19:01:24,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:24,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:01:24,663 INFO L87 Difference]: Start difference. First operand 16191 states and 16531 transitions. Second operand 5 states. [2019-12-07 19:01:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:27,144 INFO L93 Difference]: Finished difference Result 37206 states and 38023 transitions. [2019-12-07 19:01:27,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:01:27,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1014 [2019-12-07 19:01:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:27,158 INFO L225 Difference]: With dead ends: 37206 [2019-12-07 19:01:27,158 INFO L226 Difference]: Without dead ends: 22481 [2019-12-07 19:01:27,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:01:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22481 states. [2019-12-07 19:01:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22481 to 18884. [2019-12-07 19:01:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18884 states. [2019-12-07 19:01:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18884 states to 18884 states and 19309 transitions. [2019-12-07 19:01:27,347 INFO L78 Accepts]: Start accepts. Automaton has 18884 states and 19309 transitions. Word has length 1014 [2019-12-07 19:01:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:27,347 INFO L462 AbstractCegarLoop]: Abstraction has 18884 states and 19309 transitions. [2019-12-07 19:01:27,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18884 states and 19309 transitions. [2019-12-07 19:01:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-12-07 19:01:27,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:27,360 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:27,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:27,561 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2103214973, now seen corresponding path program 1 times [2019-12-07 19:01:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:27,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720910831] [2019-12-07 19:01:27,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1138 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 19:01:29,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720910831] [2019-12-07 19:01:29,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059243107] [2019-12-07 19:01:29,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:30,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:01:30,128 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1203 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-12-07 19:01:30,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:01:30,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-12-07 19:01:30,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957982622] [2019-12-07 19:01:30,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:30,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:01:30,979 INFO L87 Difference]: Start difference. First operand 18884 states and 19309 transitions. Second operand 5 states. [2019-12-07 19:01:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:32,111 INFO L93 Difference]: Finished difference Result 37186 states and 38031 transitions. [2019-12-07 19:01:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:32,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1052 [2019-12-07 19:01:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:32,123 INFO L225 Difference]: With dead ends: 37186 [2019-12-07 19:01:32,123 INFO L226 Difference]: Without dead ends: 17700 [2019-12-07 19:01:32,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 1051 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:01:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17700 states. [2019-12-07 19:01:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17700 to 17682. [2019-12-07 19:01:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17682 states. [2019-12-07 19:01:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 17982 transitions. [2019-12-07 19:01:32,281 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 17982 transitions. Word has length 1052 [2019-12-07 19:01:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:32,282 INFO L462 AbstractCegarLoop]: Abstraction has 17682 states and 17982 transitions. [2019-12-07 19:01:32,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 17982 transitions. [2019-12-07 19:01:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1082 [2019-12-07 19:01:32,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:32,294 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:32,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:32,496 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:32,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1579037771, now seen corresponding path program 1 times [2019-12-07 19:01:32,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:32,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418786544] [2019-12-07 19:01:32,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1847 backedges. 1137 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2019-12-07 19:01:33,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418786544] [2019-12-07 19:01:33,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:33,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:33,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000506357] [2019-12-07 19:01:33,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:33,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:33,185 INFO L87 Difference]: Start difference. First operand 17682 states and 17982 transitions. Second operand 3 states. [2019-12-07 19:01:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:34,051 INFO L93 Difference]: Finished difference Result 33266 states and 33837 transitions. [2019-12-07 19:01:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:34,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1081 [2019-12-07 19:01:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:34,065 INFO L225 Difference]: With dead ends: 33266 [2019-12-07 19:01:34,065 INFO L226 Difference]: Without dead ends: 17382 [2019-12-07 19:01:34,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17382 states. [2019-12-07 19:01:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17382 to 17083. [2019-12-07 19:01:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17083 states. [2019-12-07 19:01:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17083 states to 17083 states and 17375 transitions. [2019-12-07 19:01:34,214 INFO L78 Accepts]: Start accepts. Automaton has 17083 states and 17375 transitions. Word has length 1081 [2019-12-07 19:01:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:34,215 INFO L462 AbstractCegarLoop]: Abstraction has 17083 states and 17375 transitions. [2019-12-07 19:01:34,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17083 states and 17375 transitions. [2019-12-07 19:01:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-12-07 19:01:34,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:34,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:34,227 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:34,227 INFO L82 PathProgramCache]: Analyzing trace with hash -733344715, now seen corresponding path program 1 times [2019-12-07 19:01:34,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:34,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828239597] [2019-12-07 19:01:34,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 1439 proven. 102 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-12-07 19:01:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828239597] [2019-12-07 19:01:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861032672] [2019-12-07 19:01:36,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:36,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:01:36,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:47,258 WARN L192 SmtUtils]: Spent 10.69 s on a formula simplification. DAG size of input: 96 DAG size of output: 30 [2019-12-07 19:01:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1865 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-12-07 19:01:48,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:01:48,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-12-07 19:01:48,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632497518] [2019-12-07 19:01:48,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:48,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:01:48,175 INFO L87 Difference]: Start difference. First operand 17083 states and 17375 transitions. Second operand 4 states. [2019-12-07 19:01:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:49,994 INFO L93 Difference]: Finished difference Result 33568 states and 34138 transitions. [2019-12-07 19:01:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:49,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1102 [2019-12-07 19:01:49,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:50,006 INFO L225 Difference]: With dead ends: 33568 [2019-12-07 19:01:50,007 INFO L226 Difference]: Without dead ends: 17685 [2019-12-07 19:01:50,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:01:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-12-07 19:01:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 10195. [2019-12-07 19:01:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10195 states. [2019-12-07 19:01:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10195 states to 10195 states and 10336 transitions. [2019-12-07 19:01:50,138 INFO L78 Accepts]: Start accepts. Automaton has 10195 states and 10336 transitions. Word has length 1102 [2019-12-07 19:01:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:50,138 INFO L462 AbstractCegarLoop]: Abstraction has 10195 states and 10336 transitions. [2019-12-07 19:01:50,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 10195 states and 10336 transitions. [2019-12-07 19:01:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2019-12-07 19:01:50,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:50,149 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:50,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:50,351 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1476661208, now seen corresponding path program 1 times [2019-12-07 19:01:50,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:50,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967134276] [2019-12-07 19:01:50,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 1107 proven. 628 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-12-07 19:01:51,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967134276] [2019-12-07 19:01:51,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874366275] [2019-12-07 19:01:51,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:52,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:01:52,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:52,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:52,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:52,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:01:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 1458 proven. 104 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-12-07 19:01:56,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:01:56,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2019-12-07 19:01:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177039381] [2019-12-07 19:01:56,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 19:01:56,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 19:01:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:01:56,111 INFO L87 Difference]: Start difference. First operand 10195 states and 10336 transitions. Second operand 15 states. [2019-12-07 19:02:13,834 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 19:02:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:19,154 INFO L93 Difference]: Finished difference Result 28371 states and 28766 transitions. [2019-12-07 19:02:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 19:02:19,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1131 [2019-12-07 19:02:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:19,164 INFO L225 Difference]: With dead ends: 28371 [2019-12-07 19:02:19,165 INFO L226 Difference]: Without dead ends: 18174 [2019-12-07 19:02:19,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1157 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:02:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18174 states. [2019-12-07 19:02:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18174 to 10495. [2019-12-07 19:02:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10495 states. [2019-12-07 19:02:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 10609 transitions. [2019-12-07 19:02:19,282 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 10609 transitions. Word has length 1131 [2019-12-07 19:02:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:19,283 INFO L462 AbstractCegarLoop]: Abstraction has 10495 states and 10609 transitions. [2019-12-07 19:02:19,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 19:02:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 10609 transitions. [2019-12-07 19:02:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1191 [2019-12-07 19:02:19,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:19,296 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:19,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:19,497 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1950595044, now seen corresponding path program 1 times [2019-12-07 19:02:19,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:19,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755022451] [2019-12-07 19:02:19,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1362 proven. 237 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 19:02:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755022451] [2019-12-07 19:02:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583919907] [2019-12-07 19:02:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:20,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:02:20,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:20,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:02:20,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:02:22,425 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-12-07 19:02:22,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:02:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-12-07 19:02:23,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:02:23,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 19:02:23,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832324309] [2019-12-07 19:02:23,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:23,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:23,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:02:23,418 INFO L87 Difference]: Start difference. First operand 10495 states and 10609 transitions. Second operand 5 states. [2019-12-07 19:02:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:25,118 INFO L93 Difference]: Finished difference Result 22220 states and 22464 transitions. [2019-12-07 19:02:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:02:25,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1190 [2019-12-07 19:02:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:25,119 INFO L225 Difference]: With dead ends: 22220 [2019-12-07 19:02:25,119 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:02:25,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:02:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:02:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:02:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:02:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:02:25,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1190 [2019-12-07 19:02:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:25,125 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:02:25,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:02:25,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:02:25,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:25,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:02:26,933 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 1764 DAG size of output: 1594 [2019-12-07 19:02:28,381 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 1213 DAG size of output: 1045 [2019-12-07 19:02:28,895 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 729 DAG size of output: 633 [2019-12-07 19:03:23,634 WARN L192 SmtUtils]: Spent 54.73 s on a formula simplification. DAG size of input: 1539 DAG size of output: 166 [2019-12-07 19:03:53,424 WARN L192 SmtUtils]: Spent 29.78 s on a formula simplification. DAG size of input: 991 DAG size of output: 166 [2019-12-07 19:03:58,898 WARN L192 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 610 DAG size of output: 170 [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,902 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,903 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,904 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,905 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 19:03:58,906 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 169) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,907 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,908 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,909 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,910 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,911 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 19:03:58,912 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,913 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,914 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,915 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse28 (+ ~a29~0 16))) (let ((.cse23 (+ ~a29~0 127)) (.cse4 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse11 (<= .cse28 0)) (.cse27 (+ ~a4~0 86)) (.cse26 (+ ~a29~0 144))) (let ((.cse14 (<= .cse26 0)) (.cse19 (<= 2 ~a2~0)) (.cse5 (= 2 ~a2~0)) (.cse20 (<= (+ ~a0~0 147) 0)) (.cse15 (<= (+ ~a0~0 242851) 0)) (.cse8 (< 0 .cse28)) (.cse2 (<= ~a2~0 3)) (.cse3 (<= 3 ~a2~0)) (.cse0 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse12 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse10 (= 4 ~a2~0)) (.cse16 (= 1 ~a2~0)) (.cse1 (<= .cse27 0)) (.cse17 (or .cse4 (< 0 .cse27) .cse11)) (.cse9 (< 0 .cse26)) (.cse7 (<= ~a0~0 599976)) (.cse24 (<= 4453 ~a29~0)) (.cse21 (<= (+ ~a0~0 98) 0)) (.cse25 (<= 0 (+ ~a0~0 146))) (.cse18 (= 5 ~a2~0)) (.cse6 (<= 0 .cse23))) (or (and (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse6)) .cse7) (and .cse7 (or (and .cse1 .cse8 (<= ~a29~0 42) .cse9 .cse10) (and .cse1 .cse11 .cse9 .cse12 .cse10))) (and (exists ((v_~a0~0_836 Int)) (let ((.cse13 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse13 (- 278887)) 5) 1)) (< .cse13 278887) (not (= (mod (+ .cse13 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse13 3) 5) 0)) (< .cse13 278886) (<= v_~a0~0_836 599999)))) (or .cse14 (and .cse15 .cse11 .cse9)) .cse10) (and .cse15 .cse16 .cse6) (and .cse1 .cse17 .cse8 (or (<= ~a29~0 43) .cse12) .cse7 .cse9 .cse18) (and (or (and .cse19 .cse1 .cse11 .cse9 .cse2 (not (= 3 ~a2~0)) .cse6) (and .cse1 .cse14 .cse5)) .cse7) (and .cse1 (<= (+ ~a0~0 61) 0)) (and .cse8 .cse16 .cse20) (and .cse19 (<= ~a2~0 2) .cse20) (and .cse21 .cse2 .cse3) (and .cse21 .cse8 .cse5) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) .cse16 (<= 0 .cse22) (<= .cse23 0) .cse6 (<= .cse22 0))) (and .cse20 .cse18 .cse24 .cse3) (and (or (< 0 (+ ~a4~0 42)) (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse8 .cse20 .cse10 .cse3) (and .cse15 .cse9 .cse18) (and .cse1 .cse8 .cse7 .cse2 .cse3) (and .cse21 .cse25 .cse11 .cse9 .cse18) (and .cse1 .cse0 .cse12 .cse10 (<= ~a0~0 599920)) (and .cse21 .cse16 .cse25 .cse11 .cse9) (and .cse1 .cse17 .cse9 .cse7 .cse18 .cse24) (and .cse21 .cse25 .cse18 .cse6))))) [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 19:03:58,916 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 19:03:58,917 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,918 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,918 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,918 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,918 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,918 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse23 (+ ~a29~0 127)) (.cse26 (+ ~a29~0 144)) (.cse27 (+ ~a29~0 16))) (let ((.cse5 (<= 4453 ~a29~0)) (.cse14 (not (= 3 ~a2~0))) (.cse1 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse13 (<= 2 ~a2~0)) (.cse18 (<= (+ ~a0~0 147) 0)) (.cse6 (< 0 .cse27)) (.cse2 (<= ~a0~0 599976)) (.cse11 (<= ~a2~0 3)) (.cse12 (<= 3 ~a2~0)) (.cse16 (<= (+ ~a0~0 242851) 0)) (.cse19 (<= .cse26 0)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse10 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse9 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse7 (= 4 ~a2~0)) (.cse17 (= 1 ~a2~0)) (.cse8 (<= .cse27 0)) (.cse3 (< 0 .cse26)) (.cse21 (<= (+ ~a0~0 98) 0)) (.cse25 (<= 0 (+ ~a0~0 146))) (.cse4 (= 5 ~a2~0)) (.cse15 (<= 0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (or (and .cse0 .cse6 (<= ~a29~0 42) .cse3 .cse7) (and .cse0 .cse8 .cse3 .cse9 .cse7))) (and (or (and .cse10 .cse0 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse11 .cse14 .cse15)) .cse2) (and .cse16 .cse17 .cse15) (and .cse18 .cse4 .cse14 .cse5 .cse12) (and (or (and .cse13 .cse0 .cse19 .cse11 .cse14) (and .cse13 .cse0 .cse8 .cse3 .cse11 .cse14 .cse15)) .cse2) (and .cse6 .cse18 .cse7 .cse14 .cse12) (and .cse6 .cse17 .cse18) (let ((.cse20 (<= ~a29~0 43))) (and .cse0 (or .cse1 .cse20) .cse6 (or .cse20 .cse9) .cse2 .cse3 .cse4)) (and .cse0 (<= (+ ~a0~0 61) 0)) (and .cse13 (<= ~a2~0 2) .cse18) (and .cse21 .cse11 .cse12) (and .cse21 .cse6 (= 2 ~a2~0)) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) .cse17 (<= 0 .cse22) (<= .cse23 0) .cse15 (<= .cse22 0))) (and .cse16 .cse3 .cse4) (and .cse0 .cse6 .cse2 .cse11 .cse12) (and (exists ((v_~a0~0_836 Int)) (let ((.cse24 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (< .cse24 278887) (not (= (mod (+ .cse24 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (<= v_~a0~0_836 599999)))) (or .cse16 .cse19) .cse7) (and .cse21 .cse25 .cse8 .cse3 .cse4) (and .cse0 .cse10 .cse9 .cse7 (<= ~a0~0 599920)) (and .cse21 .cse17 .cse25 .cse8 .cse3) (and .cse21 .cse25 .cse4 .cse15)))) [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,919 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,920 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,921 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,922 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,923 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,924 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse23 (+ ~a29~0 127)) (.cse26 (+ ~a29~0 144)) (.cse27 (+ ~a29~0 16))) (let ((.cse5 (<= 4453 ~a29~0)) (.cse14 (not (= 3 ~a2~0))) (.cse1 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse13 (<= 2 ~a2~0)) (.cse19 (<= (+ ~a0~0 147) 0)) (.cse6 (< 0 .cse27)) (.cse2 (<= ~a0~0 599976)) (.cse11 (<= ~a2~0 3)) (.cse12 (<= 3 ~a2~0)) (.cse16 (<= (+ ~a0~0 242851) 0)) (.cse18 (<= .cse26 0)) (.cse0 (<= (+ ~a4~0 86) 0)) (.cse10 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse9 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse7 (= 4 ~a2~0)) (.cse17 (= 1 ~a2~0)) (.cse8 (<= .cse27 0)) (.cse3 (< 0 .cse26)) (.cse21 (<= (+ ~a0~0 98) 0)) (.cse25 (<= 0 (+ ~a0~0 146))) (.cse4 (= 5 ~a2~0)) (.cse15 (<= 0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (or (and .cse0 .cse6 (<= ~a29~0 42) .cse3 .cse7) (and .cse0 .cse8 .cse3 .cse9 .cse7))) (and (or (and .cse10 .cse0 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse11 .cse14 .cse15)) .cse2) (and .cse16 .cse17 .cse15) (and (or (and .cse13 .cse0 .cse18 .cse11 .cse14) (and .cse13 .cse0 .cse8 .cse3 .cse11 .cse14 .cse15)) .cse2) (and .cse19 .cse4 .cse14 .cse5 .cse12) (and .cse6 .cse19 .cse7 .cse14 .cse12) (and .cse6 .cse17 .cse19) (let ((.cse20 (<= ~a29~0 43))) (and .cse0 (or .cse1 .cse20) .cse6 (or .cse20 .cse9) .cse2 .cse3 .cse4)) (and .cse0 (<= (+ ~a0~0 61) 0)) (and .cse13 (<= ~a2~0 2) .cse19) (and .cse21 .cse11 .cse12) (and .cse21 .cse6 (= 2 ~a2~0)) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) .cse17 (<= 0 .cse22) (<= .cse23 0) .cse15 (<= .cse22 0))) (and .cse16 .cse3 .cse4) (and .cse0 .cse6 .cse2 .cse11 .cse12) (and (exists ((v_~a0~0_836 Int)) (let ((.cse24 (div v_~a0~0_836 5))) (and (<= ~a0~0 (+ (div (+ .cse24 (- 278887)) 5) 1)) (< .cse24 278887) (not (= (mod (+ .cse24 4) 5) 0)) (<= 0 v_~a0~0_836) (not (= (mod (+ .cse24 3) 5) 0)) (< .cse24 278886) (<= v_~a0~0_836 599999)))) (or .cse16 .cse18) .cse7) (and .cse21 .cse25 .cse8 .cse3 .cse4) (and .cse0 .cse10 .cse9 .cse7 (<= ~a0~0 599920)) (and .cse21 .cse17 .cse25 .cse8 .cse3) (and .cse21 .cse25 .cse4 .cse15)))) [2019-12-07 19:03:58,924 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,925 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,926 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 19:03:58,927 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 19:03:58,928 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 19:03:58,929 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 19:03:58,930 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 19:03:58,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:58,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:58,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:03:58 BoogieIcfgContainer [2019-12-07 19:03:58,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:03:58,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:03:58,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:03:58,976 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:03:58,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:58:39" (3/4) ... [2019-12-07 19:03:58,980 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:03:59,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 19:03:59,013 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:03:59,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2) && 4453 <= a29) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((((2 <= a2 && a4 + 86 <= 0) && !(6 == input)) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && 5 == a2) && !(3 == a2)) && 4453 <= a29) && 3 <= a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 144 <= 0) && a2 <= 3) && !(3 == a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((0 < a29 + 16 && a0 + 147 <= 0) && 4 == a2) && !(3 == a2)) && 3 <= a2)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a0 + 242851 <= 0 || a29 + 144 <= 0)) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) [2019-12-07 19:03:59,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2) && 4453 <= a29) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((((2 <= a2 && a4 + 86 <= 0) && !(6 == input)) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 144 <= 0) && a2 <= 3) && !(3 == a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && 5 == a2) && !(3 == a2)) && 4453 <= a29) && 3 <= a2)) || ((((0 < a29 + 16 && a0 + 147 <= 0) && 4 == a2) && !(3 == a2)) && 3 <= a2)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a0 + 242851 <= 0 || a29 + 144 <= 0)) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) [2019-12-07 19:03:59,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((a4 + 86 <= 0 && !(6 == input)) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || ((a0 + 242851 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144))) && 4 == a2)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((((a4 + 86 <= 0 && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || ((((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && 2 == a2)) && a0 <= 599976)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 5 == a2) && 4453 <= a29) && 3 <= a2)) || (((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2) && 3 <= a2)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((((a4 + 86 <= 0 && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 0 < a29 + 144) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) [2019-12-07 19:03:59,135 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a278f87f-096e-49bd-9443-236653260019/bin/uautomizer/witness.graphml [2019-12-07 19:03:59,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:03:59,137 INFO L168 Benchmark]: Toolchain (without parser) took 322590.99 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 930.6 MB in the beginning and 1.8 GB in the end (delta: -830.5 MB). Peak memory consumption was 717.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,137 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:03:59,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 930.6 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,137 INFO L168 Benchmark]: Boogie Preprocessor took 128.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,137 INFO L168 Benchmark]: RCFGBuilder took 2121.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 938.3 MB in the end (delta: 66.2 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,138 INFO L168 Benchmark]: TraceAbstraction took 319395.31 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 938.3 MB in the beginning and 1.8 GB in the end (delta: -900.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,138 INFO L168 Benchmark]: Witness Printer took 159.60 ms. Allocated memory is still 2.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 77.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:03:59,139 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 930.6 MB in the beginning and 1.1 GB in the end (delta: -133.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2121.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 938.3 MB in the end (delta: 66.2 MB). Peak memory consumption was 160.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 319395.31 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 938.3 MB in the beginning and 1.8 GB in the end (delta: -900.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 159.60 ms. Allocated memory is still 2.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 77.9 MB). Peak memory consumption was 77.9 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_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 169]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2) && 4453 <= a29) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((((2 <= a2 && a4 + 86 <= 0) && !(6 == input)) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && 5 == a2) && !(3 == a2)) && 4453 <= a29) && 3 <= a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 144 <= 0) && a2 <= 3) && !(3 == a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((0 < a29 + 16 && a0 + 147 <= 0) && 4 == a2) && !(3 == a2)) && 3 <= a2)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a0 + 242851 <= 0 || a29 + 144 <= 0)) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a4 + 86 <= 0 && !(6 == input)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2) && 4453 <= a29) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || ((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((((2 <= a2 && a4 + 86 <= 0) && !(6 == input)) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 144 <= 0) && a2 <= 3) && !(3 == a2)) || ((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a0 + 147 <= 0 && 5 == a2) && !(3 == a2)) && 4453 <= a29) && 3 <= a2)) || ((((0 < a29 + 16 && a0 + 147 <= 0) && 4 == a2) && !(3 == a2)) && 3 <= a2)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((((((a4 + 86 <= 0 && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a0 + 242851 <= 0 || a29 + 144 <= 0)) && 4 == a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_836,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-12-07 19:03:59,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0) && a2 <= 3) && 3 <= a2) || (((a4 + 86 <= 0 && !(6 == input)) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976) || (a0 <= 599976 && (((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 42) && 0 < a29 + 144) && 4 == a2) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 25 * a29 + a0 <= 596270) && 4 == a2)))) || (((\exists v_~a0~0_836 : int :: (((((a0 <= (v_~a0~0_836 / 5 + -278887) / 5 + 1 && v_~a0~0_836 / 5 < 278887) && !((v_~a0~0_836 / 5 + 4) % 5 == 0)) && 0 <= v_~a0~0_836) && !((v_~a0~0_836 / 5 + 3) % 5 == 0)) && v_~a0~0_836 / 5 < 278886) && v_~a0~0_836 <= 599999) && (a29 + 144 <= 0 || ((a0 + 242851 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144))) && 4 == a2)) || ((a0 + 242851 <= 0 && 1 == a2) && 0 <= a29 + 127)) || ((((((a4 + 86 <= 0 && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 0 < a29 + 16) && (a29 <= 43 || 25 * a29 + a0 <= 596270)) && a0 <= 599976) && 0 < a29 + 144) && 5 == a2)) || ((((((((2 <= a2 && a4 + 86 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && a2 <= 3) && !(3 == a2)) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && 2 == a2)) && a0 <= 599976)) || (a4 + 86 <= 0 && a0 + 61 <= 0)) || ((0 < a29 + 16 && 1 == a2) && a0 + 147 <= 0)) || ((2 <= a2 && a2 <= 2) && a0 + 147 <= 0)) || ((a0 + 98 <= 0 && a2 <= 3) && 3 <= a2)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((((a4 + 89 <= 0 && 1 == a2) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a0 + 147 <= 0 && 5 == a2) && 4453 <= a29) && 3 <= a2)) || (((((0 < a4 + 42 || !(1 == input)) && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2) && 3 <= a2)) || ((a0 + 242851 <= 0 && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a0 <= 599976) && a2 <= 3) && 3 <= a2)) || ((((a0 + 98 <= 0 && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144) && 5 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 1 == a2) && 0 <= a0 + 146) && a29 + 16 <= 0) && 0 < a29 + 144)) || (((((a4 + 86 <= 0 && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 0 < a29 + 144) && a0 <= 599976) && 5 == a2) && 4453 <= a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 146) && 5 == a2) && 0 <= a29 + 127) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 225.7s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 92.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 93.5s, HoareTripleCheckerStatistics: 4520 SDtfs, 31347 SDslu, 2090 SDs, 0 SdLazy, 79294 SolverSat, 6013 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 72.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11437 GetRequests, 11163 SyntacticMatches, 45 SemanticMatches, 229 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 93.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22827occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 55926 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 231 NumberOfFragments, 1752 HoareAnnotationTreeSize, 4 FomulaSimplifications, 5087405 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4661273 FormulaSimplificationTreeSizeReductionInter, 89.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 111.6s InterpolantComputationTime, 26968 NumberOfCodeBlocks, 26968 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 26931 ConstructedInterpolants, 1186 QuantifiedInterpolants, 151633322 SizeOfPredicates, 30 NumberOfNonLiveVariables, 12841 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 37 InterpolantComputations, 20 PerfectInterpolantSequences, 37467/40395 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...