./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label22.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_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 201bb8edf1558ee8c2befb91c86634486acb774b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 10:07:28,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:28,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:28,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:28,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:28,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:28,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:28,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:28,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:28,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:28,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:28,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:28,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:28,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:28,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:28,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:28,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:28,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:28,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:28,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:28,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:28,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:28,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:28,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:28,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:28,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:28,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:28,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:28,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:28,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:28,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:28,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:28,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:28,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:28,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:28,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:28,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:28,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:28,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:28,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:28,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:28,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:28,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:28,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:28,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:28,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:28,838 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:28,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:28,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:28,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:28,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:28,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:28,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:28,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:28,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:28,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:28,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:28,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:28,841 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_398614a1-c92f-46b9-9919-4de558d7eea6/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 -> 201bb8edf1558ee8c2befb91c86634486acb774b [2019-12-07 10:07:28,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:28,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:28,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:28,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:28,952 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:28,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2019-12-07 10:07:28,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/data/4e413b3a9/ed6fdd7573ab4a4a8baf1715bb567dcc/FLAG3bc2b737f [2019-12-07 10:07:29,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:29,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2019-12-07 10:07:29,491 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/data/4e413b3a9/ed6fdd7573ab4a4a8baf1715bb567dcc/FLAG3bc2b737f [2019-12-07 10:07:29,987 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/data/4e413b3a9/ed6fdd7573ab4a4a8baf1715bb567dcc [2019-12-07 10:07:29,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:29,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:29,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:30,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:30,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:30,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d2d37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:30,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:30,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:30,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:30,393 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:30,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:30,522 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:30,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30 WrapperNode [2019-12-07 10:07:30,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:30,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:30,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:30,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:30,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:30,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:30,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:30,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:30,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... [2019-12-07 10:07:30,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:30,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:30,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:30,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:30,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:07:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:31,744 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:31,744 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:07:31,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31 BoogieIcfgContainer [2019-12-07 10:07:31,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:31,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:31,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:31,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:31,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:29" (1/3) ... [2019-12-07 10:07:31,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18255ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:31, skipping insertion in model container [2019-12-07 10:07:31,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:30" (2/3) ... [2019-12-07 10:07:31,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18255ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:31, skipping insertion in model container [2019-12-07 10:07:31,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31" (3/3) ... [2019-12-07 10:07:31,751 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2019-12-07 10:07:31,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:31,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:31,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:31,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:31,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:31,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:31,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:31,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:31,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:31,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:31,792 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 10:07:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:07:31,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,815 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-12-07 10:07:31,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692343609] [2019-12-07 10:07:31,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,029 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 10:07:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692343609] [2019-12-07 10:07:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:32,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622086367] [2019-12-07 10:07:32,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:32,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:32,046 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 10:07:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,162 INFO L93 Difference]: Finished difference Result 954 states and 1721 transitions. [2019-12-07 10:07:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 10:07:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,176 INFO L225 Difference]: With dead ends: 954 [2019-12-07 10:07:33,176 INFO L226 Difference]: Without dead ends: 603 [2019-12-07 10:07:33,191 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 10:07:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-12-07 10:07:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-12-07 10:07:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-07 10:07:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 837 transitions. [2019-12-07 10:07:33,251 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 837 transitions. Word has length 55 [2019-12-07 10:07:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,252 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 837 transitions. [2019-12-07 10:07:33,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 837 transitions. [2019-12-07 10:07:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 10:07:33,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,256 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:07:33,256 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1037527256, now seen corresponding path program 1 times [2019-12-07 10:07:33,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404056962] [2019-12-07 10:07:33,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:33,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404056962] [2019-12-07 10:07:33,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362679260] [2019-12-07 10:07:33,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,380 INFO L87 Difference]: Start difference. First operand 603 states and 837 transitions. Second operand 4 states. [2019-12-07 10:07:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,439 INFO L93 Difference]: Finished difference Result 2329 states and 3248 transitions. [2019-12-07 10:07:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:34,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 10:07:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,447 INFO L225 Difference]: With dead ends: 2329 [2019-12-07 10:07:34,447 INFO L226 Difference]: Without dead ends: 1728 [2019-12-07 10:07:34,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2019-12-07 10:07:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1342. [2019-12-07 10:07:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 10:07:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1792 transitions. [2019-12-07 10:07:34,477 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1792 transitions. Word has length 124 [2019-12-07 10:07:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,478 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1792 transitions. [2019-12-07 10:07:34,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1792 transitions. [2019-12-07 10:07:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 10:07:34,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,482 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:34,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1586005467, now seen corresponding path program 1 times [2019-12-07 10:07:34,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709222837] [2019-12-07 10:07:34,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709222837] [2019-12-07 10:07:34,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:34,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:34,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421394027] [2019-12-07 10:07:34,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:34,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:34,596 INFO L87 Difference]: Start difference. First operand 1342 states and 1792 transitions. Second operand 4 states. [2019-12-07 10:07:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,864 INFO L93 Difference]: Finished difference Result 5087 states and 6835 transitions. [2019-12-07 10:07:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:35,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 10:07:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,878 INFO L225 Difference]: With dead ends: 5087 [2019-12-07 10:07:35,878 INFO L226 Difference]: Without dead ends: 3747 [2019-12-07 10:07:35,880 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 10:07:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-12-07 10:07:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3741. [2019-12-07 10:07:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2019-12-07 10:07:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4663 transitions. [2019-12-07 10:07:35,930 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4663 transitions. Word has length 137 [2019-12-07 10:07:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,931 INFO L462 AbstractCegarLoop]: Abstraction has 3741 states and 4663 transitions. [2019-12-07 10:07:35,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4663 transitions. [2019-12-07 10:07:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 10:07:35,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,934 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:35,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 693126941, now seen corresponding path program 1 times [2019-12-07 10:07:35,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086854202] [2019-12-07 10:07:35,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:36,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086854202] [2019-12-07 10:07:36,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:36,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093539921] [2019-12-07 10:07:36,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:36,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:36,084 INFO L87 Difference]: Start difference. First operand 3741 states and 4663 transitions. Second operand 5 states. [2019-12-07 10:07:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,675 INFO L93 Difference]: Finished difference Result 13396 states and 17132 transitions. [2019-12-07 10:07:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:37,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-12-07 10:07:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,710 INFO L225 Difference]: With dead ends: 13396 [2019-12-07 10:07:37,710 INFO L226 Difference]: Without dead ends: 9657 [2019-12-07 10:07:37,714 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 10:07:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9657 states. [2019-12-07 10:07:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9657 to 8171. [2019-12-07 10:07:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2019-12-07 10:07:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 10119 transitions. [2019-12-07 10:07:37,834 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 10119 transitions. Word has length 182 [2019-12-07 10:07:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,834 INFO L462 AbstractCegarLoop]: Abstraction has 8171 states and 10119 transitions. [2019-12-07 10:07:37,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 10119 transitions. [2019-12-07 10:07:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-12-07 10:07:37,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,842 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 10:07:37,842 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 803669015, now seen corresponding path program 1 times [2019-12-07 10:07:37,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389505902] [2019-12-07 10:07:37,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 10:07:38,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389505902] [2019-12-07 10:07:38,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:38,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:38,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110400561] [2019-12-07 10:07:38,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:38,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:38,017 INFO L87 Difference]: Start difference. First operand 8171 states and 10119 transitions. Second operand 5 states. [2019-12-07 10:07:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:39,289 INFO L93 Difference]: Finished difference Result 19111 states and 23595 transitions. [2019-12-07 10:07:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:39,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-12-07 10:07:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:39,322 INFO L225 Difference]: With dead ends: 19111 [2019-12-07 10:07:39,323 INFO L226 Difference]: Without dead ends: 10758 [2019-12-07 10:07:39,328 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 10:07:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2019-12-07 10:07:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 9275. [2019-12-07 10:07:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-12-07 10:07:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 11284 transitions. [2019-12-07 10:07:39,445 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 11284 transitions. Word has length 244 [2019-12-07 10:07:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:39,445 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 11284 transitions. [2019-12-07 10:07:39,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 11284 transitions. [2019-12-07 10:07:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-07 10:07:39,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:39,452 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 10:07:39,453 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:39,453 INFO L82 PathProgramCache]: Analyzing trace with hash -757813282, now seen corresponding path program 1 times [2019-12-07 10:07:39,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:39,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262123769] [2019-12-07 10:07:39,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 10:07:39,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262123769] [2019-12-07 10:07:39,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:39,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:39,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917429501] [2019-12-07 10:07:39,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:39,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:39,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:39,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:39,547 INFO L87 Difference]: Start difference. First operand 9275 states and 11284 transitions. Second operand 4 states. [2019-12-07 10:07:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:40,599 INFO L93 Difference]: Finished difference Result 24461 states and 29940 transitions. [2019-12-07 10:07:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:40,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2019-12-07 10:07:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:40,627 INFO L225 Difference]: With dead ends: 24461 [2019-12-07 10:07:40,627 INFO L226 Difference]: Without dead ends: 15372 [2019-12-07 10:07:40,635 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 10:07:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2019-12-07 10:07:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 14243. [2019-12-07 10:07:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14243 states. [2019-12-07 10:07:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 16964 transitions. [2019-12-07 10:07:40,772 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 16964 transitions. Word has length 295 [2019-12-07 10:07:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 14243 states and 16964 transitions. [2019-12-07 10:07:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 16964 transitions. [2019-12-07 10:07:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-12-07 10:07:40,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:40,781 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 10:07:40,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530039, now seen corresponding path program 1 times [2019-12-07 10:07:40,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:40,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893352857] [2019-12-07 10:07:40,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 10:07:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893352857] [2019-12-07 10:07:41,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681628163] [2019-12-07 10:07:41,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:07:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:41,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:41,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 10:07:41,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:07:41,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-12-07 10:07:41,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626721024] [2019-12-07 10:07:41,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:41,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:41,176 INFO L87 Difference]: Start difference. First operand 14243 states and 16964 transitions. Second operand 3 states. [2019-12-07 10:07:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:41,897 INFO L93 Difference]: Finished difference Result 29978 states and 35910 transitions. [2019-12-07 10:07:41,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:41,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-12-07 10:07:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:41,921 INFO L225 Difference]: With dead ends: 29978 [2019-12-07 10:07:41,921 INFO L226 Difference]: Without dead ends: 17767 [2019-12-07 10:07:41,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 302 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 10:07:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17767 states. [2019-12-07 10:07:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17767 to 17211. [2019-12-07 10:07:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17211 states. [2019-12-07 10:07:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17211 states to 17211 states and 20462 transitions. [2019-12-07 10:07:42,133 INFO L78 Accepts]: Start accepts. Automaton has 17211 states and 20462 transitions. Word has length 301 [2019-12-07 10:07:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:42,133 INFO L462 AbstractCegarLoop]: Abstraction has 17211 states and 20462 transitions. [2019-12-07 10:07:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17211 states and 20462 transitions. [2019-12-07 10:07:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-07 10:07:42,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:42,146 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 10:07:42,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:42,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash 413217873, now seen corresponding path program 1 times [2019-12-07 10:07:42,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:42,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905183988] [2019-12-07 10:07:42,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905183988] [2019-12-07 10:07:42,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:42,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:42,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644513719] [2019-12-07 10:07:42,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:42,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:42,516 INFO L87 Difference]: Start difference. First operand 17211 states and 20462 transitions. Second operand 4 states. [2019-12-07 10:07:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:43,484 INFO L93 Difference]: Finished difference Result 35895 states and 42811 transitions. [2019-12-07 10:07:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:43,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-12-07 10:07:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:43,517 INFO L225 Difference]: With dead ends: 35895 [2019-12-07 10:07:43,517 INFO L226 Difference]: Without dead ends: 20716 [2019-12-07 10:07:43,530 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 10:07:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20716 states. [2019-12-07 10:07:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20716 to 18131. [2019-12-07 10:07:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18131 states. [2019-12-07 10:07:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18131 states to 18131 states and 21571 transitions. [2019-12-07 10:07:43,689 INFO L78 Accepts]: Start accepts. Automaton has 18131 states and 21571 transitions. Word has length 357 [2019-12-07 10:07:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:43,690 INFO L462 AbstractCegarLoop]: Abstraction has 18131 states and 21571 transitions. [2019-12-07 10:07:43,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18131 states and 21571 transitions. [2019-12-07 10:07:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-12-07 10:07:43,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:43,701 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,701 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180965, now seen corresponding path program 1 times [2019-12-07 10:07:43,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:43,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614432235] [2019-12-07 10:07:43,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-12-07 10:07:43,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614432235] [2019-12-07 10:07:43,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:43,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:43,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084945056] [2019-12-07 10:07:43,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:43,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:43,933 INFO L87 Difference]: Start difference. First operand 18131 states and 21571 transitions. Second operand 3 states. [2019-12-07 10:07:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:44,521 INFO L93 Difference]: Finished difference Result 34758 states and 41170 transitions. [2019-12-07 10:07:44,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:44,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-12-07 10:07:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:44,536 INFO L225 Difference]: With dead ends: 34758 [2019-12-07 10:07:44,536 INFO L226 Difference]: Without dead ends: 16445 [2019-12-07 10:07:44,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16445 states. [2019-12-07 10:07:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16445 to 14603. [2019-12-07 10:07:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14603 states. [2019-12-07 10:07:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14603 states to 14603 states and 16685 transitions. [2019-12-07 10:07:44,670 INFO L78 Accepts]: Start accepts. Automaton has 14603 states and 16685 transitions. Word has length 366 [2019-12-07 10:07:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:44,670 INFO L462 AbstractCegarLoop]: Abstraction has 14603 states and 16685 transitions. [2019-12-07 10:07:44,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16685 transitions. [2019-12-07 10:07:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-12-07 10:07:44,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:44,687 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-12-07 10:07:44,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 405640561, now seen corresponding path program 1 times [2019-12-07 10:07:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:44,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253944745] [2019-12-07 10:07:44,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-12-07 10:07:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253944745] [2019-12-07 10:07:44,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:44,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:44,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810986774] [2019-12-07 10:07:45,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:45,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:45,000 INFO L87 Difference]: Start difference. First operand 14603 states and 16685 transitions. Second operand 4 states. [2019-12-07 10:07:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:45,852 INFO L93 Difference]: Finished difference Result 31058 states and 35482 transitions. [2019-12-07 10:07:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:45,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-12-07 10:07:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:45,863 INFO L225 Difference]: With dead ends: 31058 [2019-12-07 10:07:45,863 INFO L226 Difference]: Without dead ends: 16825 [2019-12-07 10:07:45,869 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 10:07:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16825 states. [2019-12-07 10:07:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16825 to 15155. [2019-12-07 10:07:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15155 states. [2019-12-07 10:07:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15155 states to 15155 states and 16939 transitions. [2019-12-07 10:07:45,993 INFO L78 Accepts]: Start accepts. Automaton has 15155 states and 16939 transitions. Word has length 605 [2019-12-07 10:07:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:45,994 INFO L462 AbstractCegarLoop]: Abstraction has 15155 states and 16939 transitions. [2019-12-07 10:07:45,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15155 states and 16939 transitions. [2019-12-07 10:07:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-12-07 10:07:46,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:46,012 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,012 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash -799752283, now seen corresponding path program 1 times [2019-12-07 10:07:46,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028847874] [2019-12-07 10:07:46,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 1053 proven. 437 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-12-07 10:07:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028847874] [2019-12-07 10:07:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513466871] [2019-12-07 10:07:46,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:07:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:46,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 1258 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-12-07 10:07:47,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:07:47,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 10:07:47,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469735047] [2019-12-07 10:07:47,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:47,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:07:47,603 INFO L87 Difference]: Start difference. First operand 15155 states and 16939 transitions. Second operand 3 states. [2019-12-07 10:07:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,508 INFO L93 Difference]: Finished difference Result 34176 states and 38217 transitions. [2019-12-07 10:07:48,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:48,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 747 [2019-12-07 10:07:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:48,520 INFO L225 Difference]: With dead ends: 34176 [2019-12-07 10:07:48,520 INFO L226 Difference]: Without dead ends: 19391 [2019-12-07 10:07:48,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 746 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:07:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19391 states. [2019-12-07 10:07:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19391 to 18654. [2019-12-07 10:07:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18654 states. [2019-12-07 10:07:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18654 states to 18654 states and 20520 transitions. [2019-12-07 10:07:48,694 INFO L78 Accepts]: Start accepts. Automaton has 18654 states and 20520 transitions. Word has length 747 [2019-12-07 10:07:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:48,695 INFO L462 AbstractCegarLoop]: Abstraction has 18654 states and 20520 transitions. [2019-12-07 10:07:48,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18654 states and 20520 transitions. [2019-12-07 10:07:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-12-07 10:07:48,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:48,712 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:48,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:48,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash 216433610, now seen corresponding path program 1 times [2019-12-07 10:07:48,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198377728] [2019-12-07 10:07:48,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 1217 proven. 100 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-12-07 10:07:49,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198377728] [2019-12-07 10:07:49,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690965199] [2019-12-07 10:07:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:07:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:07:49,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:49,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:49,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:07:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-12-07 10:07:50,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:07:50,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 10:07:50,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777512862] [2019-12-07 10:07:50,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:50,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:50,216 INFO L87 Difference]: Start difference. First operand 18654 states and 20520 transitions. Second operand 3 states. [2019-12-07 10:07:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:50,885 INFO L93 Difference]: Finished difference Result 39514 states and 43439 transitions. [2019-12-07 10:07:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:50,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 774 [2019-12-07 10:07:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:50,899 INFO L225 Difference]: With dead ends: 39514 [2019-12-07 10:07:50,899 INFO L226 Difference]: Without dead ends: 21230 [2019-12-07 10:07:50,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21230 states. [2019-12-07 10:07:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21230 to 19574. [2019-12-07 10:07:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19574 states. [2019-12-07 10:07:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19574 states to 19574 states and 21487 transitions. [2019-12-07 10:07:51,065 INFO L78 Accepts]: Start accepts. Automaton has 19574 states and 21487 transitions. Word has length 774 [2019-12-07 10:07:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:51,066 INFO L462 AbstractCegarLoop]: Abstraction has 19574 states and 21487 transitions. [2019-12-07 10:07:51,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 19574 states and 21487 transitions. [2019-12-07 10:07:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-12-07 10:07:51,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:51,080 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:51,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:51,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -755017445, now seen corresponding path program 1 times [2019-12-07 10:07:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:51,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781377626] [2019-12-07 10:07:51,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 1327 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-12-07 10:07:51,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781377626] [2019-12-07 10:07:51,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:51,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882728561] [2019-12-07 10:07:51,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:51,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:51,847 INFO L87 Difference]: Start difference. First operand 19574 states and 21487 transitions. Second operand 4 states. [2019-12-07 10:07:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:52,854 INFO L93 Difference]: Finished difference Result 39899 states and 43767 transitions. [2019-12-07 10:07:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:52,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 803 [2019-12-07 10:07:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:52,867 INFO L225 Difference]: With dead ends: 39899 [2019-12-07 10:07:52,868 INFO L226 Difference]: Without dead ends: 20511 [2019-12-07 10:07:52,876 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 10:07:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20511 states. [2019-12-07 10:07:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20511 to 19389. [2019-12-07 10:07:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19389 states. [2019-12-07 10:07:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19389 states to 19389 states and 20978 transitions. [2019-12-07 10:07:53,033 INFO L78 Accepts]: Start accepts. Automaton has 19389 states and 20978 transitions. Word has length 803 [2019-12-07 10:07:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:53,033 INFO L462 AbstractCegarLoop]: Abstraction has 19389 states and 20978 transitions. [2019-12-07 10:07:53,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19389 states and 20978 transitions. [2019-12-07 10:07:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2019-12-07 10:07:53,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:53,054 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2019-12-07 10:07:53,054 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1081799803, now seen corresponding path program 1 times [2019-12-07 10:07:53,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:53,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108015897] [2019-12-07 10:07:53,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 1358 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2019-12-07 10:07:53,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108015897] [2019-12-07 10:07:53,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:53,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:53,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372728169] [2019-12-07 10:07:53,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:07:53,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:53,638 INFO L87 Difference]: Start difference. First operand 19389 states and 20978 transitions. Second operand 6 states. [2019-12-07 10:07:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:55,227 INFO L93 Difference]: Finished difference Result 42644 states and 46063 transitions. [2019-12-07 10:07:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:55,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 827 [2019-12-07 10:07:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:55,241 INFO L225 Difference]: With dead ends: 42644 [2019-12-07 10:07:55,242 INFO L226 Difference]: Without dead ends: 23625 [2019-12-07 10:07:55,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23625 states. [2019-12-07 10:07:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23625 to 14787. [2019-12-07 10:07:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14787 states. [2019-12-07 10:07:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14787 states to 14787 states and 15938 transitions. [2019-12-07 10:07:55,394 INFO L78 Accepts]: Start accepts. Automaton has 14787 states and 15938 transitions. Word has length 827 [2019-12-07 10:07:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:55,394 INFO L462 AbstractCegarLoop]: Abstraction has 14787 states and 15938 transitions. [2019-12-07 10:07:55,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:07:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14787 states and 15938 transitions. [2019-12-07 10:07:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2019-12-07 10:07:55,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:55,407 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:55,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -366298296, now seen corresponding path program 1 times [2019-12-07 10:07:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5722440] [2019-12-07 10:07:55,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:07:56,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5722440] [2019-12-07 10:07:56,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:56,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:07:56,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199172941] [2019-12-07 10:07:56,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:56,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:56,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:56,026 INFO L87 Difference]: Start difference. First operand 14787 states and 15938 transitions. Second operand 5 states. [2019-12-07 10:07:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:57,310 INFO L93 Difference]: Finished difference Result 30151 states and 32515 transitions. [2019-12-07 10:07:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:57,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 831 [2019-12-07 10:07:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:57,324 INFO L225 Difference]: With dead ends: 30151 [2019-12-07 10:07:57,324 INFO L226 Difference]: Without dead ends: 15920 [2019-12-07 10:07:57,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15920 states. [2019-12-07 10:07:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15920 to 14417. [2019-12-07 10:07:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14417 states. [2019-12-07 10:07:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 15461 transitions. [2019-12-07 10:07:57,437 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 15461 transitions. Word has length 831 [2019-12-07 10:07:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:57,437 INFO L462 AbstractCegarLoop]: Abstraction has 14417 states and 15461 transitions. [2019-12-07 10:07:57,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 15461 transitions. [2019-12-07 10:07:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-12-07 10:07:57,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:57,447 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:57,447 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -102372182, now seen corresponding path program 1 times [2019-12-07 10:07:57,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:57,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803237504] [2019-12-07 10:07:57,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1023 proven. 142 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:07:58,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803237504] [2019-12-07 10:07:58,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21594451] [2019-12-07 10:07:58,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:07:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:58,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1165 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:07:59,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:07:59,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 10:07:59,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842569666] [2019-12-07 10:07:59,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:59,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:07:59,187 INFO L87 Difference]: Start difference. First operand 14417 states and 15461 transitions. Second operand 4 states. [2019-12-07 10:07:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,919 INFO L93 Difference]: Finished difference Result 29570 states and 31705 transitions. [2019-12-07 10:07:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:59,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-12-07 10:07:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,929 INFO L225 Difference]: With dead ends: 29570 [2019-12-07 10:07:59,930 INFO L226 Difference]: Without dead ends: 15525 [2019-12-07 10:07:59,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:07:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-12-07 10:08:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13681. [2019-12-07 10:08:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13681 states. [2019-12-07 10:08:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 14649 transitions. [2019-12-07 10:08:00,044 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 14649 transitions. Word has length 847 [2019-12-07 10:08:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,044 INFO L462 AbstractCegarLoop]: Abstraction has 13681 states and 14649 transitions. [2019-12-07 10:08:00,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 14649 transitions. [2019-12-07 10:08:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-12-07 10:08:00,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,054 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:00,255 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1121909716, now seen corresponding path program 1 times [2019-12-07 10:08:00,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013566535] [2019-12-07 10:08:00,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2397 backedges. 1537 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-12-07 10:08:01,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013566535] [2019-12-07 10:08:01,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:01,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669425822] [2019-12-07 10:08:01,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:01,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,061 INFO L87 Difference]: Start difference. First operand 13681 states and 14649 transitions. Second operand 5 states. [2019-12-07 10:08:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,040 INFO L93 Difference]: Finished difference Result 28280 states and 30246 transitions. [2019-12-07 10:08:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:02,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 896 [2019-12-07 10:08:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,050 INFO L225 Difference]: With dead ends: 28280 [2019-12-07 10:08:02,050 INFO L226 Difference]: Without dead ends: 14970 [2019-12-07 10:08:02,056 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 10:08:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14970 states. [2019-12-07 10:08:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14970 to 12760. [2019-12-07 10:08:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12760 states. [2019-12-07 10:08:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12760 states to 12760 states and 13648 transitions. [2019-12-07 10:08:02,161 INFO L78 Accepts]: Start accepts. Automaton has 12760 states and 13648 transitions. Word has length 896 [2019-12-07 10:08:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,162 INFO L462 AbstractCegarLoop]: Abstraction has 12760 states and 13648 transitions. [2019-12-07 10:08:02,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12760 states and 13648 transitions. [2019-12-07 10:08:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2019-12-07 10:08:02,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,172 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,172 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1056427581, now seen corresponding path program 1 times [2019-12-07 10:08:02,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821033318] [2019-12-07 10:08:02,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 1636 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2019-12-07 10:08:03,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821033318] [2019-12-07 10:08:03,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:03,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:03,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008099376] [2019-12-07 10:08:03,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:03,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:03,083 INFO L87 Difference]: Start difference. First operand 12760 states and 13648 transitions. Second operand 6 states. [2019-12-07 10:08:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:05,125 INFO L93 Difference]: Finished difference Result 26620 states and 28458 transitions. [2019-12-07 10:08:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:05,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 923 [2019-12-07 10:08:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:05,132 INFO L225 Difference]: With dead ends: 26620 [2019-12-07 10:08:05,132 INFO L226 Difference]: Without dead ends: 11836 [2019-12-07 10:08:05,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2019-12-07 10:08:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 11100. [2019-12-07 10:08:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11100 states. [2019-12-07 10:08:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 11624 transitions. [2019-12-07 10:08:05,212 INFO L78 Accepts]: Start accepts. Automaton has 11100 states and 11624 transitions. Word has length 923 [2019-12-07 10:08:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:05,213 INFO L462 AbstractCegarLoop]: Abstraction has 11100 states and 11624 transitions. [2019-12-07 10:08:05,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11100 states and 11624 transitions. [2019-12-07 10:08:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2019-12-07 10:08:05,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:05,223 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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 10:08:05,223 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1498076430, now seen corresponding path program 1 times [2019-12-07 10:08:05,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:05,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327238639] [2019-12-07 10:08:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1628 proven. 249 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:08:06,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327238639] [2019-12-07 10:08:06,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581558559] [2019-12-07 10:08:06,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/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 10:08:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:06,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 10:08:07,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:07,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:07,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1628 proven. 249 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:08:08,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:08:08,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 10:08:08,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256838061] [2019-12-07 10:08:08,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:08:08,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:08,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:08:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:08:08,609 INFO L87 Difference]: Start difference. First operand 11100 states and 11624 transitions. Second operand 13 states. [2019-12-07 10:08:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:12,069 INFO L93 Difference]: Finished difference Result 22879 states and 23962 transitions. [2019-12-07 10:08:12,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 10:08:12,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 965 [2019-12-07 10:08:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:12,075 INFO L225 Difference]: With dead ends: 22879 [2019-12-07 10:08:12,076 INFO L226 Difference]: Without dead ends: 11191 [2019-12-07 10:08:12,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 962 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:08:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2019-12-07 10:08:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 8679. [2019-12-07 10:08:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-12-07 10:08:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 9012 transitions. [2019-12-07 10:08:12,155 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 9012 transitions. Word has length 965 [2019-12-07 10:08:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:12,155 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 9012 transitions. [2019-12-07 10:08:12,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:08:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 9012 transitions. [2019-12-07 10:08:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2019-12-07 10:08:12,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:12,169 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:12,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:08:12,370 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -770256063, now seen corresponding path program 1 times [2019-12-07 10:08:12,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:12,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765499463] [2019-12-07 10:08:12,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3221 backedges. 2118 proven. 0 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-12-07 10:08:12,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765499463] [2019-12-07 10:08:12,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:12,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:12,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964203613] [2019-12-07 10:08:12,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:12,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:12,991 INFO L87 Difference]: Start difference. First operand 8679 states and 9012 transitions. Second operand 3 states. [2019-12-07 10:08:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:13,411 INFO L93 Difference]: Finished difference Result 16802 states and 17456 transitions. [2019-12-07 10:08:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:13,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 994 [2019-12-07 10:08:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:13,417 INFO L225 Difference]: With dead ends: 16802 [2019-12-07 10:08:13,417 INFO L226 Difference]: Without dead ends: 8863 [2019-12-07 10:08:13,420 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 10:08:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8863 states. [2019-12-07 10:08:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8863 to 7943. [2019-12-07 10:08:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2019-12-07 10:08:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 8244 transitions. [2019-12-07 10:08:13,477 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 8244 transitions. Word has length 994 [2019-12-07 10:08:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:13,478 INFO L462 AbstractCegarLoop]: Abstraction has 7943 states and 8244 transitions. [2019-12-07 10:08:13,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 8244 transitions. [2019-12-07 10:08:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-12-07 10:08:13,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:13,487 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 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 10:08:13,487 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash -170186788, now seen corresponding path program 1 times [2019-12-07 10:08:13,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:13,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44746375] [2019-12-07 10:08:13,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 1992 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-12-07 10:08:14,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44746375] [2019-12-07 10:08:14,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:14,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:14,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669015905] [2019-12-07 10:08:14,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:08:14,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:08:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:14,840 INFO L87 Difference]: Start difference. First operand 7943 states and 8244 transitions. Second operand 7 states. [2019-12-07 10:08:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:16,239 INFO L93 Difference]: Finished difference Result 17171 states and 17832 transitions. [2019-12-07 10:08:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:16,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1009 [2019-12-07 10:08:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:16,246 INFO L225 Difference]: With dead ends: 17171 [2019-12-07 10:08:16,246 INFO L226 Difference]: Without dead ends: 9784 [2019-12-07 10:08:16,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2019-12-07 10:08:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 8311. [2019-12-07 10:08:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8311 states. [2019-12-07 10:08:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8311 states to 8311 states and 8617 transitions. [2019-12-07 10:08:16,313 INFO L78 Accepts]: Start accepts. Automaton has 8311 states and 8617 transitions. Word has length 1009 [2019-12-07 10:08:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:16,314 INFO L462 AbstractCegarLoop]: Abstraction has 8311 states and 8617 transitions. [2019-12-07 10:08:16,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:08:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 8617 transitions. [2019-12-07 10:08:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2019-12-07 10:08:16,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:16,323 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:16,324 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1902220041, now seen corresponding path program 1 times [2019-12-07 10:08:16,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:16,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504398032] [2019-12-07 10:08:16,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 2445 proven. 0 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2019-12-07 10:08:17,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504398032] [2019-12-07 10:08:17,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:17,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:17,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91361883] [2019-12-07 10:08:17,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:17,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:17,144 INFO L87 Difference]: Start difference. First operand 8311 states and 8617 transitions. Second operand 5 states. [2019-12-07 10:08:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:18,037 INFO L93 Difference]: Finished difference Result 17175 states and 17818 transitions. [2019-12-07 10:08:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:18,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1019 [2019-12-07 10:08:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:18,044 INFO L225 Difference]: With dead ends: 17175 [2019-12-07 10:08:18,044 INFO L226 Difference]: Without dead ends: 9604 [2019-12-07 10:08:18,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2019-12-07 10:08:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 8867. [2019-12-07 10:08:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8867 states. [2019-12-07 10:08:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 9188 transitions. [2019-12-07 10:08:18,112 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 9188 transitions. Word has length 1019 [2019-12-07 10:08:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:18,112 INFO L462 AbstractCegarLoop]: Abstraction has 8867 states and 9188 transitions. [2019-12-07 10:08:18,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 9188 transitions. [2019-12-07 10:08:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2019-12-07 10:08:18,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:18,122 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:18,122 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash -38082471, now seen corresponding path program 1 times [2019-12-07 10:08:18,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:18,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909057873] [2019-12-07 10:08:18,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 2143 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2019-12-07 10:08:18,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909057873] [2019-12-07 10:08:18,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:18,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:18,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188439130] [2019-12-07 10:08:18,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:18,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:18,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:18,951 INFO L87 Difference]: Start difference. First operand 8867 states and 9188 transitions. Second operand 5 states. [2019-12-07 10:08:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:19,438 INFO L93 Difference]: Finished difference Result 14025 states and 14530 transitions. [2019-12-07 10:08:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:19,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1026 [2019-12-07 10:08:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:19,439 INFO L225 Difference]: With dead ends: 14025 [2019-12-07 10:08:19,439 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:08:19,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 10:08:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:08:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:08:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:08:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:08:19,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1026 [2019-12-07 10:08:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:19,443 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:08:19,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:08:19,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:08:19,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:08:20,107 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 691 DAG size of output: 539 [2019-12-07 10:08:20,725 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 688 DAG size of output: 538 [2019-12-07 10:08:24,926 WARN L192 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 484 DAG size of output: 183 [2019-12-07 10:08:30,925 WARN L192 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 484 DAG size of output: 183 [2019-12-07 10:08:30,927 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 10:08:30,927 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 10:08:30,927 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,928 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse15 (= ~a25~0 13)) (.cse14 (= ~a25~0 12)) (.cse34 (+ ~a23~0 43))) (let ((.cse12 (<= ~a29~0 130)) (.cse4 (= 1 ~a4~0)) (.cse30 (<= .cse34 0)) (.cse32 (<= ~a29~0 274)) (.cse28 (= ~a25~0 10)) (.cse29 (not .cse14)) (.cse11 (<= ~a23~0 312)) (.cse23 (not .cse15)) (.cse13 (<= ~a29~0 277)) (.cse8 (< 138 ~a23~0)) (.cse10 (= ~a25~0 9))) (let ((.cse6 (<= ~a25~0 9)) (.cse2 (= ~a25~0 11)) (.cse26 (<= ~a29~0 245)) (.cse19 (not .cse10)) (.cse20 (or (and .cse11 (< 0 .cse34) .cse23 .cse29 .cse13) (and .cse11 .cse23 .cse13 .cse8))) (.cse24 (exists ((v_~a29~0_499 Int)) (let ((.cse33 (mod v_~a29~0_499 15))) (and (<= (+ .cse33 247) ~a29~0) (< 140 v_~a29~0_499) (= .cse33 0))))) (.cse21 (not .cse28)) (.cse3 (<= ~a23~0 600000)) (.cse25 (<= 261 ~a29~0)) (.cse16 (<= ~a23~0 262)) (.cse18 (<= (+ ~a23~0 55) 0)) (.cse27 (or (and .cse32 .cse28) (and .cse13 .cse28 .cse8))) (.cse22 (<= ~a4~0 0)) (.cse5 (= 1 ~a3~0)) (.cse7 (= 15 ~a8~0)) (.cse17 (<= ~a23~0 306)) (.cse0 (< 140 ~a29~0)) (.cse1 (or (and .cse10 .cse12 .cse30) (and .cse10 .cse4 .cse30) (and .cse32 .cse29 .cse4 .cse30) (and .cse23 .cse12 .cse4 .cse30)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (let ((.cse9 (< 277 ~a29~0))) (or (and .cse5 (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse6 .cse7 .cse8) (and .cse5 .cse7 .cse2 .cse9) (and .cse10 .cse5 .cse7 .cse9)))) (and .cse11 .cse10 .cse12 .cse8) (and .cse3 .cse0 .cse5 .cse7 .cse13 .cse4 .cse8) (and .cse14 .cse5 (<= (+ ~a29~0 22) 0) .cse7 .cse1) (and .cse14 .cse11 .cse5 .cse7 .cse4 .cse8) (and .cse15 .cse12 .cse4 .cse8 .cse16) (and .cse17 .cse4 .cse2 .cse8) (and .cse0 .cse6 .cse1) (and .cse5 .cse18 .cse7 .cse1) (and .cse19 .cse0 .cse5 .cse20 .cse7 .cse4 .cse21) (and .cse14 .cse22 .cse5 .cse23 .cse24 .cse13 .cse7) (and .cse10 .cse17 .cse4) (and .cse25 .cse17 .cse2 .cse4) (and .cse15 .cse0 .cse5 .cse26 .cse7 .cse4) (and .cse14 .cse22 .cse0 .cse5 .cse23 .cse18 .cse7 .cse13) (and (or (and .cse15 .cse0 .cse26 .cse8) (and .cse24 .cse27) (and .cse10 .cse24 .cse13)) .cse4) (and .cse17 .cse28 .cse4 .cse8) (and .cse3 .cse5 .cse7 .cse28 .cse4) (and .cse29 .cse4 .cse28 .cse30) (and .cse19 .cse20 .cse17 .cse24 .cse29 .cse4 .cse21) (and .cse3 .cse15 .cse5 (<= ~a29~0 599998) .cse7 .cse4 .cse8) (and .cse15 .cse25 .cse4 .cse8 .cse16) (and .cse5 .cse23 (<= 0 (+ ~a29~0 28553)) .cse18 .cse12 .cse7 .cse30) (and .cse5 .cse7 .cse4 (or (and .cse0 .cse27) (and .cse11 .cse10) (and .cse10 .cse0 .cse13))) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse14 .cse22 .cse5 .cse23 .cse12 .cse7 .cse30) (and .cse10 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse31 (mod v_~a29~0_503 299861))) (and (<= (+ .cse31 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse31)))) .cse5 .cse7 .cse30) (and .cse32 .cse17 .cse28 .cse4) (and .cse15 .cse0 .cse1))))) [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,929 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,930 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,931 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,932 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 10:08:30,933 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-12-07 10:08:30,934 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 10:08:30,935 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 10:08:30,936 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,937 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,938 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,939 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,940 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,941 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse15 (= ~a25~0 13)) (.cse14 (= ~a25~0 12)) (.cse34 (+ ~a23~0 43))) (let ((.cse12 (<= ~a29~0 130)) (.cse4 (= 1 ~a4~0)) (.cse30 (<= .cse34 0)) (.cse32 (<= ~a29~0 274)) (.cse28 (= ~a25~0 10)) (.cse29 (not .cse14)) (.cse11 (<= ~a23~0 312)) (.cse23 (not .cse15)) (.cse13 (<= ~a29~0 277)) (.cse8 (< 138 ~a23~0)) (.cse10 (= ~a25~0 9))) (let ((.cse6 (<= ~a25~0 9)) (.cse2 (= ~a25~0 11)) (.cse26 (<= ~a29~0 245)) (.cse19 (not .cse10)) (.cse20 (or (and .cse11 (< 0 .cse34) .cse23 .cse29 .cse13) (and .cse11 .cse23 .cse13 .cse8))) (.cse24 (exists ((v_~a29~0_499 Int)) (let ((.cse33 (mod v_~a29~0_499 15))) (and (<= (+ .cse33 247) ~a29~0) (< 140 v_~a29~0_499) (= .cse33 0))))) (.cse21 (not .cse28)) (.cse3 (<= ~a23~0 600000)) (.cse25 (<= 261 ~a29~0)) (.cse16 (<= ~a23~0 262)) (.cse18 (<= (+ ~a23~0 55) 0)) (.cse27 (or (and .cse32 .cse28) (and .cse13 .cse28 .cse8))) (.cse22 (<= ~a4~0 0)) (.cse5 (= 1 ~a3~0)) (.cse7 (= 15 ~a8~0)) (.cse17 (<= ~a23~0 306)) (.cse0 (< 140 ~a29~0)) (.cse1 (or (and .cse10 .cse12 .cse30) (and .cse10 .cse4 .cse30) (and .cse32 .cse29 .cse4 .cse30) (and .cse23 .cse12 .cse4 .cse30)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (let ((.cse9 (< 277 ~a29~0))) (or (and .cse5 (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse6 .cse7 .cse8) (and .cse5 .cse7 .cse2 .cse9) (and .cse10 .cse5 .cse7 .cse9)))) (and .cse11 .cse10 .cse12 .cse8) (and .cse3 .cse0 .cse5 .cse7 .cse13 .cse4 .cse8) (and .cse14 .cse5 (<= (+ ~a29~0 22) 0) .cse7 .cse1) (and .cse14 .cse11 .cse5 .cse7 .cse4 .cse8) (and .cse15 .cse12 .cse4 .cse8 .cse16) (and .cse17 .cse4 .cse2 .cse8) (and .cse0 .cse6 .cse1) (and .cse5 .cse18 .cse7 .cse1) (and .cse19 .cse0 .cse5 .cse20 .cse7 .cse4 .cse21) (and .cse14 .cse22 .cse5 .cse23 .cse24 .cse13 .cse7) (and .cse10 .cse17 .cse4) (and .cse25 .cse17 .cse2 .cse4) (and .cse15 .cse0 .cse5 .cse26 .cse7 .cse4) (and .cse14 .cse22 .cse0 .cse5 .cse23 .cse18 .cse7 .cse13) (and (or (and .cse15 .cse0 .cse26 .cse8) (and .cse24 .cse27) (and .cse10 .cse24 .cse13)) .cse4) (and .cse17 .cse28 .cse4 .cse8) (and .cse3 .cse5 .cse7 .cse28 .cse4) (and .cse29 .cse4 .cse28 .cse30) (and .cse19 .cse20 .cse17 .cse24 .cse29 .cse4 .cse21) (and .cse3 .cse15 .cse5 (<= ~a29~0 599998) .cse7 .cse4 .cse8) (and .cse15 .cse25 .cse4 .cse8 .cse16) (and .cse5 .cse23 (<= 0 (+ ~a29~0 28553)) .cse18 .cse12 .cse7 .cse30) (and .cse5 .cse7 .cse4 (or (and .cse0 .cse27) (and .cse11 .cse10) (and .cse10 .cse0 .cse13))) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse14 .cse22 .cse5 .cse23 .cse12 .cse7 .cse30) (and .cse10 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse31 (mod v_~a29~0_503 299861))) (and (<= (+ .cse31 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse31)))) .cse5 .cse7 .cse30) (and .cse32 .cse17 .cse28 .cse4) (and .cse15 .cse0 .cse1))))) [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,942 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 10:08:30,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:30,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:30,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:30,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:30 BoogieIcfgContainer [2019-12-07 10:08:30,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:30,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:30,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:30,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:30,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:31" (3/4) ... [2019-12-07 10:08:30,997 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:08:31,015 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:08:31,016 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:08:31,036 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((140 < a29 && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) && a25 == 11) || ((a23 <= 600000 && 1 == a4) && ((((((1 == a3 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && a25 <= 9) && 15 == a8) && 138 < a23) || (((1 == a3 && 15 == a8) && a25 == 11) && 277 < a29)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 277 < a29)))) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || ((((((a23 <= 600000 && 140 < a29) && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 138 < a23)) || ((((a25 == 12 && 1 == a3) && a29 + 22 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((140 < a29 && a25 <= 9) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((1 == a3 && a23 + 55 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || ((((((!(a25 == 9) && 140 < a29) && 1 == a3) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && 15 == a8) && 1 == a4) && !(a25 == 10))) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277) && 15 == a8)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((261 <= a29 && a23 <= 306) && a25 == 11) && 1 == a4)) || (((((a25 == 13 && 140 < a29) && 1 == a3) && a29 <= 245) && 15 == a8) && 1 == a4)) || (((((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 15 == a8) && a29 <= 277)) || ((((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || ((\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0) && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23)))) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || (((a23 <= 306 && a25 == 10) && 1 == a4) && 138 < a23)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && a25 == 10) && 1 == a4)) || (((!(a25 == 12) && 1 == a4) && a25 == 10) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && a23 <= 306) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && !(a25 == 12)) && 1 == a4) && !(a25 == 10))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && 261 <= a29) && 1 == a4) && 138 < a23) && a23 <= 262)) || ((((((1 == a3 && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && (((140 < a29 && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23))) || (a23 <= 312 && a25 == 9)) || ((a25 == 9 && 140 < a29) && a29 <= 277)))) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((a29 <= 274 && a23 <= 306) && a25 == 10) && 1 == a4)) || ((a25 == 13 && 140 < a29) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) [2019-12-07 10:08:31,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((140 < a29 && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) && a25 == 11) || ((a23 <= 600000 && 1 == a4) && ((((((1 == a3 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && a25 <= 9) && 15 == a8) && 138 < a23) || (((1 == a3 && 15 == a8) && a25 == 11) && 277 < a29)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 277 < a29)))) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || ((((((a23 <= 600000 && 140 < a29) && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 138 < a23)) || ((((a25 == 12 && 1 == a3) && a29 + 22 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((140 < a29 && a25 <= 9) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((1 == a3 && a23 + 55 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || ((((((!(a25 == 9) && 140 < a29) && 1 == a3) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && 15 == a8) && 1 == a4) && !(a25 == 10))) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277) && 15 == a8)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((261 <= a29 && a23 <= 306) && a25 == 11) && 1 == a4)) || (((((a25 == 13 && 140 < a29) && 1 == a3) && a29 <= 245) && 15 == a8) && 1 == a4)) || (((((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 15 == a8) && a29 <= 277)) || ((((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || ((\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0) && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23)))) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || (((a23 <= 306 && a25 == 10) && 1 == a4) && 138 < a23)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && a25 == 10) && 1 == a4)) || (((!(a25 == 12) && 1 == a4) && a25 == 10) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && a23 <= 306) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && !(a25 == 12)) && 1 == a4) && !(a25 == 10))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && 261 <= a29) && 1 == a4) && 138 < a23) && a23 <= 262)) || ((((((1 == a3 && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && (((140 < a29 && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23))) || (a23 <= 312 && a25 == 9)) || ((a25 == 9 && 140 < a29) && a29 <= 277)))) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((a29 <= 274 && a23 <= 306) && a25 == 10) && 1 == a4)) || ((a25 == 13 && 140 < a29) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) [2019-12-07 10:08:31,111 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_398614a1-c92f-46b9-9919-4de558d7eea6/bin/uautomizer/witness.graphml [2019-12-07 10:08:31,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:31,112 INFO L168 Benchmark]: Toolchain (without parser) took 61117.88 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 941.4 MB in the beginning and 1.8 GB in the end (delta: -885.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,113 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:31,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 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 10:08:31,113 INFO L168 Benchmark]: Boogie Preprocessor took 74.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,114 INFO L168 Benchmark]: RCFGBuilder took 1064.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 856.6 MB in the end (delta: 173.1 MB). Peak memory consumption was 173.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,114 INFO L168 Benchmark]: TraceAbstraction took 59247.50 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 856.6 MB in the beginning and 1.8 GB in the end (delta: -989.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,114 INFO L168 Benchmark]: Witness Printer took 117.67 ms. Allocated memory is still 3.8 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:31,115 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 526.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 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. * Boogie Preprocessor took 74.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1064.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 856.6 MB in the end (delta: 173.1 MB). Peak memory consumption was 173.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59247.50 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 856.6 MB in the beginning and 1.8 GB in the end (delta: -989.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 117.67 ms. Allocated memory is still 3.8 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 10:08:31,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((140 < a29 && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) && a25 == 11) || ((a23 <= 600000 && 1 == a4) && ((((((1 == a3 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && a25 <= 9) && 15 == a8) && 138 < a23) || (((1 == a3 && 15 == a8) && a25 == 11) && 277 < a29)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 277 < a29)))) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || ((((((a23 <= 600000 && 140 < a29) && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 138 < a23)) || ((((a25 == 12 && 1 == a3) && a29 + 22 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((140 < a29 && a25 <= 9) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((1 == a3 && a23 + 55 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || ((((((!(a25 == 9) && 140 < a29) && 1 == a3) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && 15 == a8) && 1 == a4) && !(a25 == 10))) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277) && 15 == a8)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((261 <= a29 && a23 <= 306) && a25 == 11) && 1 == a4)) || (((((a25 == 13 && 140 < a29) && 1 == a3) && a29 <= 245) && 15 == a8) && 1 == a4)) || (((((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 15 == a8) && a29 <= 277)) || ((((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || ((\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0) && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23)))) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || (((a23 <= 306 && a25 == 10) && 1 == a4) && 138 < a23)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && a25 == 10) && 1 == a4)) || (((!(a25 == 12) && 1 == a4) && a25 == 10) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && a23 <= 306) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && !(a25 == 12)) && 1 == a4) && !(a25 == 10))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && 261 <= a29) && 1 == a4) && 138 < a23) && a23 <= 262)) || ((((((1 == a3 && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && (((140 < a29 && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23))) || (a23 <= 312 && a25 == 9)) || ((a25 == 9 && 140 < a29) && a29 <= 277)))) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((a29 <= 274 && a23 <= 306) && a25 == 10) && 1 == a4)) || ((a25 == 13 && 140 < a29) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 10:08:31,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 10:08:31,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,136 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,137 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-12-07 10:08:31,138 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((140 < a29 && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) && a25 == 11) || ((a23 <= 600000 && 1 == a4) && ((((((1 == a3 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && a25 <= 9) && 15 == a8) && 138 < a23) || (((1 == a3 && 15 == a8) && a25 == 11) && 277 < a29)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 277 < a29)))) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || ((((((a23 <= 600000 && 140 < a29) && 1 == a3) && 15 == a8) && a29 <= 277) && 1 == a4) && 138 < a23)) || ((((a25 == 12 && 1 == a3) && a29 + 22 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((140 < a29 && a25 <= 9) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || (((1 == a3 && a23 + 55 <= 0) && 15 == a8) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0)))) || ((((((!(a25 == 9) && 140 < a29) && 1 == a3) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && 15 == a8) && 1 == a4) && !(a25 == 10))) || ((((((a25 == 12 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277) && 15 == a8)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((261 <= a29 && a23 <= 306) && a25 == 11) && 1 == a4)) || (((((a25 == 13 && 140 < a29) && 1 == a3) && a29 <= 245) && 15 == a8) && 1 == a4)) || (((((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && !(a25 == 13)) && a23 + 55 <= 0) && 15 == a8) && a29 <= 277)) || ((((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || ((\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0) && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23)))) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || (((a23 <= 306 && a25 == 10) && 1 == a4) && 138 < a23)) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && a25 == 10) && 1 == a4)) || (((!(a25 == 12) && 1 == a4) && a25 == 10) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && !(a25 == 12)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && a23 <= 306) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && !(a25 == 12)) && 1 == a4) && !(a25 == 10))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((((a25 == 13 && 261 <= a29) && 1 == a4) && 138 < a23) && a23 <= 262)) || ((((((1 == a3 && !(a25 == 13)) && 0 <= a29 + 28553) && a23 + 55 <= 0) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((1 == a3 && 15 == a8) && 1 == a4) && (((140 < a29 && ((a29 <= 274 && a25 == 10) || ((a29 <= 277 && a25 == 10) && 138 < a23))) || (a23 <= 312 && a25 == 9)) || ((a25 == 9 && 140 < a29) && a29 <= 277)))) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 130) && 15 == a8) && a23 + 43 <= 0)) || (((((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((a29 <= 274 && a23 <= 306) && a25 == 10) && 1 == a4)) || ((a25 == 13 && 140 < a29) && (((((a25 == 9 && a29 <= 130) && a23 + 43 <= 0) || ((a25 == 9 && 1 == a4) && a23 + 43 <= 0)) || (((a29 <= 274 && !(a25 == 12)) && 1 == a4) && a23 + 43 <= 0)) || (((!(a25 == 13) && a29 <= 130) && 1 == a4) && a23 + 43 <= 0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 47.6s, OverallIterations: 23, TraceHistogramMax: 9, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.4s, HoareTripleCheckerStatistics: 3448 SDtfs, 11205 SDslu, 1106 SDs, 0 SdLazy, 28939 SolverSat, 3652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3754 GetRequests, 3654 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19574occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 35431 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 132 NumberOfFragments, 2063 HoareAnnotationTreeSize, 3 FomulaSimplifications, 204750 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 333682 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 17961 NumberOfCodeBlocks, 17961 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17933 ConstructedInterpolants, 374 QuantifiedInterpolants, 44323805 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4602 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 40486/41667 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...