./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/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 afc12bc69e705b75a7b12a06ad7a3fcc3e70b0b1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:36:30,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:36:30,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:36:30,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:36:30,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:36:30,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:36:30,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:36:30,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:36:30,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:36:30,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:36:30,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:36:30,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:36:30,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:36:30,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:36:30,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:36:30,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:36:30,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:36:30,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:36:30,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:36:30,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:36:30,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:36:30,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:36:30,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:36:30,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:36:30,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:36:30,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:36:30,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:36:30,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:36:30,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:36:30,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:36:30,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:36:30,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:36:30,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:36:30,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:36:30,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:36:30,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:36:30,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:36:30,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:36:30,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:36:30,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:36:30,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:36:30,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:36:30,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:36:30,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:36:30,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:36:30,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:36:30,961 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:36:30,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:36:30,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:36:30,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:36:30,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:36:30,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:36:30,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:36:30,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:36:30,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:36:30,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:36:30,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:36:30,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:36:30,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:36:30,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:36:30,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:36:30,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:36:30,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:36:30,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:36:30,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:36:30,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:36:30,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:36:30,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:36:30,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:36:30,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:36:30,966 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_d88abad3-7b18-4173-94d2-be67c056af11/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 -> afc12bc69e705b75a7b12a06ad7a3fcc3e70b0b1 [2019-11-15 22:36:31,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:36:31,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:36:31,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:36:31,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:36:31,019 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:36:31,020 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2019-11-15 22:36:31,078 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/data/e27087cdd/1d638f051201454a97d97c6c5756e391/FLAG32e9ffae9 [2019-11-15 22:36:31,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:36:31,646 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2019-11-15 22:36:31,662 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/data/e27087cdd/1d638f051201454a97d97c6c5756e391/FLAG32e9ffae9 [2019-11-15 22:36:31,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/data/e27087cdd/1d638f051201454a97d97c6c5756e391 [2019-11-15 22:36:31,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:36:31,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:36:31,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:31,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:36:31,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:36:31,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:31" (1/1) ... [2019-11-15 22:36:31,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24da03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:31, skipping insertion in model container [2019-11-15 22:36:31,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:36:31" (1/1) ... [2019-11-15 22:36:31,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:36:31,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:36:32,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:32,694 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:36:32,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:36:32,927 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:36:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32 WrapperNode [2019-11-15 22:36:32,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:36:32,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:32,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:36:32,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:36:32,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:32,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:36:33,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:36:33,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:36:33,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:36:33,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... [2019-11-15 22:36:33,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:36:33,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:36:33,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:36:33,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:36:33,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:36:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:36:33,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:36:35,533 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:36:35,533 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:36:35,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:35 BoogieIcfgContainer [2019-11-15 22:36:35,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:36:35,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:36:35,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:36:35,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:36:35,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:36:31" (1/3) ... [2019-11-15 22:36:35,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:36:35, skipping insertion in model container [2019-11-15 22:36:35,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:36:32" (2/3) ... [2019-11-15 22:36:35,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:36:35, skipping insertion in model container [2019-11-15 22:36:35,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:35" (3/3) ... [2019-11-15 22:36:35,546 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2019-11-15 22:36:35,557 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:36:35,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:36:35,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:36:35,630 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:36:35,630 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:36:35,631 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:36:35,631 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:36:35,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:36:35,631 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:36:35,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:36:35,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:36:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 22:36:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:36:35,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:35,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:35,678 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2019-11-15 22:36:35,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:35,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747758045] [2019-11-15 22:36:35,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:35,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:36,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747758045] [2019-11-15 22:36:36,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:36,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:36:36,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433804554] [2019-11-15 22:36:36,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:36,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:36,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:36,224 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 22:36:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:38,519 INFO L93 Difference]: Finished difference Result 960 states and 1739 transitions. [2019-11-15 22:36:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:38,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 22:36:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:38,540 INFO L225 Difference]: With dead ends: 960 [2019-11-15 22:36:38,540 INFO L226 Difference]: Without dead ends: 610 [2019-11-15 22:36:38,544 INFO L600 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-11-15 22:36:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-15 22:36:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 595. [2019-11-15 22:36:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-15 22:36:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 904 transitions. [2019-11-15 22:36:38,626 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 904 transitions. Word has length 56 [2019-11-15 22:36:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:38,626 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 904 transitions. [2019-11-15 22:36:38,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 904 transitions. [2019-11-15 22:36:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 22:36:38,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:38,633 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:38,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 217134498, now seen corresponding path program 1 times [2019-11-15 22:36:38,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:38,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055083423] [2019-11-15 22:36:38,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:38,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:39,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055083423] [2019-11-15 22:36:39,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:39,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:36:39,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938158654] [2019-11-15 22:36:39,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:36:39,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:36:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:36:39,176 INFO L87 Difference]: Start difference. First operand 595 states and 904 transitions. Second operand 7 states. [2019-11-15 22:36:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:41,481 INFO L93 Difference]: Finished difference Result 1929 states and 2898 transitions. [2019-11-15 22:36:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:41,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-11-15 22:36:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:41,490 INFO L225 Difference]: With dead ends: 1929 [2019-11-15 22:36:41,490 INFO L226 Difference]: Without dead ends: 1336 [2019-11-15 22:36:41,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:36:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-11-15 22:36:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1334. [2019-11-15 22:36:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2019-11-15 22:36:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1721 transitions. [2019-11-15 22:36:41,537 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1721 transitions. Word has length 129 [2019-11-15 22:36:41,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:41,537 INFO L462 AbstractCegarLoop]: Abstraction has 1334 states and 1721 transitions. [2019-11-15 22:36:41,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:36:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1721 transitions. [2019-11-15 22:36:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 22:36:41,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:41,560 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:41,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 814485289, now seen corresponding path program 1 times [2019-11-15 22:36:41,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:41,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680950532] [2019-11-15 22:36:41,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:41,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 22:36:41,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680950532] [2019-11-15 22:36:41,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113331604] [2019-11-15 22:36:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:36:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:41,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:36:41,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:36:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-15 22:36:42,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:36:42,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 22:36:42,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418104096] [2019-11-15 22:36:42,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:36:42,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:36:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:42,008 INFO L87 Difference]: Start difference. First operand 1334 states and 1721 transitions. Second operand 3 states. [2019-11-15 22:36:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:43,045 INFO L93 Difference]: Finished difference Result 3227 states and 4329 transitions. [2019-11-15 22:36:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:36:43,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-15 22:36:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:43,059 INFO L225 Difference]: With dead ends: 3227 [2019-11-15 22:36:43,059 INFO L226 Difference]: Without dead ends: 2079 [2019-11-15 22:36:43,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-15 22:36:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1895. [2019-11-15 22:36:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-11-15 22:36:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2368 transitions. [2019-11-15 22:36:43,109 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2368 transitions. Word has length 199 [2019-11-15 22:36:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:43,112 INFO L462 AbstractCegarLoop]: Abstraction has 1895 states and 2368 transitions. [2019-11-15 22:36:43,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:36:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2368 transitions. [2019-11-15 22:36:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-15 22:36:43,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:43,122 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:43,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:36:43,326 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:43,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash -293129306, now seen corresponding path program 1 times [2019-11-15 22:36:43,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:43,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105563358] [2019-11-15 22:36:43,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:43,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:43,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105563358] [2019-11-15 22:36:43,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:43,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:36:43,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999621103] [2019-11-15 22:36:43,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:36:43,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:36:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:43,553 INFO L87 Difference]: Start difference. First operand 1895 states and 2368 transitions. Second operand 4 states. [2019-11-15 22:36:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:45,183 INFO L93 Difference]: Finished difference Result 5091 states and 6464 transitions. [2019-11-15 22:36:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:36:45,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-15 22:36:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:45,206 INFO L225 Difference]: With dead ends: 5091 [2019-11-15 22:36:45,207 INFO L226 Difference]: Without dead ends: 3382 [2019-11-15 22:36:45,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:36:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2019-11-15 22:36:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3184. [2019-11-15 22:36:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2019-11-15 22:36:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3921 transitions. [2019-11-15 22:36:45,277 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 3921 transitions. Word has length 236 [2019-11-15 22:36:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:45,277 INFO L462 AbstractCegarLoop]: Abstraction has 3184 states and 3921 transitions. [2019-11-15 22:36:45,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:36:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3921 transitions. [2019-11-15 22:36:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-15 22:36:45,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:45,282 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:36:45,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -814689872, now seen corresponding path program 1 times [2019-11-15 22:36:45,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:36:45,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950772921] [2019-11-15 22:36:45,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:36:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:36:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 65 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:45,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950772921] [2019-11-15 22:36:45,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211754912] [2019-11-15 22:36:45,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:36:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:45,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:36:45,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:36:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:45,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:36:46,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:36:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 79 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:36:46,355 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:36:46,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-15 22:36:46,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236361616] [2019-11-15 22:36:46,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:36:46,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:36:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:36:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:36:46,358 INFO L87 Difference]: Start difference. First operand 3184 states and 3921 transitions. Second operand 13 states. [2019-11-15 22:36:57,312 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-11-15 22:37:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:00,485 INFO L93 Difference]: Finished difference Result 19848 states and 26983 transitions. [2019-11-15 22:37:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-15 22:37:00,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 237 [2019-11-15 22:37:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:00,575 INFO L225 Difference]: With dead ends: 19848 [2019-11-15 22:37:00,575 INFO L226 Difference]: Without dead ends: 16666 [2019-11-15 22:37:00,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=764, Invalid=2658, Unknown=0, NotChecked=0, Total=3422 [2019-11-15 22:37:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16666 states. [2019-11-15 22:37:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16666 to 8882. [2019-11-15 22:37:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-11-15 22:37:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 10377 transitions. [2019-11-15 22:37:00,850 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 10377 transitions. Word has length 237 [2019-11-15 22:37:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:00,851 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 10377 transitions. [2019-11-15 22:37:00,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:37:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 10377 transitions. [2019-11-15 22:37:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-15 22:37:00,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:00,870 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:01,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:01,074 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1537666383, now seen corresponding path program 1 times [2019-11-15 22:37:01,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:01,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192578090] [2019-11-15 22:37:01,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:01,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:01,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 208 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:01,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192578090] [2019-11-15 22:37:01,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333324562] [2019-11-15 22:37:01,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:01,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:37:01,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:01,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:01,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 22:37:01,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:01,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-11-15 22:37:01,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414175789] [2019-11-15 22:37:01,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:01,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:01,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:01,950 INFO L87 Difference]: Start difference. First operand 8882 states and 10377 transitions. Second operand 4 states. [2019-11-15 22:37:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:03,755 INFO L93 Difference]: Finished difference Result 20530 states and 23903 transitions. [2019-11-15 22:37:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:03,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-11-15 22:37:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:03,800 INFO L225 Difference]: With dead ends: 20530 [2019-11-15 22:37:03,800 INFO L226 Difference]: Without dead ends: 11650 [2019-11-15 22:37:03,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2019-11-15 22:37:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 10910. [2019-11-15 22:37:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10910 states. [2019-11-15 22:37:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10910 states to 10910 states and 12508 transitions. [2019-11-15 22:37:04,003 INFO L78 Accepts]: Start accepts. Automaton has 10910 states and 12508 transitions. Word has length 350 [2019-11-15 22:37:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:04,004 INFO L462 AbstractCegarLoop]: Abstraction has 10910 states and 12508 transitions. [2019-11-15 22:37:04,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10910 states and 12508 transitions. [2019-11-15 22:37:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-15 22:37:04,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:04,023 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:04,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:04,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1612149945, now seen corresponding path program 1 times [2019-11-15 22:37:04,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:04,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15670671] [2019-11-15 22:37:04,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:04,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 310 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-15 22:37:04,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15670671] [2019-11-15 22:37:04,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915020216] [2019-11-15 22:37:04,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:04,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:37:04,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:37:04,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:04,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-15 22:37:04,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130397105] [2019-11-15 22:37:04,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:37:04,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:37:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:04,931 INFO L87 Difference]: Start difference. First operand 10910 states and 12508 transitions. Second operand 3 states. [2019-11-15 22:37:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:05,826 INFO L93 Difference]: Finished difference Result 24232 states and 28185 transitions. [2019-11-15 22:37:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:37:05,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-15 22:37:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:05,852 INFO L225 Difference]: With dead ends: 24232 [2019-11-15 22:37:05,852 INFO L226 Difference]: Without dead ends: 13878 [2019-11-15 22:37:05,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2019-11-15 22:37:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 13874. [2019-11-15 22:37:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-11-15 22:37:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 15906 transitions. [2019-11-15 22:37:06,051 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 15906 transitions. Word has length 393 [2019-11-15 22:37:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:06,052 INFO L462 AbstractCegarLoop]: Abstraction has 13874 states and 15906 transitions. [2019-11-15 22:37:06,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:37:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 15906 transitions. [2019-11-15 22:37:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-11-15 22:37:06,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:06,076 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:06,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:06,288 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash 640525611, now seen corresponding path program 1 times [2019-11-15 22:37:06,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:06,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078140353] [2019-11-15 22:37:06,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:06,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:06,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 418 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:06,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078140353] [2019-11-15 22:37:06,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957197226] [2019-11-15 22:37:06,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:37:06,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 22:37:07,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:37:07,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-15 22:37:07,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453334815] [2019-11-15 22:37:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:37:07,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:37:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:37:07,099 INFO L87 Difference]: Start difference. First operand 13874 states and 15906 transitions. Second operand 3 states. [2019-11-15 22:37:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:07,905 INFO L93 Difference]: Finished difference Result 28316 states and 32571 transitions. [2019-11-15 22:37:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:37:07,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2019-11-15 22:37:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:07,931 INFO L225 Difference]: With dead ends: 28316 [2019-11-15 22:37:07,932 INFO L226 Difference]: Without dead ends: 14998 [2019-11-15 22:37:07,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:37:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14998 states. [2019-11-15 22:37:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14998 to 14253. [2019-11-15 22:37:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14253 states. [2019-11-15 22:37:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14253 states to 14253 states and 16146 transitions. [2019-11-15 22:37:08,120 INFO L78 Accepts]: Start accepts. Automaton has 14253 states and 16146 transitions. Word has length 416 [2019-11-15 22:37:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:08,120 INFO L462 AbstractCegarLoop]: Abstraction has 14253 states and 16146 transitions. [2019-11-15 22:37:08,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:37:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14253 states and 16146 transitions. [2019-11-15 22:37:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-11-15 22:37:08,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:08,137 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:08,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:08,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1735842170, now seen corresponding path program 1 times [2019-11-15 22:37:08,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:08,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232127654] [2019-11-15 22:37:08,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:08,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:08,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 354 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:08,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232127654] [2019-11-15 22:37:08,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207649820] [2019-11-15 22:37:08,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:08,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:37:09,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:09,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 420 proven. 78 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 22:37:09,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:09,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 9 [2019-11-15 22:37:09,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856172552] [2019-11-15 22:37:09,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:09,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:09,268 INFO L87 Difference]: Start difference. First operand 14253 states and 16146 transitions. Second operand 9 states. [2019-11-15 22:37:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:18,103 INFO L93 Difference]: Finished difference Result 41069 states and 46511 transitions. [2019-11-15 22:37:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:37:18,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 429 [2019-11-15 22:37:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:18,140 INFO L225 Difference]: With dead ends: 41069 [2019-11-15 22:37:18,140 INFO L226 Difference]: Without dead ends: 27372 [2019-11-15 22:37:18,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:37:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27372 states. [2019-11-15 22:37:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27372 to 21078. [2019-11-15 22:37:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21078 states. [2019-11-15 22:37:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21078 states to 21078 states and 23527 transitions. [2019-11-15 22:37:18,573 INFO L78 Accepts]: Start accepts. Automaton has 21078 states and 23527 transitions. Word has length 429 [2019-11-15 22:37:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:18,574 INFO L462 AbstractCegarLoop]: Abstraction has 21078 states and 23527 transitions. [2019-11-15 22:37:18,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21078 states and 23527 transitions. [2019-11-15 22:37:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-15 22:37:18,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:18,622 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:18,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:18,834 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1563516641, now seen corresponding path program 1 times [2019-11-15 22:37:18,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:18,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965418321] [2019-11-15 22:37:18,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 22:37:19,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965418321] [2019-11-15 22:37:19,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:19,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:37:19,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863733585] [2019-11-15 22:37:19,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:37:19,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:37:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:19,209 INFO L87 Difference]: Start difference. First operand 21078 states and 23527 transitions. Second operand 3 states. [2019-11-15 22:37:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:19,822 INFO L93 Difference]: Finished difference Result 40486 states and 45150 transitions. [2019-11-15 22:37:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:37:19,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-11-15 22:37:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:19,847 INFO L225 Difference]: With dead ends: 40486 [2019-11-15 22:37:19,847 INFO L226 Difference]: Without dead ends: 19964 [2019-11-15 22:37:19,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19964 states. [2019-11-15 22:37:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19964 to 19587. [2019-11-15 22:37:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19587 states. [2019-11-15 22:37:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19587 states to 19587 states and 21786 transitions. [2019-11-15 22:37:20,114 INFO L78 Accepts]: Start accepts. Automaton has 19587 states and 21786 transitions. Word has length 505 [2019-11-15 22:37:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:20,115 INFO L462 AbstractCegarLoop]: Abstraction has 19587 states and 21786 transitions. [2019-11-15 22:37:20,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:37:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19587 states and 21786 transitions. [2019-11-15 22:37:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-11-15 22:37:20,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:20,140 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:20,140 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1573195711, now seen corresponding path program 1 times [2019-11-15 22:37:20,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:20,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640244044] [2019-11-15 22:37:20,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-15 22:37:20,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640244044] [2019-11-15 22:37:20,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:20,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:20,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956006122] [2019-11-15 22:37:20,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:20,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:20,571 INFO L87 Difference]: Start difference. First operand 19587 states and 21786 transitions. Second operand 4 states. [2019-11-15 22:37:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:21,956 INFO L93 Difference]: Finished difference Result 41209 states and 45847 transitions. [2019-11-15 22:37:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:21,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2019-11-15 22:37:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:21,971 INFO L225 Difference]: With dead ends: 41209 [2019-11-15 22:37:21,971 INFO L226 Difference]: Without dead ends: 21808 [2019-11-15 22:37:21,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21808 states. [2019-11-15 22:37:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21808 to 19586. [2019-11-15 22:37:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19586 states. [2019-11-15 22:37:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19586 states to 19586 states and 21467 transitions. [2019-11-15 22:37:22,215 INFO L78 Accepts]: Start accepts. Automaton has 19586 states and 21467 transitions. Word has length 563 [2019-11-15 22:37:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:22,216 INFO L462 AbstractCegarLoop]: Abstraction has 19586 states and 21467 transitions. [2019-11-15 22:37:22,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 19586 states and 21467 transitions. [2019-11-15 22:37:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-11-15 22:37:22,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:22,242 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:22,242 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2061856616, now seen corresponding path program 1 times [2019-11-15 22:37:22,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:22,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769914509] [2019-11-15 22:37:22,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:22,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 734 proven. 340 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-15 22:37:22,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769914509] [2019-11-15 22:37:22,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39295624] [2019-11-15 22:37:22,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/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-11-15 22:37:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:37:23,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:23,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:23,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 660 proven. 237 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-15 22:37:23,446 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:23,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 9 [2019-11-15 22:37:23,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099558578] [2019-11-15 22:37:23,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:37:23,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:37:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:23,461 INFO L87 Difference]: Start difference. First operand 19586 states and 21467 transitions. Second operand 9 states. [2019-11-15 22:37:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:28,622 INFO L93 Difference]: Finished difference Result 51329 states and 56019 transitions. [2019-11-15 22:37:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:37:28,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 612 [2019-11-15 22:37:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:28,644 INFO L225 Difference]: With dead ends: 51329 [2019-11-15 22:37:28,644 INFO L226 Difference]: Without dead ends: 26962 [2019-11-15 22:37:28,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 625 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:37:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26962 states. [2019-11-15 22:37:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26962 to 16454. [2019-11-15 22:37:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16454 states. [2019-11-15 22:37:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17446 transitions. [2019-11-15 22:37:28,868 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17446 transitions. Word has length 612 [2019-11-15 22:37:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:28,868 INFO L462 AbstractCegarLoop]: Abstraction has 16454 states and 17446 transitions. [2019-11-15 22:37:28,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:37:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17446 transitions. [2019-11-15 22:37:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-11-15 22:37:28,878 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:28,878 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:29,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:29,082 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:29,082 INFO L82 PathProgramCache]: Analyzing trace with hash -16219105, now seen corresponding path program 1 times [2019-11-15 22:37:29,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:29,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119442756] [2019-11-15 22:37:29,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:29,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:29,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-11-15 22:37:29,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119442756] [2019-11-15 22:37:29,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:29,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:29,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800392166] [2019-11-15 22:37:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:37:29,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:37:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:29,699 INFO L87 Difference]: Start difference. First operand 16454 states and 17446 transitions. Second operand 3 states. [2019-11-15 22:37:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:30,371 INFO L93 Difference]: Finished difference Result 29195 states and 30989 transitions. [2019-11-15 22:37:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:37:30,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 612 [2019-11-15 22:37:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:30,380 INFO L225 Difference]: With dead ends: 29195 [2019-11-15 22:37:30,380 INFO L226 Difference]: Without dead ends: 12555 [2019-11-15 22:37:30,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:37:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12555 states. [2019-11-15 22:37:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12555 to 12001. [2019-11-15 22:37:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12001 states. [2019-11-15 22:37:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12001 states to 12001 states and 12703 transitions. [2019-11-15 22:37:30,493 INFO L78 Accepts]: Start accepts. Automaton has 12001 states and 12703 transitions. Word has length 612 [2019-11-15 22:37:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:30,494 INFO L462 AbstractCegarLoop]: Abstraction has 12001 states and 12703 transitions. [2019-11-15 22:37:30,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:37:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12001 states and 12703 transitions. [2019-11-15 22:37:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2019-11-15 22:37:30,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:30,504 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:30,505 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:37:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1864892644, now seen corresponding path program 1 times [2019-11-15 22:37:30,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:30,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638796344] [2019-11-15 22:37:30,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 1123 proven. 119 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2019-11-15 22:37:31,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638796344] [2019-11-15 22:37:31,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988025410] [2019-11-15 22:37:31,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/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-11-15 22:37:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:31,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:37:31,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:49,539 WARN L191 SmtUtils]: Spent 16.13 s on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-15 22:39:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 736 proven. 54 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2019-11-15 22:39:39,898 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:39:39,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 22:39:39,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951930653] [2019-11-15 22:39:39,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:39:39,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:39:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:39:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2019-11-15 22:39:39,900 INFO L87 Difference]: Start difference. First operand 12001 states and 12703 transitions. Second operand 8 states. [2019-11-15 22:42:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:40,243 INFO L93 Difference]: Finished difference Result 14954 states and 15796 transitions. [2019-11-15 22:42:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:42:40,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 737 [2019-11-15 22:42:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:40,246 INFO L225 Difference]: With dead ends: 14954 [2019-11-15 22:42:40,246 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:42:40,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 684 SyntacticMatches, 53 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 127.0s TimeCoverageRelationStatistics Valid=27, Invalid=44, Unknown=1, NotChecked=0, Total=72 [2019-11-15 22:42:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:42:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:42:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:42:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:42:40,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 737 [2019-11-15 22:42:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:40,251 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:42:40,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:42:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:42:40,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:42:40,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:42:40,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:42:41,345 WARN L191 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 586 DAG size of output: 415 [2019-11-15 22:42:41,979 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 586 DAG size of output: 415 [2019-11-15 22:42:56,648 WARN L191 SmtUtils]: Spent 14.66 s on a formula simplification. DAG size of input: 383 DAG size of output: 111 [2019-11-15 22:43:09,137 WARN L191 SmtUtils]: Spent 12.49 s on a formula simplification. DAG size of input: 383 DAG size of output: 111 [2019-11-15 22:43:09,139 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 22:43:09,139 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 22:43:09,139 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 22:43:09,139 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 174) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,140 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 22:43:09,141 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse23 (not (= ~a25~0 9))) (.cse12 (< 138 ~a23~0)) (.cse9 (< 140 ~a29~0)) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse3 (= 1 ~a4~0))) (let ((.cse11 (= 10 ~a25~0)) (.cse1 (= 12 ~a25~0)) (.cse25 (+ ~a23~0 43)) (.cse24 (or (and .cse23 .cse9 .cse12) (and .cse9 .cse0 .cse2 .cse3))) (.cse10 (<= ~a29~0 274))) (let ((.cse17 (and .cse24 .cse10)) (.cse19 (<= ~a29~0 277)) (.cse18 (<= 187 ~a29~0)) (.cse4 (<= 312 ~a23~0)) (.cse15 (not (= ~a25~0 13))) (.cse16 (or (<= .cse25 0) .cse12)) (.cse8 (<= ~a29~0 140)) (.cse13 (<= ~a23~0 306)) (.cse5 (<= ~a4~0 0)) (.cse6 (< 0 .cse25)) (.cse7 (<= ~a23~0 247)) (.cse20 (not .cse1)) (.cse21 (not (= ~a25~0 11))) (.cse22 (not .cse11))) (or (and (and .cse0 (and .cse1 (<= ~a29~0 130))) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse2 .cse3) (and (and .cse0 .cse2 .cse3 .cse12) .cse13) (let ((.cse14 (div (+ (- ~a29~0) (- 554771)) (- 3)))) (and (< 140 .cse14) .cse15 (= (mod (+ (* ~a29~0 2) 1) (- 3)) 0) .cse2 .cse7 .cse16 (<= .cse14 245))) (and (<= 153 ~a29~0) .cse2 .cse3 .cse17) (and .cse13 .cse2 .cse17) (and (and .cse15 .cse18 .cse19) .cse2 .cse3 .cse7) (and (<= 0 (+ ~a29~0 552848)) .cse5 .cse11 .cse2 .cse8) (and .cse20 .cse21 .cse2 .cse3 .cse4 .cse22) (and .cse20 .cse21 .cse2 .cse3 .cse17) (and .cse0 .cse11 .cse2 .cse3) (and (and .cse5 .cse1 .cse19) .cse2) (and (and .cse11 .cse2 .cse19 .cse12) .cse7) (and .cse1 .cse2 .cse3 .cse7 .cse8) (and .cse5 .cse15 .cse18 .cse2 .cse7) (and (and .cse9 .cse4) .cse2 .cse3) (and .cse23 .cse15 .cse2 .cse7 .cse16 .cse8) (and .cse13 (and .cse24 .cse2) (<= 93834 ~a29~0)) (and .cse24 .cse2 .cse3 (<= 260 ~a29~0)) (and (and (<= 12 ~a25~0) .cse5 .cse6) .cse2 .cse7) (and .cse23 .cse20 .cse21 .cse2 .cse3 .cse12 .cse22))))) [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,142 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,143 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 22:43:09,144 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 22:43:09,145 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:43:09,146 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,147 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,148 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,149 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 22:43:09,150 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:43:09,151 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,152 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 22:43:09,153 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,154 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 22:43:09,155 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,156 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 22:43:09,157 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,158 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,159 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,160 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,161 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,162 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,163 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,163 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,163 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 22:43:09,163 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 22:43:09,163 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,164 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 22:43:09,165 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse23 (not (= ~a25~0 9))) (.cse12 (< 138 ~a23~0)) (.cse9 (< 140 ~a29~0)) (.cse0 (= 1 ~a3~0)) (.cse2 (= 15 ~a8~0)) (.cse3 (= 1 ~a4~0))) (let ((.cse11 (= 10 ~a25~0)) (.cse1 (= 12 ~a25~0)) (.cse25 (+ ~a23~0 43)) (.cse24 (or (and .cse23 .cse9 .cse12) (and .cse9 .cse0 .cse2 .cse3))) (.cse10 (<= ~a29~0 274))) (let ((.cse17 (and .cse24 .cse10)) (.cse19 (<= ~a29~0 277)) (.cse18 (<= 187 ~a29~0)) (.cse4 (<= 312 ~a23~0)) (.cse15 (not (= ~a25~0 13))) (.cse16 (or (<= .cse25 0) .cse12)) (.cse8 (<= ~a29~0 140)) (.cse13 (<= ~a23~0 306)) (.cse5 (<= ~a4~0 0)) (.cse6 (< 0 .cse25)) (.cse7 (<= ~a23~0 247)) (.cse20 (not .cse1)) (.cse21 (not (= ~a25~0 11))) (.cse22 (not .cse11))) (or (and (and .cse0 (and .cse1 (<= ~a29~0 130))) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse2 .cse3) (and (and .cse0 .cse2 .cse3 .cse12) .cse13) (let ((.cse14 (div (+ (- ~a29~0) (- 554771)) (- 3)))) (and (< 140 .cse14) .cse15 (= (mod (+ (* ~a29~0 2) 1) (- 3)) 0) .cse2 .cse7 .cse16 (<= .cse14 245))) (and (<= 153 ~a29~0) .cse2 .cse3 .cse17) (and .cse13 .cse2 .cse17) (and (and .cse15 .cse18 .cse19) .cse2 .cse3 .cse7) (and (<= 0 (+ ~a29~0 552848)) .cse5 .cse11 .cse2 .cse8) (and .cse20 .cse21 .cse2 .cse3 .cse4 .cse22) (and .cse20 .cse21 .cse2 .cse3 .cse17) (and .cse0 .cse11 .cse2 .cse3) (and (and .cse5 .cse1 .cse19) .cse2) (and (and .cse11 .cse2 .cse19 .cse12) .cse7) (and .cse1 .cse2 .cse3 .cse7 .cse8) (and .cse5 .cse15 .cse18 .cse2 .cse7) (and (and .cse9 .cse4) .cse2 .cse3) (and .cse23 .cse15 .cse2 .cse7 .cse16 .cse8) (and .cse13 (and .cse24 .cse2) (<= 93834 ~a29~0)) (and .cse24 .cse2 .cse3 (<= 260 ~a29~0)) (and (and (<= 12 ~a25~0) .cse5 .cse6) .cse2 .cse7) (and .cse23 .cse20 .cse21 .cse2 .cse3 .cse12 .cse22))))) [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 22:43:09,166 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,167 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,167 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 22:43:09,167 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,167 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,167 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 22:43:09,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:43:09 BoogieIcfgContainer [2019-11-15 22:43:09,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:43:09,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:43:09,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:43:09,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:43:09,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:36:35" (3/4) ... [2019-11-15 22:43:09,209 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:43:09,238 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:43:09,240 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:43:09,412 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d88abad3-7b18-4173-94d2-be67c056af11/bin/uautomizer/witness.graphml [2019-11-15 22:43:09,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:43:09,414 INFO L168 Benchmark]: Toolchain (without parser) took 397512.84 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 939.4 MB in the beginning and 996.2 MB in the end (delta: -56.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,414 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:09,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1025.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,415 INFO L168 Benchmark]: Boogie Preprocessor took 157.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,416 INFO L168 Benchmark]: RCFGBuilder took 2282.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.6 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,416 INFO L168 Benchmark]: TraceAbstraction took 393668.12 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 881.6 MB in the beginning and 1.0 GB in the end (delta: -166.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,416 INFO L168 Benchmark]: Witness Printer took 208.08 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:09,418 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1025.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2282.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.6 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 393668.12 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 881.6 MB in the beginning and 1.0 GB in the end (delta: -166.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 208.08 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 174]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((1 == a3 && 12 == a25 && a29 <= 130) && 15 == a8) && 1 == a4) && 312 <= a23) || ((((a4 <= 0 && 0 < a23 + 43) && 15 == a8) && a23 <= 247) && a29 <= 140)) || ((((140 < a29 && a29 <= 274) && 10 == a25) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 306)) || ((((((140 < (-a29 + -554771) / -3 && !(a25 == 13)) && (a29 * 2 + 1) % -3 == 0) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23)) && (-a29 + -554771) / -3 <= 245)) || (((153 <= a29 && 15 == a8) && 1 == a4) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || ((a23 <= 306 && 15 == a8) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || (((((!(a25 == 13) && 187 <= a29) && a29 <= 277) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((((0 <= a29 + 552848 && a4 <= 0) && 10 == a25) && 15 == a8) && a29 <= 140)) || (((((!(12 == a25) && !(a25 == 11)) && 15 == a8) && 1 == a4) && 312 <= a23) && !(10 == a25))) || ((((!(12 == a25) && !(a25 == 11)) && 15 == a8) && 1 == a4) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || (((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 12 == a25) && a29 <= 277) && 15 == a8)) || ((((10 == a25 && 15 == a8) && a29 <= 277) && 138 < a23) && a23 <= 247)) || ((((12 == a25 && 15 == a8) && 1 == a4) && a23 <= 247) && a29 <= 140)) || ((((a4 <= 0 && !(a25 == 13)) && 187 <= a29) && 15 == a8) && a23 <= 247)) || (((140 < a29 && 312 <= a23) && 15 == a8) && 1 == a4)) || (((((!(a25 == 9) && !(a25 == 13)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23)) && a29 <= 140)) || ((a23 <= 306 && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && 15 == a8) && 93834 <= a29)) || ((((((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && 15 == a8) && 1 == a4) && 260 <= a29)) || ((((12 <= a25 && a4 <= 0) && 0 < a23 + 43) && 15 == a8) && a23 <= 247)) || ((((((!(a25 == 9) && !(12 == a25)) && !(a25 == 11)) && 15 == a8) && 1 == a4) && 138 < a23) && !(10 == a25)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((1 == a3 && 12 == a25 && a29 <= 130) && 15 == a8) && 1 == a4) && 312 <= a23) || ((((a4 <= 0 && 0 < a23 + 43) && 15 == a8) && a23 <= 247) && a29 <= 140)) || ((((140 < a29 && a29 <= 274) && 10 == a25) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && 1 == a4) && 138 < a23) && a23 <= 306)) || ((((((140 < (-a29 + -554771) / -3 && !(a25 == 13)) && (a29 * 2 + 1) % -3 == 0) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23)) && (-a29 + -554771) / -3 <= 245)) || (((153 <= a29 && 15 == a8) && 1 == a4) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || ((a23 <= 306 && 15 == a8) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || (((((!(a25 == 13) && 187 <= a29) && a29 <= 277) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((((0 <= a29 + 552848 && a4 <= 0) && 10 == a25) && 15 == a8) && a29 <= 140)) || (((((!(12 == a25) && !(a25 == 11)) && 15 == a8) && 1 == a4) && 312 <= a23) && !(10 == a25))) || ((((!(12 == a25) && !(a25 == 11)) && 15 == a8) && 1 == a4) && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && a29 <= 274)) || (((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 <= 0 && 12 == a25) && a29 <= 277) && 15 == a8)) || ((((10 == a25 && 15 == a8) && a29 <= 277) && 138 < a23) && a23 <= 247)) || ((((12 == a25 && 15 == a8) && 1 == a4) && a23 <= 247) && a29 <= 140)) || ((((a4 <= 0 && !(a25 == 13)) && 187 <= a29) && 15 == a8) && a23 <= 247)) || (((140 < a29 && 312 <= a23) && 15 == a8) && 1 == a4)) || (((((!(a25 == 9) && !(a25 == 13)) && 15 == a8) && a23 <= 247) && (a23 + 43 <= 0 || 138 < a23)) && a29 <= 140)) || ((a23 <= 306 && (((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && 15 == a8) && 93834 <= a29)) || ((((((!(a25 == 9) && 140 < a29) && 138 < a23) || (((140 < a29 && 1 == a3) && 15 == a8) && 1 == a4)) && 15 == a8) && 1 == a4) && 260 <= a29)) || ((((12 <= a25 && a4 <= 0) && 0 < a23 + 43) && 15 == a8) && a23 <= 247)) || ((((((!(a25 == 9) && !(12 == a25)) && !(a25 == 11)) && 15 == a8) && 1 == a4) && 138 < a23) && !(10 == a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 393.5s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 222.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.6s, HoareTripleCheckerStatistics: 1766 SDtfs, 14039 SDslu, 980 SDs, 0 SdLazy, 34117 SolverSat, 5925 SolverUnsat, 89 SolverUnknown, 0 SolverNotchecked, 210.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3527 GetRequests, 3342 SyntacticMatches, 60 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 129.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21078occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 29627 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 230 NumberOfFragments, 1065 HoareAnnotationTreeSize, 3 FomulaSimplifications, 71172 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 25642 FormulaSimplificationTreeSizeReductionInter, 27.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 133.3s InterpolantComputationTime, 8847 NumberOfCodeBlocks, 8847 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 8825 ConstructedInterpolants, 60 QuantifiedInterpolants, 20103251 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4474 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 12402/13956 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...