./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label09.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_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label09.c -s /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 8c3ab847d37615cc89461d344e344751adad439b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:00:35,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:00:35,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:00:35,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:00:35,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:00:35,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:00:35,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:00:35,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:00:35,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:00:35,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:00:35,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:00:35,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:00:35,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:00:35,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:00:35,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:00:35,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:00:35,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:00:35,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:00:35,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:00:35,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:00:35,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:00:35,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:00:35,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:00:35,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:00:35,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:00:35,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:00:35,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:00:35,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:00:35,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:00:35,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:00:35,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:00:35,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:00:35,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:00:35,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:00:35,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:00:35,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:00:35,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:00:35,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:00:35,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:00:35,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:00:35,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:00:35,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:00:35,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:00:35,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:00:35,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:00:35,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:00:35,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:00:35,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:00:35,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:00:35,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:00:35,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:00:35,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:00:35,833 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_25d968b5-b10d-4402-bb23-f54f3bca729f/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 -> 8c3ab847d37615cc89461d344e344751adad439b [2019-12-07 19:00:35,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:00:35,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:00:35,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:00:35,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:00:35,945 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:00:35,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2019-12-07 19:00:35,983 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/data/845f55d9e/e7a4e7fa3ce84958b18d6c638b611e17/FLAG3afd4032f [2019-12-07 19:00:36,467 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:00:36,468 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2019-12-07 19:00:36,477 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/data/845f55d9e/e7a4e7fa3ce84958b18d6c638b611e17/FLAG3afd4032f [2019-12-07 19:00:36,968 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/data/845f55d9e/e7a4e7fa3ce84958b18d6c638b611e17 [2019-12-07 19:00:36,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:00:36,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:00:36,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:36,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:00:36,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:00:36,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:36" (1/1) ... [2019-12-07 19:00:36,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3420fa4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:36, skipping insertion in model container [2019-12-07 19:00:36,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:36" (1/1) ... [2019-12-07 19:00:36,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:00:37,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:00:37,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:37,284 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:00:37,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:37,365 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:00:37,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37 WrapperNode [2019-12-07 19:00:37,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:37,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:37,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:00:37,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:00:37,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:37,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:00:37,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:00:37,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:00:37,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... [2019-12-07 19:00:37,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:00:37,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:00:37,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:00:37,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:00:37,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:37,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:00:37,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:00:38,291 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:00:38,291 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 19:00:38,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:38 BoogieIcfgContainer [2019-12-07 19:00:38,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:00:38,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:00:38,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:00:38,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:00:38,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:00:36" (1/3) ... [2019-12-07 19:00:38,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8107bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:38, skipping insertion in model container [2019-12-07 19:00:38,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:37" (2/3) ... [2019-12-07 19:00:38,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8107bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:38, skipping insertion in model container [2019-12-07 19:00:38,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:38" (3/3) ... [2019-12-07 19:00:38,299 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2019-12-07 19:00:38,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:00:38,314 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:00:38,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:00:38,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:00:38,344 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:00:38,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:00:38,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:00:38,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:00:38,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:00:38,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:00:38,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:00:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 19:00:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 19:00:38,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:38,367 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] [2019-12-07 19:00:38,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-12-07 19:00:38,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:38,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438413901] [2019-12-07 19:00:38,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:38,544 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 19:00:38,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438413901] [2019-12-07 19:00:38,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:38,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:38,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298265303] [2019-12-07 19:00:38,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:38,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:38,561 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-12-07 19:00:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:39,568 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-12-07 19:00:39,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:39,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 19:00:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:39,582 INFO L225 Difference]: With dead ends: 850 [2019-12-07 19:00:39,582 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 19:00:39,585 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 19:00:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 19:00:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 19:00:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 19:00:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-12-07 19:00:39,637 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 45 [2019-12-07 19:00:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:39,637 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-12-07 19:00:39,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-12-07 19:00:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 19:00:39,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:39,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:39,641 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 661504820, now seen corresponding path program 1 times [2019-12-07 19:00:39,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:39,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675486257] [2019-12-07 19:00:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:39,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675486257] [2019-12-07 19:00:39,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:39,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:39,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650573860] [2019-12-07 19:00:39,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:39,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:39,739 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-12-07 19:00:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:40,497 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-12-07 19:00:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:40,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 19:00:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:40,504 INFO L225 Difference]: With dead ends: 2142 [2019-12-07 19:00:40,504 INFO L226 Difference]: Without dead ends: 1606 [2019-12-07 19:00:40,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-07 19:00:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-12-07 19:00:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 19:00:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2029 transitions. [2019-12-07 19:00:40,544 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2029 transitions. Word has length 110 [2019-12-07 19:00:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:40,544 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2029 transitions. [2019-12-07 19:00:40,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2029 transitions. [2019-12-07 19:00:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 19:00:40,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:40,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:40,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1476660258, now seen corresponding path program 1 times [2019-12-07 19:00:40,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:40,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971587094] [2019-12-07 19:00:40,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971587094] [2019-12-07 19:00:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:40,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918187125] [2019-12-07 19:00:40,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:40,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:40,630 INFO L87 Difference]: Start difference. First operand 1428 states and 2029 transitions. Second operand 4 states. [2019-12-07 19:00:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:41,540 INFO L93 Difference]: Finished difference Result 4634 states and 6631 transitions. [2019-12-07 19:00:41,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:41,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 19:00:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:41,552 INFO L225 Difference]: With dead ends: 4634 [2019-12-07 19:00:41,552 INFO L226 Difference]: Without dead ends: 3208 [2019-12-07 19:00:41,554 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 19:00:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-12-07 19:00:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2674. [2019-12-07 19:00:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 19:00:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3515 transitions. [2019-12-07 19:00:41,595 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3515 transitions. Word has length 113 [2019-12-07 19:00:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:41,595 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3515 transitions. [2019-12-07 19:00:41,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3515 transitions. [2019-12-07 19:00:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-12-07 19:00:41,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:41,602 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:41,602 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 359394002, now seen corresponding path program 1 times [2019-12-07 19:00:41,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241809720] [2019-12-07 19:00:41,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 243 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-12-07 19:00:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241809720] [2019-12-07 19:00:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187555015] [2019-12-07 19:00:41,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:41,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:00:41,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-12-07 19:00:42,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:00:42,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 19:00:42,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17359316] [2019-12-07 19:00:42,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:42,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:42,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:00:42,058 INFO L87 Difference]: Start difference. First operand 2674 states and 3515 transitions. Second operand 4 states. [2019-12-07 19:00:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:42,761 INFO L93 Difference]: Finished difference Result 5404 states and 7116 transitions. [2019-12-07 19:00:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:42,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-12-07 19:00:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:42,775 INFO L225 Difference]: With dead ends: 5404 [2019-12-07 19:00:42,775 INFO L226 Difference]: Without dead ends: 2852 [2019-12-07 19:00:42,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:00:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-12-07 19:00:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-12-07 19:00:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 19:00:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3025 transitions. [2019-12-07 19:00:42,831 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3025 transitions. Word has length 302 [2019-12-07 19:00:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:42,832 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3025 transitions. [2019-12-07 19:00:42,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3025 transitions. [2019-12-07 19:00:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-12-07 19:00:42,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:42,836 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:43,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:43,037 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1429762887, now seen corresponding path program 1 times [2019-12-07 19:00:43,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:43,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622566546] [2019-12-07 19:00:43,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 323 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 19:00:43,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622566546] [2019-12-07 19:00:43,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065507482] [2019-12-07 19:00:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:43,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:00:43,598 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 304 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 19:00:43,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:00:43,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 19:00:43,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365781507] [2019-12-07 19:00:43,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:43,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:43,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:43,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:43,817 INFO L87 Difference]: Start difference. First operand 2674 states and 3025 transitions. Second operand 8 states. [2019-12-07 19:00:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:44,980 INFO L93 Difference]: Finished difference Result 5566 states and 6281 transitions. [2019-12-07 19:00:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:00:44,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 349 [2019-12-07 19:00:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:44,991 INFO L225 Difference]: With dead ends: 5566 [2019-12-07 19:00:44,991 INFO L226 Difference]: Without dead ends: 3072 [2019-12-07 19:00:44,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:00:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-07 19:00:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2674. [2019-12-07 19:00:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 19:00:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3020 transitions. [2019-12-07 19:00:45,032 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3020 transitions. Word has length 349 [2019-12-07 19:00:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:45,033 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3020 transitions. [2019-12-07 19:00:45,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3020 transitions. [2019-12-07 19:00:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-12-07 19:00:45,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:45,041 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:45,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:45,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1798273979, now seen corresponding path program 1 times [2019-12-07 19:00:45,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:45,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160346288] [2019-12-07 19:00:45,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 769 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-12-07 19:00:46,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160346288] [2019-12-07 19:00:46,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:46,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:00:46,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647108391] [2019-12-07 19:00:46,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:46,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:46,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:46,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:46,117 INFO L87 Difference]: Start difference. First operand 2674 states and 3020 transitions. Second operand 8 states. [2019-12-07 19:00:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:46,942 INFO L93 Difference]: Finished difference Result 5174 states and 5865 transitions. [2019-12-07 19:00:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:00:46,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 567 [2019-12-07 19:00:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:46,951 INFO L225 Difference]: With dead ends: 5174 [2019-12-07 19:00:46,951 INFO L226 Difference]: Without dead ends: 2680 [2019-12-07 19:00:46,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2019-12-07 19:00:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2674. [2019-12-07 19:00:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-12-07 19:00:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3012 transitions. [2019-12-07 19:00:46,997 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3012 transitions. Word has length 567 [2019-12-07 19:00:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:46,999 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 3012 transitions. [2019-12-07 19:00:46,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3012 transitions. [2019-12-07 19:00:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-12-07 19:00:47,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:47,015 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:47,015 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1994977414, now seen corresponding path program 1 times [2019-12-07 19:00:47,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:47,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715136520] [2019-12-07 19:00:47,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 543 proven. 260 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-12-07 19:00:47,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715136520] [2019-12-07 19:00:47,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970397726] [2019-12-07 19:00:47,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:47,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:00:47,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-12-07 19:00:48,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:00:48,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 19:00:48,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170711522] [2019-12-07 19:00:48,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:48,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:48,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:00:48,192 INFO L87 Difference]: Start difference. First operand 2674 states and 3012 transitions. Second operand 4 states. [2019-12-07 19:00:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:48,709 INFO L93 Difference]: Finished difference Result 6770 states and 7740 transitions. [2019-12-07 19:00:48,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:48,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 593 [2019-12-07 19:00:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:48,723 INFO L225 Difference]: With dead ends: 6770 [2019-12-07 19:00:48,723 INFO L226 Difference]: Without dead ends: 4276 [2019-12-07 19:00:48,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 591 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:00:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-12-07 19:00:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-12-07 19:00:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-12-07 19:00:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4670 transitions. [2019-12-07 19:00:48,767 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4670 transitions. Word has length 593 [2019-12-07 19:00:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:48,768 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4670 transitions. [2019-12-07 19:00:48,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4670 transitions. [2019-12-07 19:00:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-12-07 19:00:48,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:48,773 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:48,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:48,973 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1713531829, now seen corresponding path program 1 times [2019-12-07 19:00:48,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:48,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389004733] [2019-12-07 19:00:48,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-12-07 19:00:49,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389004733] [2019-12-07 19:00:49,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564463069] [2019-12-07 19:00:49,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:49,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:00:49,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-12-07 19:00:49,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:00:49,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-12-07 19:00:49,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048173702] [2019-12-07 19:00:49,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:00:49,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:00:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:00:49,746 INFO L87 Difference]: Start difference. First operand 4276 states and 4670 transitions. Second operand 5 states. [2019-12-07 19:00:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:50,562 INFO L93 Difference]: Finished difference Result 10688 states and 11721 transitions. [2019-12-07 19:00:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:00:50,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 634 [2019-12-07 19:00:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:50,582 INFO L225 Difference]: With dead ends: 10688 [2019-12-07 19:00:50,582 INFO L226 Difference]: Without dead ends: 6592 [2019-12-07 19:00:50,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 636 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 19:00:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-12-07 19:00:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5344. [2019-12-07 19:00:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-12-07 19:00:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5832 transitions. [2019-12-07 19:00:50,638 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5832 transitions. Word has length 634 [2019-12-07 19:00:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:50,639 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5832 transitions. [2019-12-07 19:00:50,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:00:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5832 transitions. [2019-12-07 19:00:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-12-07 19:00:50,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:50,644 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, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:50,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:50,845 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash 223844596, now seen corresponding path program 1 times [2019-12-07 19:00:50,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:50,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949125231] [2019-12-07 19:00:50,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1060 proven. 260 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-12-07 19:00:51,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949125231] [2019-12-07 19:00:51,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034433124] [2019-12-07 19:00:51,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/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 19:00:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:51,827 INFO L264 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:00:51,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-12-07 19:00:52,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:00:52,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 19:00:52,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382016101] [2019-12-07 19:00:52,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:52,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:52,200 INFO L87 Difference]: Start difference. First operand 5344 states and 5832 transitions. Second operand 3 states. [2019-12-07 19:00:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:52,712 INFO L93 Difference]: Finished difference Result 11220 states and 12246 transitions. [2019-12-07 19:00:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:52,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 644 [2019-12-07 19:00:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:52,730 INFO L225 Difference]: With dead ends: 11220 [2019-12-07 19:00:52,730 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 19:00:52,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 19:00:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2019-12-07 19:00:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 19:00:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6183 transitions. [2019-12-07 19:00:52,789 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6183 transitions. Word has length 644 [2019-12-07 19:00:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:52,790 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6183 transitions. [2019-12-07 19:00:52,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6183 transitions. [2019-12-07 19:00:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2019-12-07 19:00:52,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:52,797 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:52,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:52,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1244517444, now seen corresponding path program 1 times [2019-12-07 19:00:52,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:52,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36399025] [2019-12-07 19:00:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 1036 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-12-07 19:00:53,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36399025] [2019-12-07 19:00:53,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:53,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:53,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189045811] [2019-12-07 19:00:53,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:53,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:53,470 INFO L87 Difference]: Start difference. First operand 5700 states and 6183 transitions. Second operand 4 states. [2019-12-07 19:00:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:54,046 INFO L93 Difference]: Finished difference Result 11932 states and 12993 transitions. [2019-12-07 19:00:54,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:54,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 751 [2019-12-07 19:00:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:54,054 INFO L225 Difference]: With dead ends: 11932 [2019-12-07 19:00:54,054 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 19:00:54,058 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 19:00:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 19:00:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5344. [2019-12-07 19:00:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-12-07 19:00:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5717 transitions. [2019-12-07 19:00:54,109 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5717 transitions. Word has length 751 [2019-12-07 19:00:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:54,109 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5717 transitions. [2019-12-07 19:00:54,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5717 transitions. [2019-12-07 19:00:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-12-07 19:00:54,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:54,114 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, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:54,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1327784350, now seen corresponding path program 1 times [2019-12-07 19:00:54,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:54,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931806085] [2019-12-07 19:00:54,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-12-07 19:00:54,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931806085] [2019-12-07 19:00:54,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619077512] [2019-12-07 19:00:54,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:54,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:00:54,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:54,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:54,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:54,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:54,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:54,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:54,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:00:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1302 proven. 489 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-12-07 19:00:55,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:00:55,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-07 19:00:55,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850365002] [2019-12-07 19:00:55,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:55,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:55,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:55,509 INFO L87 Difference]: Start difference. First operand 5344 states and 5717 transitions. Second operand 8 states. [2019-12-07 19:00:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:56,960 INFO L93 Difference]: Finished difference Result 13180 states and 14130 transitions. [2019-12-07 19:00:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:00:56,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 801 [2019-12-07 19:00:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:56,967 INFO L225 Difference]: With dead ends: 13180 [2019-12-07 19:00:56,968 INFO L226 Difference]: Without dead ends: 8016 [2019-12-07 19:00:56,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 801 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:00:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8016 states. [2019-12-07 19:00:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8016 to 7302. [2019-12-07 19:00:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-12-07 19:00:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 7758 transitions. [2019-12-07 19:00:57,033 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 7758 transitions. Word has length 801 [2019-12-07 19:00:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:57,034 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 7758 transitions. [2019-12-07 19:00:57,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 7758 transitions. [2019-12-07 19:00:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-12-07 19:00:57,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:57,039 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:57,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:57,240 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 776024818, now seen corresponding path program 1 times [2019-12-07 19:00:57,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:57,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114344601] [2019-12-07 19:00:57,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 563 proven. 234 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-12-07 19:00:58,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114344601] [2019-12-07 19:00:58,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241975014] [2019-12-07 19:00:58,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:58,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 19:00:58,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:00:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-12-07 19:00:58,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:00:58,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 19:00:58,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821655541] [2019-12-07 19:00:58,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:58,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:58,549 INFO L87 Difference]: Start difference. First operand 7302 states and 7758 transitions. Second operand 3 states. [2019-12-07 19:00:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:58,920 INFO L93 Difference]: Finished difference Result 14780 states and 15738 transitions. [2019-12-07 19:00:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:58,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 803 [2019-12-07 19:00:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:58,927 INFO L225 Difference]: With dead ends: 14780 [2019-12-07 19:00:58,928 INFO L226 Difference]: Without dead ends: 7658 [2019-12-07 19:00:58,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2019-12-07 19:00:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 6946. [2019-12-07 19:00:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6946 states. [2019-12-07 19:00:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6946 states to 6946 states and 7369 transitions. [2019-12-07 19:00:58,994 INFO L78 Accepts]: Start accepts. Automaton has 6946 states and 7369 transitions. Word has length 803 [2019-12-07 19:00:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:58,994 INFO L462 AbstractCegarLoop]: Abstraction has 6946 states and 7369 transitions. [2019-12-07 19:00:58,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6946 states and 7369 transitions. [2019-12-07 19:00:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-12-07 19:00:59,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:59,001 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, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:59,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:00:59,202 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1446623235, now seen corresponding path program 1 times [2019-12-07 19:00:59,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:59,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819123697] [2019-12-07 19:00:59,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 219 proven. 1018 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-12-07 19:01:00,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819123697] [2019-12-07 19:01:00,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067543304] [2019-12-07 19:01:00,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:00,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:01:00,692 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:00,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:00,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,931 WARN L192 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 29 [2019-12-07 19:01:01,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:01,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 629 proven. 720 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-12-07 19:01:03,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:01:03,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-12-07 19:01:03,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296948360] [2019-12-07 19:01:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:01:03,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:01:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:01:03,945 INFO L87 Difference]: Start difference. First operand 6946 states and 7369 transitions. Second operand 16 states. [2019-12-07 19:01:04,718 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 19:01:05,017 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 19:01:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:53,173 INFO L93 Difference]: Finished difference Result 17510 states and 18624 transitions. [2019-12-07 19:01:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:01:53,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 920 [2019-12-07 19:01:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:53,190 INFO L225 Difference]: With dead ends: 17510 [2019-12-07 19:01:53,191 INFO L226 Difference]: Without dead ends: 10744 [2019-12-07 19:01:53,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 914 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:01:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2019-12-07 19:01:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 7658. [2019-12-07 19:01:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2019-12-07 19:01:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 8173 transitions. [2019-12-07 19:01:53,273 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 8173 transitions. Word has length 920 [2019-12-07 19:01:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:53,273 INFO L462 AbstractCegarLoop]: Abstraction has 7658 states and 8173 transitions. [2019-12-07 19:01:53,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:01:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 8173 transitions. [2019-12-07 19:01:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1028 [2019-12-07 19:01:53,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:53,282 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:53,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:53,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1474396649, now seen corresponding path program 1 times [2019-12-07 19:01:53,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:53,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879473068] [2019-12-07 19:01:53,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3724 backedges. 1134 proven. 0 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-12-07 19:01:54,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879473068] [2019-12-07 19:01:54,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:54,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:01:54,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200298271] [2019-12-07 19:01:54,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:01:54,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:01:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:54,351 INFO L87 Difference]: Start difference. First operand 7658 states and 8173 transitions. Second operand 6 states. [2019-12-07 19:01:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:54,797 INFO L93 Difference]: Finished difference Result 15180 states and 16196 transitions. [2019-12-07 19:01:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:54,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1027 [2019-12-07 19:01:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:54,801 INFO L225 Difference]: With dead ends: 15180 [2019-12-07 19:01:54,801 INFO L226 Difference]: Without dead ends: 7480 [2019-12-07 19:01:54,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7480 states. [2019-12-07 19:01:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7480 to 7302. [2019-12-07 19:01:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-12-07 19:01:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 7791 transitions. [2019-12-07 19:01:54,860 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 7791 transitions. Word has length 1027 [2019-12-07 19:01:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:54,861 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 7791 transitions. [2019-12-07 19:01:54,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:01:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 7791 transitions. [2019-12-07 19:01:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2019-12-07 19:01:54,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:54,870 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, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:54,870 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 959953204, now seen corresponding path program 1 times [2019-12-07 19:01:54,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:54,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919669386] [2019-12-07 19:01:54,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 27 proven. 798 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-12-07 19:01:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919669386] [2019-12-07 19:01:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949968608] [2019-12-07 19:01:56,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:56,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:01:56,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:56,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:56,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:01:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 482 proven. 343 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-12-07 19:01:57,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:01:57,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-12-07 19:01:57,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563449159] [2019-12-07 19:01:57,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:01:57,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:01:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:01:57,401 INFO L87 Difference]: Start difference. First operand 7302 states and 7791 transitions. Second operand 11 states. [2019-12-07 19:02:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:03,786 INFO L93 Difference]: Finished difference Result 18518 states and 19757 transitions. [2019-12-07 19:02:03,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 19:02:03,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1049 [2019-12-07 19:02:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:03,796 INFO L225 Difference]: With dead ends: 18518 [2019-12-07 19:02:03,796 INFO L226 Difference]: Without dead ends: 10684 [2019-12-07 19:02:03,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1047 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2019-12-07 19:02:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10684 states. [2019-12-07 19:02:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10684 to 8014. [2019-12-07 19:02:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8014 states. [2019-12-07 19:02:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8014 states to 8014 states and 8439 transitions. [2019-12-07 19:02:03,882 INFO L78 Accepts]: Start accepts. Automaton has 8014 states and 8439 transitions. Word has length 1049 [2019-12-07 19:02:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:03,883 INFO L462 AbstractCegarLoop]: Abstraction has 8014 states and 8439 transitions. [2019-12-07 19:02:03,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:02:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8014 states and 8439 transitions. [2019-12-07 19:02:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2101 [2019-12-07 19:02:03,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:03,915 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:04,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:04,117 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:04,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash -175255361, now seen corresponding path program 1 times [2019-12-07 19:02:04,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:04,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571533993] [2019-12-07 19:02:04,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14291 backedges. 3047 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 19:02:06,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571533993] [2019-12-07 19:02:06,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:06,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:02:06,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852455069] [2019-12-07 19:02:06,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:02:06,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:06,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:02:06,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:02:06,667 INFO L87 Difference]: Start difference. First operand 8014 states and 8439 transitions. Second operand 7 states. [2019-12-07 19:02:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:07,287 INFO L93 Difference]: Finished difference Result 15858 states and 16680 transitions. [2019-12-07 19:02:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:02:07,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2100 [2019-12-07 19:02:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:07,292 INFO L225 Difference]: With dead ends: 15858 [2019-12-07 19:02:07,292 INFO L226 Difference]: Without dead ends: 7658 [2019-12-07 19:02:07,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:02:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2019-12-07 19:02:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 7658. [2019-12-07 19:02:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2019-12-07 19:02:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 8035 transitions. [2019-12-07 19:02:07,356 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 8035 transitions. Word has length 2100 [2019-12-07 19:02:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:07,358 INFO L462 AbstractCegarLoop]: Abstraction has 7658 states and 8035 transitions. [2019-12-07 19:02:07,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:02:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 8035 transitions. [2019-12-07 19:02:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2135 [2019-12-07 19:02:07,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:07,382 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:07,382 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1967952804, now seen corresponding path program 1 times [2019-12-07 19:02:07,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:07,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035420240] [2019-12-07 19:02:07,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14738 backedges. 3419 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-12-07 19:02:09,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035420240] [2019-12-07 19:02:09,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:09,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:09,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872848826] [2019-12-07 19:02:09,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:09,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:09,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:09,782 INFO L87 Difference]: Start difference. First operand 7658 states and 8035 transitions. Second operand 4 states. [2019-12-07 19:02:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:10,294 INFO L93 Difference]: Finished difference Result 16204 states and 16946 transitions. [2019-12-07 19:02:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:10,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2134 [2019-12-07 19:02:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:10,298 INFO L225 Difference]: With dead ends: 16204 [2019-12-07 19:02:10,298 INFO L226 Difference]: Without dead ends: 5344 [2019-12-07 19:02:10,301 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 19:02:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-12-07 19:02:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2019-12-07 19:02:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-12-07 19:02:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5453 transitions. [2019-12-07 19:02:10,335 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5453 transitions. Word has length 2134 [2019-12-07 19:02:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:10,336 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5453 transitions. [2019-12-07 19:02:10,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5453 transitions. [2019-12-07 19:02:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2195 [2019-12-07 19:02:10,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:10,359 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:10,359 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1002385036, now seen corresponding path program 1 times [2019-12-07 19:02:10,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:10,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707808825] [2019-12-07 19:02:10,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14978 backedges. 3696 proven. 38 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 19:02:14,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707808825] [2019-12-07 19:02:14,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296375453] [2019-12-07 19:02:14,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:14,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:02:14,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14978 backedges. 3668 proven. 66 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-12-07 19:02:17,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:02:17,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 19:02:17,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365276170] [2019-12-07 19:02:17,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:02:17,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:02:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:02:17,715 INFO L87 Difference]: Start difference. First operand 5344 states and 5453 transitions. Second operand 12 states. [2019-12-07 19:02:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:20,068 INFO L93 Difference]: Finished difference Result 10143 states and 10359 transitions. [2019-12-07 19:02:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:02:20,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2194 [2019-12-07 19:02:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:20,070 INFO L225 Difference]: With dead ends: 10143 [2019-12-07 19:02:20,070 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:02:20,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2215 GetRequests, 2198 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:02:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:02:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:02:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:02:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:02:20,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2194 [2019-12-07 19:02:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:20,073 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:02:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:02:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:02:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:02:20,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:02:20,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:02:20,589 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 303 [2019-12-07 19:02:20,817 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 303 [2019-12-07 19:02:22,372 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 275 DAG size of output: 106 [2019-12-07 19:02:25,462 WARN L192 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 275 DAG size of output: 106 [2019-12-07 19:02:25,464 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 19:02:25,465 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,466 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 19:02:25,467 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 19:02:25,468 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 19:02:25,469 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 19:02:25,470 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 19:02:25,471 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,472 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8)) (.cse12 (= ~a21~0 6)) (.cse15 (= ~a21~0 10))) (let ((.cse13 (< 80 ~a12~0)) (.cse6 (not .cse15)) (.cse11 (<= ~a12~0 225871)) (.cse14 (<= ~a12~0 11)) (.cse0 (not .cse12)) (.cse20 (= ~a21~0 7)) (.cse10 (<= ~a12~0 75)) (.cse18 (<= (+ ~a12~0 45156) 0)) (.cse4 (not .cse7)) (.cse9 (<= ~a21~0 6)) (.cse16 (<= (+ ~a12~0 60121) 0)) (.cse19 (= ~a21~0 8)) (.cse17 (= ~a15~0 9)) (.cse1 (not (= ~a15~0 5))) (.cse3 (exists ((v_~a12~0_443 Int)) (and (<= ~a12~0 (+ (mod v_~a12~0_443 299959) 300039)) (<= 0 v_~a12~0_443) (< 80 v_~a12~0_443)))) (.cse5 (<= ~a15~0 8)) (.cse8 (< 0 (+ ~a12~0 43))) (.cse2 (= ~a24~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 (or (and (or (and .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse9)) .cse11 .cse5) (and .cse12 .cse1 .cse13 .cse5) (and (or .cse0 .cse13) .cse3 (or .cse12 .cse14) .cse5 .cse9))) (and (= ~a15~0 7) .cse2 .cse15) (and .cse16 .cse2 .cse15 .cse17) (and .cse2 .cse17 .cse13) (and .cse2 (or (and .cse1 .cse18 .cse5) (and (or (and .cse7 .cse15 .cse14) (and (<= (+ ~a12~0 49) 0) .cse6)) .cse5))) (and .cse11 .cse1 .cse2 .cse19 .cse5 .cse8) (and .cse2 .cse15 .cse17 .cse14 .cse8) (and .cse1 .cse2 .cse19 .cse4 .cse5) (and .cse2 .cse14 .cse5 .cse8) (and .cse2 .cse20 .cse4 .cse5) (and .cse2 .cse4 .cse14 .cse5 .cse9) (and (<= ~a12~0 80) .cse0 .cse2 .cse5 .cse8 (not .cse20)) (and .cse10 .cse2 .cse19 .cse17 .cse8) (and .cse18 .cse4 .cse5 .cse9) (and .cse16 .cse2 .cse19 .cse17) (and (or (and .cse15 .cse5 (<= ~a12~0 73281) .cse8) (and .cse1 .cse15 .cse3 .cse5 .cse8)) .cse2)))) [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 19:02:25,473 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,474 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8)) (.cse12 (= ~a21~0 6)) (.cse15 (= ~a21~0 10))) (let ((.cse13 (< 80 ~a12~0)) (.cse6 (not .cse15)) (.cse11 (<= ~a12~0 225871)) (.cse14 (<= ~a12~0 11)) (.cse0 (not .cse12)) (.cse20 (= ~a21~0 7)) (.cse10 (<= ~a12~0 75)) (.cse18 (<= (+ ~a12~0 45156) 0)) (.cse4 (not .cse7)) (.cse9 (<= ~a21~0 6)) (.cse16 (<= (+ ~a12~0 60121) 0)) (.cse19 (= ~a21~0 8)) (.cse17 (= ~a15~0 9)) (.cse1 (not (= ~a15~0 5))) (.cse3 (exists ((v_~a12~0_443 Int)) (and (<= ~a12~0 (+ (mod v_~a12~0_443 299959) 300039)) (<= 0 v_~a12~0_443) (< 80 v_~a12~0_443)))) (.cse5 (<= ~a15~0 8)) (.cse8 (< 0 (+ ~a12~0 43))) (.cse2 (= ~a24~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 (or (and (or (and .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse9)) .cse11 .cse5) (and .cse12 .cse1 .cse13 .cse5) (and (or .cse0 .cse13) .cse3 (or .cse12 .cse14) .cse5 .cse9))) (and (= ~a15~0 7) .cse2 .cse15) (and .cse16 .cse2 .cse15 .cse17) (and .cse2 .cse17 .cse13) (and .cse2 (or (and .cse1 .cse18 .cse5) (and (or (and .cse7 .cse15 .cse14) (and (<= (+ ~a12~0 49) 0) .cse6)) .cse5))) (and .cse11 .cse1 .cse2 .cse19 .cse5 .cse8) (and .cse2 .cse15 .cse17 .cse14 .cse8) (and .cse1 .cse2 .cse19 .cse4 .cse5) (and .cse2 .cse14 .cse5 .cse8) (and .cse2 .cse20 .cse4 .cse5) (and .cse2 .cse4 .cse14 .cse5 .cse9) (and (<= ~a12~0 80) .cse0 .cse2 .cse5 .cse8 (not .cse20)) (and .cse10 .cse2 .cse19 .cse17 .cse8) (and .cse18 .cse4 .cse5 .cse9) (and .cse16 .cse2 .cse19 .cse17) (and (or (and .cse15 .cse5 (<= ~a12~0 73281) .cse8) (and .cse1 .cse15 .cse3 .cse5 .cse8)) .cse2)))) [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,475 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,476 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 19:02:25,477 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 19:02:25,478 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 19:02:25,479 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 19:02:25,479 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 19:02:25,479 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 19:02:25,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:02:25 BoogieIcfgContainer [2019-12-07 19:02:25,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:02:25,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:02:25,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:02:25,518 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:02:25,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:38" (3/4) ... [2019-12-07 19:02:25,521 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:02:25,542 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 19:02:25,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:02:25,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(a21 == 10)) || (a24 == 1 && (((((((a15 == 8 && 0 < a12 + 43) && a21 <= 6) || (((a12 <= 75 && !(a15 == 5)) && 0 < a12 + 43) && a21 <= 6)) && a12 <= 225871) && a15 <= 8) || (((a21 == 6 && !(a15 == 5)) && 80 < a12) && a15 <= 8)) || (((((!(a21 == 6) || 80 < a12) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (a24 == 1 && (((!(a15 == 5) && a12 + 45156 <= 0) && a15 <= 8) || ((((a15 == 8 && a21 == 10) && a12 <= 11) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8)))) || (((((a12 <= 225871 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a24 == 1 && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && a21 <= 6)) || (((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && !(a21 == 7))) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || (((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1) [2019-12-07 19:02:25,567 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(a21 == 10)) || (a24 == 1 && (((((((a15 == 8 && 0 < a12 + 43) && a21 <= 6) || (((a12 <= 75 && !(a15 == 5)) && 0 < a12 + 43) && a21 <= 6)) && a12 <= 225871) && a15 <= 8) || (((a21 == 6 && !(a15 == 5)) && 80 < a12) && a15 <= 8)) || (((((!(a21 == 6) || 80 < a12) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (a24 == 1 && (((!(a15 == 5) && a12 + 45156 <= 0) && a15 <= 8) || ((((a15 == 8 && a21 == 10) && a12 <= 11) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8)))) || (((((a12 <= 225871 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a24 == 1 && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && a21 <= 6)) || (((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && !(a21 == 7))) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || (((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1) [2019-12-07 19:02:25,649 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25d968b5-b10d-4402-bb23-f54f3bca729f/bin/uautomizer/witness.graphml [2019-12-07 19:02:25,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:02:25,650 INFO L168 Benchmark]: Toolchain (without parser) took 108679.39 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 937.2 MB in the beginning and 1.8 GB in the end (delta: -854.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,651 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:25,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,651 INFO L168 Benchmark]: Boogie Preprocessor took 52.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,651 INFO L168 Benchmark]: RCFGBuilder took 811.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 921.0 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,652 INFO L168 Benchmark]: TraceAbstraction took 107223.85 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 921.0 MB in the beginning and 1.9 GB in the end (delta: -949.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,652 INFO L168 Benchmark]: Witness Printer took 132.30 ms. Allocated memory is still 3.8 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:25,653 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 811.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 921.0 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107223.85 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 921.0 MB in the beginning and 1.9 GB in the end (delta: -949.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 132.30 ms. Allocated memory is still 3.8 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-12-07 19:02:25,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(a21 == 10)) || (a24 == 1 && (((((((a15 == 8 && 0 < a12 + 43) && a21 <= 6) || (((a12 <= 75 && !(a15 == 5)) && 0 < a12 + 43) && a21 <= 6)) && a12 <= 225871) && a15 <= 8) || (((a21 == 6 && !(a15 == 5)) && 80 < a12) && a15 <= 8)) || (((((!(a21 == 6) || 80 < a12) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (a24 == 1 && (((!(a15 == 5) && a12 + 45156 <= 0) && a15 <= 8) || ((((a15 == 8 && a21 == 10) && a12 <= 11) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8)))) || (((((a12 <= 225871 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a24 == 1 && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && a21 <= 6)) || (((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && !(a21 == 7))) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || (((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1) - InvariantResult [Line: 20]: Loop Invariant [2019-12-07 19:02:25,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] [2019-12-07 19:02:25,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_443,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && !(a15 == 8)) && a15 <= 8) && !(a21 == 10)) || (a24 == 1 && (((((((a15 == 8 && 0 < a12 + 43) && a21 <= 6) || (((a12 <= 75 && !(a15 == 5)) && 0 < a12 + 43) && a21 <= 6)) && a12 <= 225871) && a15 <= 8) || (((a21 == 6 && !(a15 == 5)) && 80 < a12) && a15 <= 8)) || (((((!(a21 == 6) || 80 < a12) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && (a21 == 6 || a12 <= 11)) && a15 <= 8) && a21 <= 6)))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 10) && a15 == 9)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (a24 == 1 && (((!(a15 == 5) && a12 + 45156 <= 0) && a15 <= 8) || ((((a15 == 8 && a21 == 10) && a12 <= 11) || (a12 + 49 <= 0 && !(a21 == 10))) && a15 <= 8)))) || (((((a12 <= 225871 && !(a15 == 5)) && a24 == 1) && a21 == 8) && a15 <= 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((((a24 == 1 && !(a15 == 8)) && a12 <= 11) && a15 <= 8) && a21 <= 6)) || (((((a12 <= 80 && !(a21 == 6)) && a24 == 1) && a15 <= 8) && 0 < a12 + 43) && !(a21 == 7))) || ((((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9) && 0 < a12 + 43)) || (((a12 + 45156 <= 0 && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || (((a12 + 60121 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((((a21 == 10 && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43) || ((((!(a15 == 5) && a21 == 10) && (\exists v_~a12~0_443 : int :: (a12 <= v_~a12~0_443 % 299959 + 300039 && 0 <= v_~a12~0_443) && 80 < v_~a12~0_443)) && a15 <= 8) && 0 < a12 + 43)) && a24 == 1) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 101.9s, OverallIterations: 18, TraceHistogramMax: 18, AutomataDifference: 69.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, HoareTripleCheckerStatistics: 1397 SDtfs, 15937 SDslu, 412 SDs, 0 SdLazy, 28526 SolverSat, 3049 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 62.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8455 GetRequests, 8295 SyntacticMatches, 13 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8014occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 11326 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 130 NumberOfFragments, 873 HoareAnnotationTreeSize, 3 FomulaSimplifications, 90384 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 29898 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 23425 NumberOfCodeBlocks, 23425 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 23397 ConstructedInterpolants, 181 QuantifiedInterpolants, 80732711 SizeOfPredicates, 17 NumberOfNonLiveVariables, 10177 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 90106/94655 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...