./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.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_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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 003d8b9b18d0283d5817b74650d7167df10fa305 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:18,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:18,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:18,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:18,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:18,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:18,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:18,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:18,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:18,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:18,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:18,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:18,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:18,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:18,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:18,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:18,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:18,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:18,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:18,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:18,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:18,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:18,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:18,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:18,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:18,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:18,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:18,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:18,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:18,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:18,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:18,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:18,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:18,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:18,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:18,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:18,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:18,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:18,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:18,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:18,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:18,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:26:18,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:18,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:18,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:18,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:18,974 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:18,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:18,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:18,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:18,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:18,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:18,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:18,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:18,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:18,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:18,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:18,977 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:18,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:18,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:18,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:18,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:18,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:18,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:18,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:18,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:18,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:18,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:18,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:26:18,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:18,986 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_96a52c27-dcd5-46d1-83a4-708706012f96/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 -> 003d8b9b18d0283d5817b74650d7167df10fa305 [2019-11-16 00:26:19,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:19,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:19,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:19,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:19,054 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:19,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-11-16 00:26:19,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/data/4f3e9df20/cf204cd378814474b626c96e328c5fcc/FLAGdc6a34876 [2019-11-16 00:26:19,730 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:19,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-11-16 00:26:19,748 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/data/4f3e9df20/cf204cd378814474b626c96e328c5fcc/FLAGdc6a34876 [2019-11-16 00:26:19,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/data/4f3e9df20/cf204cd378814474b626c96e328c5fcc [2019-11-16 00:26:19,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:19,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:19,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:19,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:19,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:19,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:19" (1/1) ... [2019-11-16 00:26:19,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c29987d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:19, skipping insertion in model container [2019-11-16 00:26:19,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:19" (1/1) ... [2019-11-16 00:26:19,978 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:20,068 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:20,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:20,838 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:21,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:21,134 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:21,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21 WrapperNode [2019-11-16 00:26:21,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:21,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:21,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:21,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:21,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:21,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:21,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:21,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:21,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... [2019-11-16 00:26:21,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:21,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:21,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:21,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:21,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:26:21,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:23,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:23,840 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:26:23,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:23 BoogieIcfgContainer [2019-11-16 00:26:23,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:23,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:23,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:23,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:23,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:19" (1/3) ... [2019-11-16 00:26:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7319a514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:23, skipping insertion in model container [2019-11-16 00:26:23,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:21" (2/3) ... [2019-11-16 00:26:23,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7319a514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:23, skipping insertion in model container [2019-11-16 00:26:23,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:23" (3/3) ... [2019-11-16 00:26:23,850 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2019-11-16 00:26:23,859 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:23,868 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:26:23,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:26:23,917 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:23,917 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:26:23,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:23,917 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:23,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:23,918 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:23,918 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:23,918 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-16 00:26:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:26:23,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:23,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:23,965 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 302925243, now seen corresponding path program 1 times [2019-11-16 00:26:23,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:23,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316175119] [2019-11-16 00:26:23,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:23,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:23,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:24,682 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-16 00:26:24,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316175119] [2019-11-16 00:26:24,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:24,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:24,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612075631] [2019-11-16 00:26:24,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:24,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:24,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:24,707 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-16 00:26:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:26,890 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-16 00:26:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:26,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-16 00:26:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:26,917 INFO L225 Difference]: With dead ends: 1068 [2019-11-16 00:26:26,917 INFO L226 Difference]: Without dead ends: 670 [2019-11-16 00:26:26,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-16 00:26:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-16 00:26:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-16 00:26:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-16 00:26:26,997 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 177 [2019-11-16 00:26:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:26,998 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-16 00:26:26,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-16 00:26:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-16 00:26:27,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:27,003 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:27,004 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2005485845, now seen corresponding path program 1 times [2019-11-16 00:26:27,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:27,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784546535] [2019-11-16 00:26:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:27,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:27,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784546535] [2019-11-16 00:26:27,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:27,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:27,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800465128] [2019-11-16 00:26:27,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:27,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:27,094 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-16 00:26:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:28,757 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-16 00:26:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:28,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-16 00:26:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:28,766 INFO L225 Difference]: With dead ends: 1762 [2019-11-16 00:26:28,766 INFO L226 Difference]: Without dead ends: 1308 [2019-11-16 00:26:28,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-16 00:26:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-16 00:26:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-16 00:26:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-16 00:26:28,812 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 182 [2019-11-16 00:26:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:28,813 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-16 00:26:28,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-16 00:26:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:26:28,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:28,820 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:28,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash -23446020, now seen corresponding path program 1 times [2019-11-16 00:26:28,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:28,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6777781] [2019-11-16 00:26:28,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:28,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:28,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:28,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6777781] [2019-11-16 00:26:28,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:28,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:28,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714052961] [2019-11-16 00:26:28,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:28,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:28,907 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-16 00:26:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:29,914 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-16 00:26:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:29,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-16 00:26:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:29,924 INFO L225 Difference]: With dead ends: 2567 [2019-11-16 00:26:29,924 INFO L226 Difference]: Without dead ends: 1700 [2019-11-16 00:26:29,926 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-16 00:26:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-16 00:26:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-16 00:26:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-16 00:26:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2435 transitions. [2019-11-16 00:26:29,974 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2435 transitions. Word has length 185 [2019-11-16 00:26:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:29,975 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2435 transitions. [2019-11-16 00:26:29,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2435 transitions. [2019-11-16 00:26:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:26:29,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:29,981 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:29,982 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 372513201, now seen corresponding path program 1 times [2019-11-16 00:26:29,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:29,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263785139] [2019-11-16 00:26:29,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:26:30,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263785139] [2019-11-16 00:26:30,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:30,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:30,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852907026] [2019-11-16 00:26:30,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:30,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:30,248 INFO L87 Difference]: Start difference. First operand 1683 states and 2435 transitions. Second operand 3 states. [2019-11-16 00:26:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,116 INFO L93 Difference]: Finished difference Result 5005 states and 7260 transitions. [2019-11-16 00:26:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-16 00:26:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,140 INFO L225 Difference]: With dead ends: 5005 [2019-11-16 00:26:31,140 INFO L226 Difference]: Without dead ends: 3324 [2019-11-16 00:26:31,143 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-16 00:26:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-11-16 00:26:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3307. [2019-11-16 00:26:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2019-11-16 00:26:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4678 transitions. [2019-11-16 00:26:31,226 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4678 transitions. Word has length 192 [2019-11-16 00:26:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:31,228 INFO L462 AbstractCegarLoop]: Abstraction has 3307 states and 4678 transitions. [2019-11-16 00:26:31,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4678 transitions. [2019-11-16 00:26:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-16 00:26:31,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:31,237 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:31,237 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash 962558153, now seen corresponding path program 1 times [2019-11-16 00:26:31,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:31,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088707874] [2019-11-16 00:26:31,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:31,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:26:31,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088707874] [2019-11-16 00:26:31,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:31,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:31,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769245233] [2019-11-16 00:26:31,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:31,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:31,348 INFO L87 Difference]: Start difference. First operand 3307 states and 4678 transitions. Second operand 3 states. [2019-11-16 00:26:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:31,953 INFO L93 Difference]: Finished difference Result 6585 states and 9318 transitions. [2019-11-16 00:26:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:31,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-16 00:26:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:31,970 INFO L225 Difference]: With dead ends: 6585 [2019-11-16 00:26:31,970 INFO L226 Difference]: Without dead ends: 3280 [2019-11-16 00:26:31,974 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-16 00:26:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2019-11-16 00:26:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3280. [2019-11-16 00:26:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3280 states. [2019-11-16 00:26:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4514 transitions. [2019-11-16 00:26:32,038 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4514 transitions. Word has length 205 [2019-11-16 00:26:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:32,038 INFO L462 AbstractCegarLoop]: Abstraction has 3280 states and 4514 transitions. [2019-11-16 00:26:32,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4514 transitions. [2019-11-16 00:26:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-16 00:26:32,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:32,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:32,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash -338235124, now seen corresponding path program 1 times [2019-11-16 00:26:32,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:32,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714642446] [2019-11-16 00:26:32,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:32,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:32,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714642446] [2019-11-16 00:26:32,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:32,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:32,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022370312] [2019-11-16 00:26:32,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:32,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:32,155 INFO L87 Difference]: Start difference. First operand 3280 states and 4514 transitions. Second operand 3 states. [2019-11-16 00:26:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:32,956 INFO L93 Difference]: Finished difference Result 7992 states and 10933 transitions. [2019-11-16 00:26:32,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:32,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-16 00:26:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:32,980 INFO L225 Difference]: With dead ends: 7992 [2019-11-16 00:26:32,981 INFO L226 Difference]: Without dead ends: 4714 [2019-11-16 00:26:32,985 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-16 00:26:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-11-16 00:26:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4713. [2019-11-16 00:26:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4713 states. [2019-11-16 00:26:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 6371 transitions. [2019-11-16 00:26:33,071 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 6371 transitions. Word has length 218 [2019-11-16 00:26:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:33,071 INFO L462 AbstractCegarLoop]: Abstraction has 4713 states and 6371 transitions. [2019-11-16 00:26:33,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 6371 transitions. [2019-11-16 00:26:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:26:33,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:33,083 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:33,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1335500791, now seen corresponding path program 1 times [2019-11-16 00:26:33,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:33,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139606246] [2019-11-16 00:26:33,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:33,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:33,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139606246] [2019-11-16 00:26:33,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897755874] [2019-11-16 00:26:33,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:26:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:33,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:26:33,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:26:33,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:33,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:26:33,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201321833] [2019-11-16 00:26:33,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:33,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:33,629 INFO L87 Difference]: Start difference. First operand 4713 states and 6371 transitions. Second operand 3 states. [2019-11-16 00:26:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:34,490 INFO L93 Difference]: Finished difference Result 12878 states and 17336 transitions. [2019-11-16 00:26:34,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:34,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-16 00:26:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:34,529 INFO L225 Difference]: With dead ends: 12878 [2019-11-16 00:26:34,529 INFO L226 Difference]: Without dead ends: 8167 [2019-11-16 00:26:34,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-11-16 00:26:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-11-16 00:26:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-16 00:26:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10429 transitions. [2019-11-16 00:26:34,684 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10429 transitions. Word has length 225 [2019-11-16 00:26:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:34,684 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10429 transitions. [2019-11-16 00:26:34,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10429 transitions. [2019-11-16 00:26:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-16 00:26:34,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:34,701 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:34,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:34,906 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1624570458, now seen corresponding path program 1 times [2019-11-16 00:26:34,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:34,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730589324] [2019-11-16 00:26:34,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:34,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:26:35,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730589324] [2019-11-16 00:26:35,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:35,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:35,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629671812] [2019-11-16 00:26:35,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:35,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:35,017 INFO L87 Difference]: Start difference. First operand 8164 states and 10429 transitions. Second operand 3 states. [2019-11-16 00:26:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:35,919 INFO L93 Difference]: Finished difference Result 16331 states and 20865 transitions. [2019-11-16 00:26:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:35,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-16 00:26:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:35,966 INFO L225 Difference]: With dead ends: 16331 [2019-11-16 00:26:35,967 INFO L226 Difference]: Without dead ends: 8169 [2019-11-16 00:26:35,976 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-16 00:26:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2019-11-16 00:26:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 8164. [2019-11-16 00:26:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-16 00:26:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10164 transitions. [2019-11-16 00:26:36,253 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10164 transitions. Word has length 226 [2019-11-16 00:26:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:36,254 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10164 transitions. [2019-11-16 00:26:36,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10164 transitions. [2019-11-16 00:26:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-16 00:26:36,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:36,270 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:36,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash 587520109, now seen corresponding path program 1 times [2019-11-16 00:26:36,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:36,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162520709] [2019-11-16 00:26:36,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:36,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:26:36,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162520709] [2019-11-16 00:26:36,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:36,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:36,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086466759] [2019-11-16 00:26:36,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:36,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:36,368 INFO L87 Difference]: Start difference. First operand 8164 states and 10164 transitions. Second operand 4 states. [2019-11-16 00:26:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:37,385 INFO L93 Difference]: Finished difference Result 16329 states and 20331 transitions. [2019-11-16 00:26:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:37,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-16 00:26:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:37,398 INFO L225 Difference]: With dead ends: 16329 [2019-11-16 00:26:37,398 INFO L226 Difference]: Without dead ends: 8167 [2019-11-16 00:26:37,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-11-16 00:26:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-11-16 00:26:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-16 00:26:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 9877 transitions. [2019-11-16 00:26:37,509 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 9877 transitions. Word has length 226 [2019-11-16 00:26:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:37,510 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 9877 transitions. [2019-11-16 00:26:37,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 9877 transitions. [2019-11-16 00:26:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-16 00:26:37,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:37,527 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:37,527 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1006401140, now seen corresponding path program 1 times [2019-11-16 00:26:37,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:37,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26708972] [2019-11-16 00:26:37,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:37,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:37,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-16 00:26:37,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26708972] [2019-11-16 00:26:37,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:37,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:37,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253587438] [2019-11-16 00:26:37,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:37,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:37,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:37,618 INFO L87 Difference]: Start difference. First operand 8164 states and 9877 transitions. Second operand 3 states. [2019-11-16 00:26:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:38,659 INFO L93 Difference]: Finished difference Result 21810 states and 26334 transitions. [2019-11-16 00:26:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:38,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-16 00:26:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:38,698 INFO L225 Difference]: With dead ends: 21810 [2019-11-16 00:26:38,698 INFO L226 Difference]: Without dead ends: 13648 [2019-11-16 00:26:38,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13648 states. [2019-11-16 00:26:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13648 to 13239. [2019-11-16 00:26:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13239 states. [2019-11-16 00:26:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13239 states to 13239 states and 15073 transitions. [2019-11-16 00:26:39,040 INFO L78 Accepts]: Start accepts. Automaton has 13239 states and 15073 transitions. Word has length 232 [2019-11-16 00:26:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:39,040 INFO L462 AbstractCegarLoop]: Abstraction has 13239 states and 15073 transitions. [2019-11-16 00:26:39,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13239 states and 15073 transitions. [2019-11-16 00:26:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-16 00:26:39,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:39,059 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:39,059 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 781312374, now seen corresponding path program 1 times [2019-11-16 00:26:39,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:39,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697513914] [2019-11-16 00:26:39,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:39,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:39,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697513914] [2019-11-16 00:26:39,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:39,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:39,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396005586] [2019-11-16 00:26:39,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:39,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:39,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:39,195 INFO L87 Difference]: Start difference. First operand 13239 states and 15073 transitions. Second operand 4 states. [2019-11-16 00:26:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:40,602 INFO L93 Difference]: Finished difference Result 30336 states and 34762 transitions. [2019-11-16 00:26:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:40,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-16 00:26:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:40,634 INFO L225 Difference]: With dead ends: 30336 [2019-11-16 00:26:40,635 INFO L226 Difference]: Without dead ends: 17099 [2019-11-16 00:26:40,647 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-16 00:26:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2019-11-16 00:26:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16893. [2019-11-16 00:26:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-11-16 00:26:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18718 transitions. [2019-11-16 00:26:40,860 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18718 transitions. Word has length 232 [2019-11-16 00:26:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:40,861 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18718 transitions. [2019-11-16 00:26:40,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18718 transitions. [2019-11-16 00:26:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-16 00:26:40,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:40,883 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:40,884 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash 211469247, now seen corresponding path program 1 times [2019-11-16 00:26:40,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:40,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593306295] [2019-11-16 00:26:40,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:40,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:26:41,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593306295] [2019-11-16 00:26:41,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:41,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:41,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271356646] [2019-11-16 00:26:41,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:41,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:41,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:41,077 INFO L87 Difference]: Start difference. First operand 16893 states and 18718 transitions. Second operand 4 states. [2019-11-16 00:26:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:41,984 INFO L93 Difference]: Finished difference Result 33795 states and 37455 transitions. [2019-11-16 00:26:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:41,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-16 00:26:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:42,013 INFO L225 Difference]: With dead ends: 33795 [2019-11-16 00:26:42,013 INFO L226 Difference]: Without dead ends: 16904 [2019-11-16 00:26:42,026 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-16 00:26:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2019-11-16 00:26:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 16893. [2019-11-16 00:26:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-11-16 00:26:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18680 transitions. [2019-11-16 00:26:42,522 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18680 transitions. Word has length 286 [2019-11-16 00:26:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:42,523 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18680 transitions. [2019-11-16 00:26:42,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18680 transitions. [2019-11-16 00:26:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-16 00:26:42,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:42,544 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:26:42,545 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1573273311, now seen corresponding path program 1 times [2019-11-16 00:26:42,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:42,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35038723] [2019-11-16 00:26:42,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:42,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:42,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-16 00:26:42,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35038723] [2019-11-16 00:26:42,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:42,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:42,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088043083] [2019-11-16 00:26:42,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:42,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:42,740 INFO L87 Difference]: Start difference. First operand 16893 states and 18680 transitions. Second operand 3 states. [2019-11-16 00:26:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:43,333 INFO L93 Difference]: Finished difference Result 33782 states and 37356 transitions. [2019-11-16 00:26:43,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:43,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-16 00:26:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:43,351 INFO L225 Difference]: With dead ends: 33782 [2019-11-16 00:26:43,352 INFO L226 Difference]: Without dead ends: 16891 [2019-11-16 00:26:43,361 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-16 00:26:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16891 states. [2019-11-16 00:26:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16891 to 16891. [2019-11-16 00:26:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16891 states. [2019-11-16 00:26:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16891 states to 16891 states and 18676 transitions. [2019-11-16 00:26:43,551 INFO L78 Accepts]: Start accepts. Automaton has 16891 states and 18676 transitions. Word has length 313 [2019-11-16 00:26:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:43,552 INFO L462 AbstractCegarLoop]: Abstraction has 16891 states and 18676 transitions. [2019-11-16 00:26:43,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16891 states and 18676 transitions. [2019-11-16 00:26:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-16 00:26:43,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:43,568 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:43,568 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash -476839199, now seen corresponding path program 1 times [2019-11-16 00:26:43,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:43,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740941303] [2019-11-16 00:26:43,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:43,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:43,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-16 00:26:43,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740941303] [2019-11-16 00:26:43,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386868886] [2019-11-16 00:26:43,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:26:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:43,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:43,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-16 00:26:44,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:44,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:26:44,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377205107] [2019-11-16 00:26:44,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:44,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:26:44,266 INFO L87 Difference]: Start difference. First operand 16891 states and 18676 transitions. Second operand 3 states. [2019-11-16 00:26:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:45,277 INFO L93 Difference]: Finished difference Result 33580 states and 37144 transitions. [2019-11-16 00:26:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:45,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-11-16 00:26:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:45,303 INFO L225 Difference]: With dead ends: 33580 [2019-11-16 00:26:45,303 INFO L226 Difference]: Without dead ends: 16691 [2019-11-16 00:26:45,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:26:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2019-11-16 00:26:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 16079. [2019-11-16 00:26:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16079 states. [2019-11-16 00:26:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16079 states to 16079 states and 17679 transitions. [2019-11-16 00:26:45,564 INFO L78 Accepts]: Start accepts. Automaton has 16079 states and 17679 transitions. Word has length 319 [2019-11-16 00:26:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:45,564 INFO L462 AbstractCegarLoop]: Abstraction has 16079 states and 17679 transitions. [2019-11-16 00:26:45,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16079 states and 17679 transitions. [2019-11-16 00:26:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-16 00:26:45,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:45,599 INFO L380 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:45,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:45,803 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 738662, now seen corresponding path program 1 times [2019-11-16 00:26:45,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:45,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644937341] [2019-11-16 00:26:45,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:26:46,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644937341] [2019-11-16 00:26:46,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092263036] [2019-11-16 00:26:46,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:26:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:46,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:26:46,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:26:46,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:46,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-16 00:26:46,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355870027] [2019-11-16 00:26:46,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:46,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:46,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:46,361 INFO L87 Difference]: Start difference. First operand 16079 states and 17679 transitions. Second operand 4 states. [2019-11-16 00:26:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:47,716 INFO L93 Difference]: Finished difference Result 48830 states and 53690 transitions. [2019-11-16 00:26:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:47,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-16 00:26:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:47,753 INFO L225 Difference]: With dead ends: 48830 [2019-11-16 00:26:47,753 INFO L226 Difference]: Without dead ends: 32753 [2019-11-16 00:26:47,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32753 states. [2019-11-16 00:26:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32753 to 32749. [2019-11-16 00:26:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32749 states. [2019-11-16 00:26:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32749 states to 32749 states and 35966 transitions. [2019-11-16 00:26:48,419 INFO L78 Accepts]: Start accepts. Automaton has 32749 states and 35966 transitions. Word has length 361 [2019-11-16 00:26:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:48,419 INFO L462 AbstractCegarLoop]: Abstraction has 32749 states and 35966 transitions. [2019-11-16 00:26:48,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32749 states and 35966 transitions. [2019-11-16 00:26:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-16 00:26:48,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:48,441 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:26:48,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:48,645 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1903494745, now seen corresponding path program 1 times [2019-11-16 00:26:48,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:48,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349790696] [2019-11-16 00:26:48,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:48,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:48,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:26:48,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349790696] [2019-11-16 00:26:48,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:48,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:26:48,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614418765] [2019-11-16 00:26:48,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:26:48,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:26:48,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:48,888 INFO L87 Difference]: Start difference. First operand 32749 states and 35966 transitions. Second operand 5 states. [2019-11-16 00:26:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:50,797 INFO L93 Difference]: Finished difference Result 90940 states and 100098 transitions. [2019-11-16 00:26:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:26:50,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-11-16 00:26:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:50,859 INFO L225 Difference]: With dead ends: 90940 [2019-11-16 00:26:50,859 INFO L226 Difference]: Without dead ends: 58193 [2019-11-16 00:26:50,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:26:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58193 states. [2019-11-16 00:26:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58193 to 56346. [2019-11-16 00:26:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56346 states. [2019-11-16 00:26:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56346 states to 56346 states and 61942 transitions. [2019-11-16 00:26:51,877 INFO L78 Accepts]: Start accepts. Automaton has 56346 states and 61942 transitions. Word has length 364 [2019-11-16 00:26:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:51,877 INFO L462 AbstractCegarLoop]: Abstraction has 56346 states and 61942 transitions. [2019-11-16 00:26:51,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:26:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 56346 states and 61942 transitions. [2019-11-16 00:26:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-16 00:26:51,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:51,903 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:51,903 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 296271038, now seen corresponding path program 1 times [2019-11-16 00:26:51,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:51,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518966583] [2019-11-16 00:26:51,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:51,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:51,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 190 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:52,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518966583] [2019-11-16 00:26:52,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649186770] [2019-11-16 00:26:52,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:26:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:52,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:26:52,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:26:53,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:53,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-16 00:26:53,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374128394] [2019-11-16 00:26:53,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:53,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:26:53,135 INFO L87 Difference]: Start difference. First operand 56346 states and 61942 transitions. Second operand 4 states. [2019-11-16 00:26:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:54,727 INFO L93 Difference]: Finished difference Result 117999 states and 129821 transitions. [2019-11-16 00:26:54,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:54,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-11-16 00:26:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:54,780 INFO L225 Difference]: With dead ends: 117999 [2019-11-16 00:26:54,780 INFO L226 Difference]: Without dead ends: 61655 [2019-11-16 00:26:54,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:26:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61655 states. [2019-11-16 00:26:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61655 to 59996. [2019-11-16 00:26:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59996 states. [2019-11-16 00:26:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59996 states to 59996 states and 64829 transitions. [2019-11-16 00:26:55,794 INFO L78 Accepts]: Start accepts. Automaton has 59996 states and 64829 transitions. Word has length 366 [2019-11-16 00:26:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:55,794 INFO L462 AbstractCegarLoop]: Abstraction has 59996 states and 64829 transitions. [2019-11-16 00:26:55,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 59996 states and 64829 transitions. [2019-11-16 00:26:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-16 00:26:55,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:55,823 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:56,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:56,029 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2131780047, now seen corresponding path program 1 times [2019-11-16 00:26:56,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:56,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002679230] [2019-11-16 00:26:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:56,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:26:56,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002679230] [2019-11-16 00:26:56,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:56,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:26:56,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954695794] [2019-11-16 00:26:56,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:56,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:56,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:56,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:56,297 INFO L87 Difference]: Start difference. First operand 59996 states and 64829 transitions. Second operand 4 states. [2019-11-16 00:26:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:57,550 INFO L93 Difference]: Finished difference Result 120811 states and 130534 transitions. [2019-11-16 00:26:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:57,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-11-16 00:26:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:57,603 INFO L225 Difference]: With dead ends: 120811 [2019-11-16 00:26:57,603 INFO L226 Difference]: Without dead ends: 60817 [2019-11-16 00:26:57,626 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-16 00:26:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60817 states. [2019-11-16 00:26:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60817 to 60402. [2019-11-16 00:26:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60402 states. [2019-11-16 00:26:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60402 states to 60402 states and 65126 transitions. [2019-11-16 00:26:58,175 INFO L78 Accepts]: Start accepts. Automaton has 60402 states and 65126 transitions. Word has length 393 [2019-11-16 00:26:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:58,176 INFO L462 AbstractCegarLoop]: Abstraction has 60402 states and 65126 transitions. [2019-11-16 00:26:58,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 60402 states and 65126 transitions. [2019-11-16 00:26:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-11-16 00:26:58,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:58,199 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:58,199 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1185805506, now seen corresponding path program 1 times [2019-11-16 00:26:58,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:58,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121717533] [2019-11-16 00:26:58,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-16 00:26:58,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121717533] [2019-11-16 00:26:58,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:58,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:58,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431746521] [2019-11-16 00:26:58,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:58,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:58,396 INFO L87 Difference]: Start difference. First operand 60402 states and 65126 transitions. Second operand 4 states. [2019-11-16 00:27:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:00,012 INFO L93 Difference]: Finished difference Result 174240 states and 187140 transitions. [2019-11-16 00:27:00,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:00,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2019-11-16 00:27:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:00,109 INFO L225 Difference]: With dead ends: 174240 [2019-11-16 00:27:00,109 INFO L226 Difference]: Without dead ends: 113840 [2019-11-16 00:27:00,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113840 states. [2019-11-16 00:27:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113840 to 110991. [2019-11-16 00:27:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110991 states. [2019-11-16 00:27:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110991 states to 110991 states and 119044 transitions. [2019-11-16 00:27:01,156 INFO L78 Accepts]: Start accepts. Automaton has 110991 states and 119044 transitions. Word has length 398 [2019-11-16 00:27:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:01,156 INFO L462 AbstractCegarLoop]: Abstraction has 110991 states and 119044 transitions. [2019-11-16 00:27:01,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 110991 states and 119044 transitions. [2019-11-16 00:27:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-16 00:27:01,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:01,185 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:01,185 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1884846633, now seen corresponding path program 1 times [2019-11-16 00:27:01,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:01,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105423107] [2019-11-16 00:27:01,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:01,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:01,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-16 00:27:01,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105423107] [2019-11-16 00:27:01,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:01,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:01,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337707113] [2019-11-16 00:27:01,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:01,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:01,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:01,508 INFO L87 Difference]: Start difference. First operand 110991 states and 119044 transitions. Second operand 4 states. [2019-11-16 00:27:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:03,578 INFO L93 Difference]: Finished difference Result 395001 states and 423842 transitions. [2019-11-16 00:27:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:03,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-11-16 00:27:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:03,865 INFO L225 Difference]: With dead ends: 395001 [2019-11-16 00:27:03,865 INFO L226 Difference]: Without dead ends: 284215 [2019-11-16 00:27:03,918 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-16 00:27:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284215 states. [2019-11-16 00:27:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284215 to 180540. [2019-11-16 00:27:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180540 states. [2019-11-16 00:27:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180540 states to 180540 states and 193677 transitions. [2019-11-16 00:27:06,067 INFO L78 Accepts]: Start accepts. Automaton has 180540 states and 193677 transitions. Word has length 400 [2019-11-16 00:27:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:06,067 INFO L462 AbstractCegarLoop]: Abstraction has 180540 states and 193677 transitions. [2019-11-16 00:27:06,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 180540 states and 193677 transitions. [2019-11-16 00:27:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-16 00:27:06,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:06,094 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:06,094 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash -792061351, now seen corresponding path program 1 times [2019-11-16 00:27:06,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:06,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593790487] [2019-11-16 00:27:06,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-16 00:27:07,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593790487] [2019-11-16 00:27:07,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:07,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:27:07,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384425031] [2019-11-16 00:27:07,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:27:07,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:07,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:27:07,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:07,061 INFO L87 Difference]: Start difference. First operand 180540 states and 193677 transitions. Second operand 5 states. [2019-11-16 00:27:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:09,045 INFO L93 Difference]: Finished difference Result 382430 states and 409891 transitions. [2019-11-16 00:27:09,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:27:09,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 400 [2019-11-16 00:27:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:09,264 INFO L225 Difference]: With dead ends: 382430 [2019-11-16 00:27:09,265 INFO L226 Difference]: Without dead ends: 202095 [2019-11-16 00:27:09,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202095 states. [2019-11-16 00:27:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202095 to 188071. [2019-11-16 00:27:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188071 states. [2019-11-16 00:27:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188071 states to 188071 states and 201564 transitions. [2019-11-16 00:27:11,269 INFO L78 Accepts]: Start accepts. Automaton has 188071 states and 201564 transitions. Word has length 400 [2019-11-16 00:27:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:11,269 INFO L462 AbstractCegarLoop]: Abstraction has 188071 states and 201564 transitions. [2019-11-16 00:27:11,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:27:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 188071 states and 201564 transitions. [2019-11-16 00:27:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-11-16 00:27:11,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:11,299 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:11,300 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1777016498, now seen corresponding path program 1 times [2019-11-16 00:27:11,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607359875] [2019-11-16 00:27:11,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 262 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:16,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607359875] [2019-11-16 00:27:16,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758999631] [2019-11-16 00:27:16,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:27:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:16,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:16,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-16 00:27:16,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:16,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-11-16 00:27:16,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557965104] [2019-11-16 00:27:16,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:16,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:27:16,702 INFO L87 Difference]: Start difference. First operand 188071 states and 201564 transitions. Second operand 4 states. [2019-11-16 00:27:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:18,133 INFO L93 Difference]: Finished difference Result 382447 states and 409567 transitions. [2019-11-16 00:27:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:18,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2019-11-16 00:27:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:18,309 INFO L225 Difference]: With dead ends: 382447 [2019-11-16 00:27:18,309 INFO L226 Difference]: Without dead ends: 194378 [2019-11-16 00:27:18,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:27:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194378 states. [2019-11-16 00:27:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194378 to 175891. [2019-11-16 00:27:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-11-16 00:27:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188982 transitions. [2019-11-16 00:27:21,005 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188982 transitions. Word has length 415 [2019-11-16 00:27:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:21,006 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188982 transitions. [2019-11-16 00:27:21,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188982 transitions. [2019-11-16 00:27:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-16 00:27:21,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:21,037 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:21,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:21,239 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1842609697, now seen corresponding path program 1 times [2019-11-16 00:27:21,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:21,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563393678] [2019-11-16 00:27:21,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:21,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 251 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:27:21,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563393678] [2019-11-16 00:27:21,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945464981] [2019-11-16 00:27:21,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:27:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:21,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:27:21,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-16 00:27:21,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:21,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:27:21,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893202158] [2019-11-16 00:27:21,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:21,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:27:21,927 INFO L87 Difference]: Start difference. First operand 175891 states and 188982 transitions. Second operand 4 states. [2019-11-16 00:27:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:23,342 INFO L93 Difference]: Finished difference Result 351785 states and 377967 transitions. [2019-11-16 00:27:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:23,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-11-16 00:27:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:23,515 INFO L225 Difference]: With dead ends: 351785 [2019-11-16 00:27:23,515 INFO L226 Difference]: Without dead ends: 175896 [2019-11-16 00:27:23,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:27:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175896 states. [2019-11-16 00:27:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175896 to 175891. [2019-11-16 00:27:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-11-16 00:27:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188154 transitions. [2019-11-16 00:27:25,326 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188154 transitions. Word has length 419 [2019-11-16 00:27:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:25,326 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188154 transitions. [2019-11-16 00:27:25,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188154 transitions. [2019-11-16 00:27:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-16 00:27:25,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:25,355 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:25,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:25,556 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash -87735325, now seen corresponding path program 1 times [2019-11-16 00:27:25,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:25,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047434448] [2019-11-16 00:27:25,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:25,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:25,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-16 00:27:25,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047434448] [2019-11-16 00:27:25,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:25,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:25,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473375609] [2019-11-16 00:27:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:25,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:25,883 INFO L87 Difference]: Start difference. First operand 175891 states and 188154 transitions. Second operand 3 states. [2019-11-16 00:27:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:27,740 INFO L93 Difference]: Finished difference Result 401820 states and 429533 transitions. [2019-11-16 00:27:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:27,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-16 00:27:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:27,967 INFO L225 Difference]: With dead ends: 401820 [2019-11-16 00:27:27,967 INFO L226 Difference]: Without dead ends: 225931 [2019-11-16 00:27:28,039 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-16 00:27:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225931 states. [2019-11-16 00:27:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225931 to 225931. [2019-11-16 00:27:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225931 states. [2019-11-16 00:27:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225931 states to 225931 states and 241286 transitions. [2019-11-16 00:27:30,441 INFO L78 Accepts]: Start accepts. Automaton has 225931 states and 241286 transitions. Word has length 421 [2019-11-16 00:27:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:30,442 INFO L462 AbstractCegarLoop]: Abstraction has 225931 states and 241286 transitions. [2019-11-16 00:27:30,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 225931 states and 241286 transitions. [2019-11-16 00:27:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-16 00:27:30,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:30,471 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:30,471 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash 866542192, now seen corresponding path program 1 times [2019-11-16 00:27:30,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:30,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226072451] [2019-11-16 00:27:30,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:30,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:30,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-16 00:27:30,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226072451] [2019-11-16 00:27:30,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:30,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:30,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481357038] [2019-11-16 00:27:30,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:30,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:30,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:30,753 INFO L87 Difference]: Start difference. First operand 225931 states and 241286 transitions. Second operand 4 states. [2019-11-16 00:27:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:33,012 INFO L93 Difference]: Finished difference Result 451050 states and 481735 transitions. [2019-11-16 00:27:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:33,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-16 00:27:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:33,232 INFO L225 Difference]: With dead ends: 451050 [2019-11-16 00:27:33,232 INFO L226 Difference]: Without dead ends: 225121 [2019-11-16 00:27:33,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225121 states. [2019-11-16 00:27:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225121 to 225119. [2019-11-16 00:27:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225119 states. [2019-11-16 00:27:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225119 states to 225119 states and 240368 transitions. [2019-11-16 00:27:35,614 INFO L78 Accepts]: Start accepts. Automaton has 225119 states and 240368 transitions. Word has length 441 [2019-11-16 00:27:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 225119 states and 240368 transitions. [2019-11-16 00:27:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 225119 states and 240368 transitions. [2019-11-16 00:27:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-16 00:27:35,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:35,645 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:35,646 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 830855433, now seen corresponding path program 1 times [2019-11-16 00:27:35,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:35,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936684693] [2019-11-16 00:27:35,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:35,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:35,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:27:35,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936684693] [2019-11-16 00:27:35,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:35,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:27:35,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774618180] [2019-11-16 00:27:35,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:27:35,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:27:35,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:35,946 INFO L87 Difference]: Start difference. First operand 225119 states and 240368 transitions. Second operand 5 states. [2019-11-16 00:27:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:38,803 INFO L93 Difference]: Finished difference Result 565497 states and 602551 transitions. [2019-11-16 00:27:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:27:38,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 469 [2019-11-16 00:27:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:39,141 INFO L225 Difference]: With dead ends: 565497 [2019-11-16 00:27:39,141 INFO L226 Difference]: Without dead ends: 340380 [2019-11-16 00:27:39,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340380 states. [2019-11-16 00:27:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340380 to 317003. [2019-11-16 00:27:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317003 states. [2019-11-16 00:27:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317003 states to 317003 states and 338013 transitions. [2019-11-16 00:27:43,870 INFO L78 Accepts]: Start accepts. Automaton has 317003 states and 338013 transitions. Word has length 469 [2019-11-16 00:27:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:43,871 INFO L462 AbstractCegarLoop]: Abstraction has 317003 states and 338013 transitions. [2019-11-16 00:27:43,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:27:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 317003 states and 338013 transitions. [2019-11-16 00:27:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-11-16 00:27:43,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:43,911 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:43,911 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 777925708, now seen corresponding path program 1 times [2019-11-16 00:27:43,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:43,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121786100] [2019-11-16 00:27:43,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:43,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:43,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 308 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:27:44,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121786100] [2019-11-16 00:27:44,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461591689] [2019-11-16 00:27:44,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:27:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:44,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:27:44,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-16 00:27:44,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:44,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:27:44,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832408452] [2019-11-16 00:27:44,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:44,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:44,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:44,856 INFO L87 Difference]: Start difference. First operand 317003 states and 338013 transitions. Second operand 4 states. [2019-11-16 00:27:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:47,266 INFO L93 Difference]: Finished difference Result 613865 states and 654416 transitions. [2019-11-16 00:27:47,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:47,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2019-11-16 00:27:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:47,580 INFO L225 Difference]: With dead ends: 613865 [2019-11-16 00:27:47,580 INFO L226 Difference]: Without dead ends: 296864 [2019-11-16 00:27:47,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296864 states. [2019-11-16 00:27:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296864 to 256644. [2019-11-16 00:27:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256644 states. [2019-11-16 00:27:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256644 states to 256644 states and 273489 transitions. [2019-11-16 00:27:57,135 INFO L78 Accepts]: Start accepts. Automaton has 256644 states and 273489 transitions. Word has length 472 [2019-11-16 00:27:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:57,136 INFO L462 AbstractCegarLoop]: Abstraction has 256644 states and 273489 transitions. [2019-11-16 00:27:57,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 256644 states and 273489 transitions. [2019-11-16 00:27:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-11-16 00:27:57,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:57,169 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:27:57,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:57,371 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1916997917, now seen corresponding path program 1 times [2019-11-16 00:27:57,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:57,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688770300] [2019-11-16 00:27:57,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:57,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:57,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-16 00:27:57,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688770300] [2019-11-16 00:27:57,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:57,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:57,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029886995] [2019-11-16 00:27:57,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:57,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:57,702 INFO L87 Difference]: Start difference. First operand 256644 states and 273489 transitions. Second operand 3 states. [2019-11-16 00:28:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:00,426 INFO L93 Difference]: Finished difference Result 566958 states and 603112 transitions. [2019-11-16 00:28:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:00,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-11-16 00:28:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:00,733 INFO L225 Difference]: With dead ends: 566958 [2019-11-16 00:28:00,733 INFO L226 Difference]: Without dead ends: 310316 [2019-11-16 00:28:00,809 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-16 00:28:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310316 states. [2019-11-16 00:28:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310316 to 300166. [2019-11-16 00:28:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300166 states. [2019-11-16 00:28:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300166 states to 300166 states and 318293 transitions. [2019-11-16 00:28:05,142 INFO L78 Accepts]: Start accepts. Automaton has 300166 states and 318293 transitions. Word has length 491 [2019-11-16 00:28:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:05,143 INFO L462 AbstractCegarLoop]: Abstraction has 300166 states and 318293 transitions. [2019-11-16 00:28:05,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 300166 states and 318293 transitions. [2019-11-16 00:28:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-16 00:28:05,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:05,174 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:05,174 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash -184571190, now seen corresponding path program 1 times [2019-11-16 00:28:05,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:05,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986674251] [2019-11-16 00:28:05,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:05,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:05,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 445 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:28:06,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986674251] [2019-11-16 00:28:06,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138157488] [2019-11-16 00:28:06,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/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-16 00:28:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:06,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:28:06,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:06,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 498 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:28:07,036 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:07,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-16 00:28:07,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389513342] [2019-11-16 00:28:07,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:28:07,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:28:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:28:07,038 INFO L87 Difference]: Start difference. First operand 300166 states and 318293 transitions. Second operand 11 states. [2019-11-16 00:28:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:12,967 INFO L93 Difference]: Finished difference Result 659315 states and 699128 transitions. [2019-11-16 00:28:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:28:12,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 511 [2019-11-16 00:28:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:13,308 INFO L225 Difference]: With dead ends: 659315 [2019-11-16 00:28:13,308 INFO L226 Difference]: Without dead ends: 359151 [2019-11-16 00:28:13,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:28:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359151 states. [2019-11-16 00:28:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359151 to 300777. [2019-11-16 00:28:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300777 states. [2019-11-16 00:28:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300777 states to 300777 states and 318938 transitions. [2019-11-16 00:28:23,205 INFO L78 Accepts]: Start accepts. Automaton has 300777 states and 318938 transitions. Word has length 511 [2019-11-16 00:28:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:23,205 INFO L462 AbstractCegarLoop]: Abstraction has 300777 states and 318938 transitions. [2019-11-16 00:28:23,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:28:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 300777 states and 318938 transitions. [2019-11-16 00:28:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-16 00:28:23,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:23,245 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:23,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:23,446 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash 377478072, now seen corresponding path program 1 times [2019-11-16 00:28:23,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:23,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566184774] [2019-11-16 00:28:23,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:23,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:23,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-16 00:28:23,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566184774] [2019-11-16 00:28:23,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:23,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:23,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938683898] [2019-11-16 00:28:23,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:23,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:23,760 INFO L87 Difference]: Start difference. First operand 300777 states and 318938 transitions. Second operand 3 states. [2019-11-16 00:28:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:26,203 INFO L93 Difference]: Finished difference Result 530151 states and 562178 transitions. [2019-11-16 00:28:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:26,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-16 00:28:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:26,412 INFO L225 Difference]: With dead ends: 530151 [2019-11-16 00:28:26,412 INFO L226 Difference]: Without dead ends: 229175 [2019-11-16 00:28:26,489 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-16 00:28:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229175 states. [2019-11-16 00:28:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229175 to 183819. [2019-11-16 00:28:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183819 states. [2019-11-16 00:28:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183819 states to 183819 states and 193436 transitions. [2019-11-16 00:28:28,711 INFO L78 Accepts]: Start accepts. Automaton has 183819 states and 193436 transitions. Word has length 524 [2019-11-16 00:28:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:28,711 INFO L462 AbstractCegarLoop]: Abstraction has 183819 states and 193436 transitions. [2019-11-16 00:28:28,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 183819 states and 193436 transitions. [2019-11-16 00:28:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-16 00:28:28,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:28,727 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:28,727 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1806755140, now seen corresponding path program 1 times [2019-11-16 00:28:28,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:28,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998272490] [2019-11-16 00:28:28,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:28,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:28,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 464 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:28:30,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998272490] [2019-11-16 00:28:30,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141942650] [2019-11-16 00:28:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:30,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:28:30,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-11-16 00:28:31,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:31,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-16 00:28:31,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448103618] [2019-11-16 00:28:31,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:31,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:28:31,242 INFO L87 Difference]: Start difference. First operand 183819 states and 193436 transitions. Second operand 4 states. [2019-11-16 00:28:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:32,775 INFO L93 Difference]: Finished difference Result 318817 states and 335360 transitions. [2019-11-16 00:28:32,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:32,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-11-16 00:28:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:32,891 INFO L225 Difference]: With dead ends: 318817 [2019-11-16 00:28:32,891 INFO L226 Difference]: Without dead ends: 135611 [2019-11-16 00:28:32,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:28:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135611 states. [2019-11-16 00:28:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135611 to 126022. [2019-11-16 00:28:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126022 states. [2019-11-16 00:28:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126022 states to 126022 states and 132073 transitions. [2019-11-16 00:28:34,940 INFO L78 Accepts]: Start accepts. Automaton has 126022 states and 132073 transitions. Word has length 528 [2019-11-16 00:28:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:34,941 INFO L462 AbstractCegarLoop]: Abstraction has 126022 states and 132073 transitions. [2019-11-16 00:28:34,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 126022 states and 132073 transitions. [2019-11-16 00:28:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-11-16 00:28:34,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:34,955 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:35,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:35,158 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 805635785, now seen corresponding path program 1 times [2019-11-16 00:28:35,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:35,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328563589] [2019-11-16 00:28:35,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 553 proven. 136 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-16 00:28:36,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328563589] [2019-11-16 00:28:36,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798351417] [2019-11-16 00:28:36,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:28:37,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-16 00:28:37,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:37,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-16 00:28:37,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663765268] [2019-11-16 00:28:37,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:37,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:28:37,379 INFO L87 Difference]: Start difference. First operand 126022 states and 132073 transitions. Second operand 4 states. [2019-11-16 00:28:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:38,583 INFO L93 Difference]: Finished difference Result 159149 states and 166565 transitions. [2019-11-16 00:28:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:38,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2019-11-16 00:28:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:38,597 INFO L225 Difference]: With dead ends: 159149 [2019-11-16 00:28:38,597 INFO L226 Difference]: Without dead ends: 17094 [2019-11-16 00:28:38,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:28:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2019-11-16 00:28:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 7939. [2019-11-16 00:28:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7939 states. [2019-11-16 00:28:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 8213 transitions. [2019-11-16 00:28:38,733 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 8213 transitions. Word has length 552 [2019-11-16 00:28:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:38,733 INFO L462 AbstractCegarLoop]: Abstraction has 7939 states and 8213 transitions. [2019-11-16 00:28:38,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 8213 transitions. [2019-11-16 00:28:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-16 00:28:38,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:38,740 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:38,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:38,940 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1566727996, now seen corresponding path program 1 times [2019-11-16 00:28:38,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:38,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083381942] [2019-11-16 00:28:38,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:38,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:38,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 28 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-11-16 00:28:39,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083381942] [2019-11-16 00:28:39,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245859729] [2019-11-16 00:28:39,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:39,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:39,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-11-16 00:28:40,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:40,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-16 00:28:40,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759799683] [2019-11-16 00:28:40,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:40,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:40,068 INFO L87 Difference]: Start difference. First operand 7939 states and 8213 transitions. Second operand 3 states. [2019-11-16 00:28:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:40,292 INFO L93 Difference]: Finished difference Result 21368 states and 22139 transitions. [2019-11-16 00:28:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:40,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2019-11-16 00:28:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:40,301 INFO L225 Difference]: With dead ends: 21368 [2019-11-16 00:28:40,301 INFO L226 Difference]: Without dead ends: 14042 [2019-11-16 00:28:40,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 603 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-16 00:28:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-11-16 00:28:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 12824. [2019-11-16 00:28:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12824 states. [2019-11-16 00:28:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12824 states to 12824 states and 13323 transitions. [2019-11-16 00:28:40,427 INFO L78 Accepts]: Start accepts. Automaton has 12824 states and 13323 transitions. Word has length 603 [2019-11-16 00:28:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:40,427 INFO L462 AbstractCegarLoop]: Abstraction has 12824 states and 13323 transitions. [2019-11-16 00:28:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12824 states and 13323 transitions. [2019-11-16 00:28:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-11-16 00:28:40,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:40,436 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:40,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:40,637 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1078339668, now seen corresponding path program 1 times [2019-11-16 00:28:40,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:40,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886049950] [2019-11-16 00:28:40,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 964 proven. 379 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-16 00:28:42,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886049950] [2019-11-16 00:28:42,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051896163] [2019-11-16 00:28:42,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:43,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:28:43,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-16 00:28:43,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:28:43,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-16 00:28:43,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593578092] [2019-11-16 00:28:43,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:28:43,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:28:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:43,590 INFO L87 Difference]: Start difference. First operand 12824 states and 13323 transitions. Second operand 5 states. [2019-11-16 00:28:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:44,492 INFO L93 Difference]: Finished difference Result 45175 states and 46981 transitions. [2019-11-16 00:28:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:44,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 692 [2019-11-16 00:28:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:44,514 INFO L225 Difference]: With dead ends: 45175 [2019-11-16 00:28:44,514 INFO L226 Difference]: Without dead ends: 32558 [2019-11-16 00:28:44,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 689 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32558 states. [2019-11-16 00:28:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32558 to 31740. [2019-11-16 00:28:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-16 00:28:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33041 transitions. [2019-11-16 00:28:44,839 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33041 transitions. Word has length 692 [2019-11-16 00:28:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:44,839 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33041 transitions. [2019-11-16 00:28:44,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:28:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33041 transitions. [2019-11-16 00:28:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-11-16 00:28:44,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:44,864 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:45,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:45,065 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash -186732457, now seen corresponding path program 1 times [2019-11-16 00:28:45,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:45,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861996379] [2019-11-16 00:28:45,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:45,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:45,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2966 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-11-16 00:28:45,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861996379] [2019-11-16 00:28:45,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:45,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:45,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117740698] [2019-11-16 00:28:45,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:45,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:45,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:45,750 INFO L87 Difference]: Start difference. First operand 31740 states and 33041 transitions. Second operand 3 states. [2019-11-16 00:28:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:46,533 INFO L93 Difference]: Finished difference Result 74284 states and 77363 transitions. [2019-11-16 00:28:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:46,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 961 [2019-11-16 00:28:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:46,561 INFO L225 Difference]: With dead ends: 74284 [2019-11-16 00:28:46,561 INFO L226 Difference]: Without dead ends: 43157 [2019-11-16 00:28:46,573 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-16 00:28:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43157 states. [2019-11-16 00:28:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43157 to 31740. [2019-11-16 00:28:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-16 00:28:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33040 transitions. [2019-11-16 00:28:46,930 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33040 transitions. Word has length 961 [2019-11-16 00:28:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:46,931 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33040 transitions. [2019-11-16 00:28:46,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33040 transitions. [2019-11-16 00:28:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2019-11-16 00:28:46,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:46,953 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:46,954 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1569597196, now seen corresponding path program 1 times [2019-11-16 00:28:46,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:46,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869510921] [2019-11-16 00:28:46,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:46,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:46,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3028 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-11-16 00:28:49,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869510921] [2019-11-16 00:28:49,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:49,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:28:49,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561091292] [2019-11-16 00:28:49,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:28:49,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:28:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:28:49,247 INFO L87 Difference]: Start difference. First operand 31740 states and 33040 transitions. Second operand 11 states. [2019-11-16 00:28:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:51,874 INFO L93 Difference]: Finished difference Result 79612 states and 82735 transitions. [2019-11-16 00:28:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:28:51,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 968 [2019-11-16 00:28:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:51,904 INFO L225 Difference]: With dead ends: 79612 [2019-11-16 00:28:51,904 INFO L226 Difference]: Without dead ends: 48485 [2019-11-16 00:28:51,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48485 states. [2019-11-16 00:28:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48485 to 31740. [2019-11-16 00:28:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-16 00:28:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33039 transitions. [2019-11-16 00:28:52,319 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33039 transitions. Word has length 968 [2019-11-16 00:28:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:52,319 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33039 transitions. [2019-11-16 00:28:52,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:28:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33039 transitions. [2019-11-16 00:28:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-11-16 00:28:52,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:52,344 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:52,344 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:52,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1995304239, now seen corresponding path program 1 times [2019-11-16 00:28:52,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:52,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696934279] [2019-11-16 00:28:52,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:52,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:52,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2242 proven. 0 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2019-11-16 00:28:53,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696934279] [2019-11-16 00:28:53,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:53,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:53,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889684630] [2019-11-16 00:28:53,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:53,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:53,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:53,161 INFO L87 Difference]: Start difference. First operand 31740 states and 33039 transitions. Second operand 4 states. [2019-11-16 00:28:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:53,583 INFO L93 Difference]: Finished difference Result 74266 states and 77196 transitions. [2019-11-16 00:28:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:53,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1063 [2019-11-16 00:28:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:53,612 INFO L225 Difference]: With dead ends: 74266 [2019-11-16 00:28:53,612 INFO L226 Difference]: Without dead ends: 43139 [2019-11-16 00:28:53,625 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-16 00:28:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43139 states. [2019-11-16 00:28:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43139 to 41515. [2019-11-16 00:28:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41515 states. [2019-11-16 00:28:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41515 states to 41515 states and 43032 transitions. [2019-11-16 00:28:54,159 INFO L78 Accepts]: Start accepts. Automaton has 41515 states and 43032 transitions. Word has length 1063 [2019-11-16 00:28:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:54,159 INFO L462 AbstractCegarLoop]: Abstraction has 41515 states and 43032 transitions. [2019-11-16 00:28:54,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41515 states and 43032 transitions. [2019-11-16 00:28:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-11-16 00:28:54,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:54,188 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:54,188 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 147166229, now seen corresponding path program 1 times [2019-11-16 00:28:54,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:54,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551352357] [2019-11-16 00:28:54,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:54,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:54,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4222 backedges. 2011 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-11-16 00:28:55,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551352357] [2019-11-16 00:28:55,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:55,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:55,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116413812] [2019-11-16 00:28:55,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:55,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:55,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:55,548 INFO L87 Difference]: Start difference. First operand 41515 states and 43032 transitions. Second operand 3 states. [2019-11-16 00:28:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:55,936 INFO L93 Difference]: Finished difference Result 57176 states and 59348 transitions. [2019-11-16 00:28:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:55,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1108 [2019-11-16 00:28:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:55,937 INFO L225 Difference]: With dead ends: 57176 [2019-11-16 00:28:55,937 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:28:55,952 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-16 00:28:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:28:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:28:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:28:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:28:55,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-11-16 00:28:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:55,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:55,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:28:55,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:28:55,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:29:07,366 WARN L191 SmtUtils]: Spent 11.38 s on a formula simplification. DAG size of input: 2736 DAG size of output: 2147 [2019-11-16 00:29:16,942 WARN L191 SmtUtils]: Spent 9.57 s on a formula simplification. DAG size of input: 2736 DAG size of output: 2147 [2019-11-16 00:29:48,682 WARN L191 SmtUtils]: Spent 31.72 s on a formula simplification. DAG size of input: 1955 DAG size of output: 294 [2019-11-16 00:30:22,154 WARN L191 SmtUtils]: Spent 33.46 s on a formula simplification. DAG size of input: 1955 DAG size of output: 294 [2019-11-16 00:30:22,156 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:30:22,156 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,157 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,158 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-16 00:30:22,159 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,160 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-16 00:30:22,161 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,162 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,163 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,164 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:30:22,165 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,166 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,168 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse21 (= ~a12~0 1))) (let ((.cse24 (not .cse21)) (.cse29 (not (= 1 ~a11~0)))) (let ((.cse16 (and .cse24 .cse29)) (.cse15 (= 1 ~a3~0)) (.cse28 (<= ~a3~0 0)) (.cse20 (= ~a27~0 1)) (.cse5 (= 1 ~a6~0)) (.cse14 (= ~a5~0 1)) (.cse8 (= ~a26~0 1)) (.cse30 (= 1 ~a8~0)) (.cse23 (= ~a11~0 1))) (let ((.cse32 (or .cse30 .cse23)) (.cse33 (<= ~a7~0 0)) (.cse34 (not .cse30)) (.cse31 (= ~a4~0 1)) (.cse27 (<= ~a23~0 0)) (.cse25 (or (and .cse20 .cse15 .cse5 .cse21 .cse14 .cse8 .cse29) (and .cse28 .cse20 .cse5 .cse21 .cse14 .cse8 .cse29))) (.cse6 (not .cse23)) (.cse35 (and .cse28 .cse16 .cse5 .cse14 .cse8)) (.cse0 (= ~a15~0 1)) (.cse17 (= ~a12~0 ~a6~0)) (.cse4 (<= 2 ~a3~0)) (.cse19 (= 1 ~a5~0)) (.cse1 (<= ~a20~0 0)) (.cse13 (= ~a1~0 1)) (.cse22 (= 0 ~a3~0)) (.cse2 (not (= ~a7~0 1))) (.cse18 (<= ~a6~0 0)) (.cse7 (= ~a16~0 1)) (.cse9 (<= ~a27~0 0)) (.cse12 (= 1 ~a0~0)) (.cse3 (= ~a18~0 1)) (.cse11 (= 1 ~a22~0)) (.cse26 (<= ~a26~0 0)) (.cse10 (= ~a29~0 1))) (or (and (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13 .cse14) (and (and .cse2 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse5 .cse14 .cse10 .cse11) (and .cse13 (and (or (and (and .cse17 (and .cse2 .cse18 .cse3 .cse15 .cse7 .cse8 .cse0 .cse9) .cse10 .cse11 .cse12) .cse19) (and .cse20 .cse8 (or (and .cse2 .cse18 .cse3 .cse15 .cse21 .cse14 .cse10 .cse11 .cse7 .cse12) (and .cse21 .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse18 .cse3 .cse14 .cse7)))) (and (and .cse3 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8) .cse19 .cse22 .cse11 .cse12) (and (and .cse17 (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse8 .cse7 .cse0) .cse19 .cse10 .cse12) .cse23) (and .cse3 .cse22 .cse14 .cse7 .cse0 .cse9 .cse17 .cse2 .cse18 .cse10 .cse23 .cse8 .cse12)) .cse1)) (and (and (and .cse20 (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1) .cse13 .cse14) (and .cse3 .cse25 .cse11 .cse0) (and (and (and (and (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse20 .cse26 .cse7 .cse0) .cse10 .cse12) .cse23) .cse1) .cse13 .cse14) (and .cse8 (and .cse5 (and (and (and .cse3 .cse20 .cse16 .cse14 .cse10 .cse7) (<= ~a3~0 1)) .cse11 .cse12))) (and .cse13 (or (and (and .cse10 (and .cse2 .cse18 .cse3 .cse15 .cse16 .cse7 .cse8 .cse0 .cse9)) .cse19) (and .cse2 (and .cse18 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse14 .cse10 .cse11)) .cse1) (and .cse3 .cse22 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse21 .cse13 .cse10 .cse23 .cse8 .cse12 .cse1) (and .cse13 .cse0 (and .cse19 (and .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse26 .cse7) .cse10 .cse11 .cse12) .cse27 .cse1) (and (and .cse28 .cse2 .cse3 .cse20 .cse5 .cse21 .cse14 .cse7) .cse23 .cse8) (and .cse28 .cse2 .cse18 .cse3 .cse21 .cse26 .cse14 .cse29 .cse9) (and .cse20 (and .cse22 (and .cse10 (and .cse2 .cse18 .cse3 .cse16 .cse14 .cse26 .cse7 .cse0)) .cse11 .cse12)) (and .cse13 (and (and (and .cse2 (and .cse24 .cse3 .cse4 .cse5 (not .cse20) .cse14 .cse8 .cse0)) .cse10 .cse12) .cse7 .cse27 .cse1)) (or (and (and .cse2 .cse3 .cse20 .cse5 .cse14 .cse10 .cse7 .cse8) .cse22 .cse12) (and .cse3 .cse25 .cse22 .cse10 .cse7 .cse11 .cse12)) (and .cse13 (or (and .cse19 .cse20 (and .cse21 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse6 .cse7 .cse0)) .cse8) (and .cse29 .cse3 .cse19 .cse7 .cse11 .cse2 .cse18 .cse20 .cse21 .cse10 .cse12 .cse8)) .cse1) (and .cse10 (and .cse2 .cse3 .cse15 .cse5 .cse16 .cse14 .cse7 .cse8 .cse0 .cse9)) (and (and .cse8 (and .cse21 (and (and .cse29 .cse2 .cse18 .cse3 .cse20 .cse15) .cse10) .cse14 .cse12)) .cse13 .cse1) (and .cse23 (and .cse22 .cse10 .cse12 (and .cse24 .cse2 .cse18 .cse3 .cse20 .cse26 .cse14 .cse7))) (and (and .cse28 .cse2 .cse18 .cse3 .cse20 .cse6 .cse10 .cse8 .cse0) .cse21 .cse14 .cse12) (and (and (and (or (and .cse18 .cse3 .cse15 .cse21 .cse8 .cse11 .cse7 .cse9) (and .cse28 .cse18 .cse3 .cse21 .cse8 .cse7 .cse11 (or .cse30 (and .cse31 .cse10 .cse0)) .cse9)) .cse23) .cse1) .cse13 .cse14) (and (and .cse20 .cse23 .cse27 (and .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse26 .cse14 .cse7 .cse0))) .cse13) (and .cse32 (and (and .cse3 .cse25 .cse0) .cse2 .cse22 .cse12)) (and (and .cse2 .cse3 .cse25 .cse7 .cse0) .cse22 .cse12) (and .cse5 (and .cse3 .cse20 .cse15 .cse16 .cse10 .cse14 .cse8 .cse11 .cse12)) (and (and (and .cse2 .cse18 .cse3 .cse4 .cse20 .cse7) .cse10 .cse11 .cse12) .cse13 .cse23 .cse14 .cse8 .cse0 .cse1) (and .cse13 (or (and .cse23 (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse10 .cse8 .cse12)) (and (and .cse24 .cse2 .cse3 .cse15 .cse5 .cse14 .cse8 .cse7 .cse0 .cse9) .cse10 .cse12) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse8 .cse0) (and .cse20 .cse8 (and (and .cse2 .cse3 .cse5 .cse14 .cse7 .cse0) .cse10 .cse11 .cse12)) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse11 .cse8)) .cse1) (and (and (and .cse28 .cse24 .cse2 .cse3 .cse20 .cse5 .cse26 .cse7) .cse10) .cse14 .cse12) (and .cse3 .cse14 .cse7 .cse33 .cse17 .cse4 .cse20 .cse21 .cse13 .cse26 .cse10 .cse23 .cse12 .cse1) (and (and .cse11 .cse12 (and (and .cse28 .cse3 .cse16 .cse5 .cse14 .cse0) .cse10)) .cse20 .cse8) (and (and .cse2 .cse32 (and .cse3 .cse15 .cse16) .cse5) .cse19 .cse20 .cse8) (and .cse3 .cse5 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse33 .cse9 .cse21 .cse26 .cse10 .cse12 .cse1) (and .cse23 .cse8 (and .cse5 .cse21 .cse22 .cse14 .cse12 (and .cse2 .cse3 .cse20))) (and (and (and .cse3 .cse5 .cse22 .cse14 .cse11 .cse7 .cse20 .cse10 .cse12 .cse8) .cse1) .cse13) (and (and (and .cse28 .cse2 .cse3 .cse5 .cse21 .cse14 .cse0) .cse10) .cse20 .cse23 .cse8) (and (and (and (and .cse29 .cse28 .cse2 .cse18 .cse3 .cse21 .cse7) .cse10) .cse12) .cse19 .cse20 .cse8) (and .cse3 .cse6 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse4 .cse21 .cse13 .cse26 .cse10 .cse12 .cse1) (and .cse20 (and (and .cse28 .cse2 .cse24 .cse3 .cse5 .cse7) .cse14 .cse10) .cse8) (and (or (and .cse18 .cse3 .cse21 .cse22 .cse10 .cse11 .cse12 .cse29) (and (and .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse21)) .cse22 .cse12)) .cse19 .cse20 .cse8) (and .cse22 .cse12 (and .cse3 .cse14 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8)) (and (and (and (and .cse2 .cse3 .cse20 .cse16 .cse26 .cse7) .cse5 .cse14 .cse10 .cse12) .cse1) .cse13) (and .cse34 .cse31 (and .cse18 .cse3 .cse6 .cse26) .cse14 .cse11 .cse7 .cse0 .cse9 .cse2 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse15 .cse13 .cse24 .cse10 .cse12 .cse27 .cse1) (and .cse3 .cse14 .cse6 .cse11 .cse7 .cse0 .cse9 .cse17 .cse2 .cse15 .cse21 .cse26 .cse10 .cse12 .cse27 .cse1) (and .cse13 (and .cse3 .cse19 .cse7 .cse11 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8 .cse12) .cse1) (and (and (and (and (and .cse2 .cse3 .cse4) .cse5 .cse10 .cse11 .cse12) .cse19 .cse23 .cse8) .cse20 .cse7 .cse1) .cse13) (and .cse13 (and (and .cse34 .cse31 (and .cse12 (and (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse16 .cse14 .cse26 .cse7) .cse10)) .cse11 .cse0) .cse27 .cse1)) (and .cse13 (and (and .cse19 .cse20 (and .cse24 .cse18 .cse3 .cse22 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1)) (and .cse20 (or (and .cse2 .cse5 .cse10 .cse14 (and .cse3 .cse15 .cse16 .cse8)) (and .cse10 (and .cse2 .cse3 .cse35)))) (and (and (and .cse2 .cse3 .cse25 .cse7) .cse10) .cse11 .cse12) (and .cse20 .cse23 (and (and .cse28 .cse24 .cse2 .cse18 .cse3 .cse14 .cse26 .cse10 .cse7 .cse0) .cse12)) (and .cse13 (or (and .cse14 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse5 .cse26) .cse7 .cse0))) (and (and .cse5 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse8) .cse7))) .cse19)) .cse1) (and (and (and .cse3 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8) .cse12) .cse13 .cse14 .cse1) (and .cse3 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse17 .cse18 .cse20 .cse10 .cse8 .cse12) (let ((.cse36 (or (and .cse3 .cse35 .cse7 .cse0 .cse9) (and .cse3 .cse35 .cse20 .cse7 .cse0)))) (or (and (and .cse10 .cse36) .cse22 .cse11 .cse12) (and (and (and .cse2 .cse36) .cse10) .cse22 .cse12))) (and (and (and (and .cse17 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse4 .cse26 .cse7 .cse9)) .cse19 .cse23) .cse1) .cse13) (and .cse21 .cse22 .cse14 .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse7 .cse8 .cse9) .cse11 .cse12) (and .cse3 .cse5 .cse14 .cse11 .cse28 .cse24 .cse20 .cse26 .cse10 .cse23)))))) [2019-11-16 00:30:22,168 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,168 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,168 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,169 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-16 00:30:22,169 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-16 00:30:22,170 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,171 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:30:22,172 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,174 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse21 (= ~a12~0 1))) (let ((.cse24 (not .cse21)) (.cse29 (not (= 1 ~a11~0)))) (let ((.cse16 (and .cse24 .cse29)) (.cse15 (= 1 ~a3~0)) (.cse28 (<= ~a3~0 0)) (.cse20 (= ~a27~0 1)) (.cse5 (= 1 ~a6~0)) (.cse14 (= ~a5~0 1)) (.cse8 (= ~a26~0 1)) (.cse30 (= 1 ~a8~0)) (.cse23 (= ~a11~0 1))) (let ((.cse32 (or .cse30 .cse23)) (.cse33 (<= ~a7~0 0)) (.cse34 (not .cse30)) (.cse31 (= ~a4~0 1)) (.cse27 (<= ~a23~0 0)) (.cse25 (or (and .cse20 .cse15 .cse5 .cse21 .cse14 .cse8 .cse29) (and .cse28 .cse20 .cse5 .cse21 .cse14 .cse8 .cse29))) (.cse6 (not .cse23)) (.cse35 (and .cse28 .cse16 .cse5 .cse14 .cse8)) (.cse0 (= ~a15~0 1)) (.cse17 (= ~a12~0 ~a6~0)) (.cse4 (<= 2 ~a3~0)) (.cse19 (= 1 ~a5~0)) (.cse1 (<= ~a20~0 0)) (.cse13 (= ~a1~0 1)) (.cse22 (= 0 ~a3~0)) (.cse2 (not (= ~a7~0 1))) (.cse18 (<= ~a6~0 0)) (.cse7 (= ~a16~0 1)) (.cse9 (<= ~a27~0 0)) (.cse12 (= 1 ~a0~0)) (.cse3 (= ~a18~0 1)) (.cse11 (= 1 ~a22~0)) (.cse26 (<= ~a26~0 0)) (.cse10 (= ~a29~0 1))) (or (and (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13 .cse14) (and (and .cse2 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse5 .cse14 .cse10 .cse11) (and .cse13 (and (or (and (and .cse17 (and .cse2 .cse18 .cse3 .cse15 .cse7 .cse8 .cse0 .cse9) .cse10 .cse11 .cse12) .cse19) (and .cse20 .cse8 (or (and .cse2 .cse18 .cse3 .cse15 .cse21 .cse14 .cse10 .cse11 .cse7 .cse12) (and .cse21 .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse18 .cse3 .cse14 .cse7)))) (and (and .cse3 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8) .cse19 .cse22 .cse11 .cse12) (and (and .cse17 (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse8 .cse7 .cse0) .cse19 .cse10 .cse12) .cse23) (and .cse3 .cse22 .cse14 .cse7 .cse0 .cse9 .cse17 .cse2 .cse18 .cse10 .cse23 .cse8 .cse12)) .cse1)) (and (and (and .cse20 (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1) .cse13 .cse14) (and .cse3 .cse25 .cse11 .cse0) (and (and (and (and (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse20 .cse26 .cse7 .cse0) .cse10 .cse12) .cse23) .cse1) .cse13 .cse14) (and .cse8 (and .cse5 (and (and (and .cse3 .cse20 .cse16 .cse14 .cse10 .cse7) (<= ~a3~0 1)) .cse11 .cse12))) (and .cse13 (or (and (and .cse10 (and .cse2 .cse18 .cse3 .cse15 .cse16 .cse7 .cse8 .cse0 .cse9)) .cse19) (and .cse2 (and .cse18 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse14 .cse10 .cse11)) .cse1) (and .cse3 .cse22 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse21 .cse13 .cse10 .cse23 .cse8 .cse12 .cse1) (and .cse13 .cse0 (and .cse19 (and .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse26 .cse7) .cse10 .cse11 .cse12) .cse27 .cse1) (and (and .cse28 .cse2 .cse3 .cse20 .cse5 .cse21 .cse14 .cse7) .cse23 .cse8) (and .cse28 .cse2 .cse18 .cse3 .cse21 .cse26 .cse14 .cse29 .cse9) (and .cse20 (and .cse22 (and .cse10 (and .cse2 .cse18 .cse3 .cse16 .cse14 .cse26 .cse7 .cse0)) .cse11 .cse12)) (and .cse13 (and (and (and .cse2 (and .cse24 .cse3 .cse4 .cse5 (not .cse20) .cse14 .cse8 .cse0)) .cse10 .cse12) .cse7 .cse27 .cse1)) (or (and (and .cse2 .cse3 .cse20 .cse5 .cse14 .cse10 .cse7 .cse8) .cse22 .cse12) (and .cse3 .cse25 .cse22 .cse10 .cse7 .cse11 .cse12)) (and .cse13 (or (and .cse19 .cse20 (and .cse21 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse6 .cse7 .cse0)) .cse8) (and .cse29 .cse3 .cse19 .cse7 .cse11 .cse2 .cse18 .cse20 .cse21 .cse10 .cse12 .cse8)) .cse1) (and .cse10 (and .cse2 .cse3 .cse15 .cse5 .cse16 .cse14 .cse7 .cse8 .cse0 .cse9)) (and (and .cse8 (and .cse21 (and (and .cse29 .cse2 .cse18 .cse3 .cse20 .cse15) .cse10) .cse14 .cse12)) .cse13 .cse1) (and .cse23 (and .cse22 .cse10 .cse12 (and .cse24 .cse2 .cse18 .cse3 .cse20 .cse26 .cse14 .cse7))) (and (and .cse28 .cse2 .cse18 .cse3 .cse20 .cse6 .cse10 .cse8 .cse0) .cse21 .cse14 .cse12) (and (and (and (or (and .cse18 .cse3 .cse15 .cse21 .cse8 .cse11 .cse7 .cse9) (and .cse28 .cse18 .cse3 .cse21 .cse8 .cse7 .cse11 (or .cse30 (and .cse31 .cse10 .cse0)) .cse9)) .cse23) .cse1) .cse13 .cse14) (and (and .cse20 .cse23 .cse27 (and .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse26 .cse14 .cse7 .cse0))) .cse13) (and .cse32 (and (and .cse3 .cse25 .cse0) .cse2 .cse22 .cse12)) (and (and .cse2 .cse3 .cse25 .cse7 .cse0) .cse22 .cse12) (and .cse5 (and .cse3 .cse20 .cse15 .cse16 .cse10 .cse14 .cse8 .cse11 .cse12)) (and (and (and .cse2 .cse18 .cse3 .cse4 .cse20 .cse7) .cse10 .cse11 .cse12) .cse13 .cse23 .cse14 .cse8 .cse0 .cse1) (and .cse13 (or (and .cse23 (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse10 .cse8 .cse12)) (and (and .cse24 .cse2 .cse3 .cse15 .cse5 .cse14 .cse8 .cse7 .cse0 .cse9) .cse10 .cse12) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse8 .cse0) (and .cse20 .cse8 (and (and .cse2 .cse3 .cse5 .cse14 .cse7 .cse0) .cse10 .cse11 .cse12)) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse11 .cse8)) .cse1) (and (and (and .cse28 .cse24 .cse2 .cse3 .cse20 .cse5 .cse26 .cse7) .cse10) .cse14 .cse12) (and .cse3 .cse14 .cse7 .cse33 .cse17 .cse4 .cse20 .cse21 .cse13 .cse26 .cse10 .cse23 .cse12 .cse1) (and (and .cse11 .cse12 (and (and .cse28 .cse3 .cse16 .cse5 .cse14 .cse0) .cse10)) .cse20 .cse8) (and (and .cse2 .cse32 (and .cse3 .cse15 .cse16) .cse5) .cse19 .cse20 .cse8) (and .cse3 .cse5 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse33 .cse9 .cse21 .cse26 .cse10 .cse12 .cse1) (and .cse23 .cse8 (and .cse5 .cse21 .cse22 .cse14 .cse12 (and .cse2 .cse3 .cse20))) (and (and (and .cse3 .cse5 .cse22 .cse14 .cse11 .cse7 .cse20 .cse10 .cse12 .cse8) .cse1) .cse13) (and (and (and .cse28 .cse2 .cse3 .cse5 .cse21 .cse14 .cse0) .cse10) .cse20 .cse23 .cse8) (and (and (and (and .cse29 .cse28 .cse2 .cse18 .cse3 .cse21 .cse7) .cse10) .cse12) .cse19 .cse20 .cse8) (and .cse3 .cse6 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse4 .cse21 .cse13 .cse26 .cse10 .cse12 .cse1) (and .cse20 (and (and .cse28 .cse2 .cse24 .cse3 .cse5 .cse7) .cse14 .cse10) .cse8) (and (or (and .cse18 .cse3 .cse21 .cse22 .cse10 .cse11 .cse12 .cse29) (and (and .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse21)) .cse22 .cse12)) .cse19 .cse20 .cse8) (and .cse22 .cse12 (and .cse3 .cse14 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8)) (and (and (and (and .cse2 .cse3 .cse20 .cse16 .cse26 .cse7) .cse5 .cse14 .cse10 .cse12) .cse1) .cse13) (and .cse34 .cse31 (and .cse18 .cse3 .cse6 .cse26) .cse14 .cse11 .cse7 .cse0 .cse9 .cse2 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse15 .cse13 .cse24 .cse10 .cse12 .cse27 .cse1) (and .cse3 .cse14 .cse6 .cse11 .cse7 .cse0 .cse9 .cse17 .cse2 .cse15 .cse21 .cse26 .cse10 .cse12 .cse27 .cse1) (and .cse13 (and .cse3 .cse19 .cse7 .cse11 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8 .cse12) .cse1) (and (and (and (and (and .cse2 .cse3 .cse4) .cse5 .cse10 .cse11 .cse12) .cse19 .cse23 .cse8) .cse20 .cse7 .cse1) .cse13) (and .cse13 (and (and .cse34 .cse31 (and .cse12 (and (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse16 .cse14 .cse26 .cse7) .cse10)) .cse11 .cse0) .cse27 .cse1)) (and .cse13 (and (and .cse19 .cse20 (and .cse24 .cse18 .cse3 .cse22 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1)) (and .cse20 (or (and .cse2 .cse5 .cse10 .cse14 (and .cse3 .cse15 .cse16 .cse8)) (and .cse10 (and .cse2 .cse3 .cse35)))) (and (and (and .cse2 .cse3 .cse25 .cse7) .cse10) .cse11 .cse12) (and .cse20 .cse23 (and (and .cse28 .cse24 .cse2 .cse18 .cse3 .cse14 .cse26 .cse10 .cse7 .cse0) .cse12)) (and .cse13 (or (and .cse14 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse5 .cse26) .cse7 .cse0))) (and (and .cse5 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse8) .cse7))) .cse19)) .cse1) (and (and (and .cse3 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8) .cse12) .cse13 .cse14 .cse1) (and .cse3 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse17 .cse18 .cse20 .cse10 .cse8 .cse12) (let ((.cse36 (or (and .cse3 .cse35 .cse7 .cse0 .cse9) (and .cse3 .cse35 .cse20 .cse7 .cse0)))) (or (and (and .cse10 .cse36) .cse22 .cse11 .cse12) (and (and (and .cse2 .cse36) .cse10) .cse22 .cse12))) (and (and (and (and .cse17 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse4 .cse26 .cse7 .cse9)) .cse19 .cse23) .cse1) .cse13) (and .cse21 .cse22 .cse14 .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse7 .cse8 .cse9) .cse11 .cse12) (and .cse3 .cse5 .cse14 .cse11 .cse28 .cse24 .cse20 .cse26 .cse10 .cse23)))))) [2019-11-16 00:30:22,174 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,174 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,175 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:30:22,176 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,177 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-16 00:30:22,178 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,179 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-16 00:30:22,180 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,181 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:30:22,182 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:30:22,183 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,184 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1566) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:30:22,185 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,186 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,187 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:30:22,188 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,189 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,190 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-16 00:30:22,191 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-16 00:30:22,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:22 BoogieIcfgContainer [2019-11-16 00:30:22,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:30:22,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:30:22,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:30:22,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:30:22,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:23" (3/4) ... [2019-11-16 00:30:22,292 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:30:22,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:30:22,333 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:30:22,582 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_96a52c27-dcd5-46d1-83a4-708706012f96/bin/uautomizer/witness.graphml [2019-11-16 00:30:22,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:30:22,584 INFO L168 Benchmark]: Toolchain (without parser) took 242624.27 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 940.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,584 INFO L168 Benchmark]: CDTParser took 0.23 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-16 00:30:22,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1174.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -119.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,586 INFO L168 Benchmark]: Boogie Preprocessor took 81.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,586 INFO L168 Benchmark]: RCFGBuilder took 2474.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,586 INFO L168 Benchmark]: TraceAbstraction took 238445.34 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,587 INFO L168 Benchmark]: Witness Printer took 295.27 ms. Allocated memory is still 6.4 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:22,588 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.23 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 1174.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -119.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 147.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2474.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 238445.34 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 295.27 ms. Allocated memory is still 6.4 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1566]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a15 == 1 && a20 <= 0) && (((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a11 == 1)) && a16 == 1) && a26 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a5 == 1) || ((((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a22)) || (a1 == 1 && (((((((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) || ((a27 == 1 && a26 == 1) && ((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a29 == 1) && 1 == a22) && a16 == 1) && 1 == a0) || (((((a12 == 1 && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && (((!(a7 == 1) && a6 <= 0) && a18 == 1) && a5 == 1) && a16 == 1)))) || ((((((((((((a18 == 1 && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a5) && 0 == a3) && 1 == a22) && 1 == a0)) || (((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a5) && a29 == 1) && 1 == a0) && a11 == 1)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a6 <= 0) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) && a20 <= 0)) || ((((((a27 == 1 && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 1 == a22) && a15 == 1)) || ((((((((((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (a26 == 1 && 1 == a6 && (((((((a18 == 1 && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a29 == 1) && a16 == 1) && a3 <= 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && (((a29 == 1 && (((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && 1 == a5) || ((((!(a7 == 1) && (((((a6 <= 0 && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && a5 == 1) && a29 == 1) && 1 == a22))) && a20 <= 0)) || (((((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a12 == 1) && a1 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((a1 == 1 && a15 == 1) && (((1 == a5 && ((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11)) && a27 <= 0)) || (a27 == 1 && ((0 == a3 && a29 == 1 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && 1 == a22) && 1 == a0)) || (a1 == 1 && (((((!(a7 == 1) && ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a27 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a16 == 1) && a23 <= 0) && a20 <= 0)) || (((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && a16 == 1) && a26 == 1) && 0 == a3) && 1 == a0) || ((((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && ((((1 == a5 && a27 == 1) && ((a12 == 1 && a29 == 1) && 1 == a0) && ((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a26 == 1) || (((((((((((!(1 == a11) && a18 == 1) && 1 == a5) && a16 == 1) && 1 == a22) && !(a7 == 1)) && a6 <= 0) && a27 == 1) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1))) && a20 <= 0)) || (a29 == 1 && ((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((a26 == 1 && ((a12 == 1 && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a29 == 1) && a5 == 1) && 1 == a0) && a1 == 1) && a20 <= 0)) || (a11 == 1 && ((0 == a3 && a29 == 1) && 1 == a0) && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a15 == 1) && a12 == 1) && a5 == 1) && 1 == a0)) || ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a26 == 1) && 1 == a22) && a16 == 1) && a27 <= 0) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a12 == 1) && a26 == 1) && a16 == 1) && 1 == a22) && (1 == a8 || ((a4 == 1 && a29 == 1) && a15 == 1))) && a27 <= 0)) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a23 <= 0) && (((0 == a3 && a29 == 1) && 1 == a22) && 1 == a0) && (((((!(a7 == 1) && a18 == 1) && 1 == a6) && a26 <= 0) && a5 == 1) && a16 == 1) && a15 == 1) && a1 == 1)) || ((1 == a8 || a11 == 1) && ((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a15 == 1) && !(a7 == 1)) && 0 == a3) && 1 == a0)) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a15 == 1) && 0 == a3) && 1 == a0)) || (1 == a6 && (((((((a18 == 1 && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a29 == 1) && a5 == 1) && a26 == 1) && 1 == a22) && 1 == a0)) || ((((((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((a1 == 1 && (((((a11 == 1 && (((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a29 == 1) && a26 == 1) && 1 == a0) || (((((((((((!(a12 == 1) && !(a7 == 1)) && a18 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((a27 == 1 && a26 == 1) && (((((((!(a7 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a22) && a26 == 1))) && a20 <= 0)) || ((((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a26 <= 0) && a16 == 1) && a29 == 1) && a5 == 1) && 1 == a0)) || (((((((((((((a18 == 1 && a5 == 1) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((1 == a22 && 1 == a0) && (((((a3 <= 0 && a18 == 1) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a26 == 1)) || ((((((!(a7 == 1) && (1 == a8 || a11 == 1)) && (a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && 1 == a5) && a27 == 1) && a26 == 1)) || ((((((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a11 == 1 && a26 == 1) && ((((1 == a6 && a12 == 1) && 0 == a3) && a5 == 1) && 1 == a0) && (!(a7 == 1) && a18 == 1) && a27 == 1)) || (((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && 1 == a22) && a16 == 1) && a27 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0) && a1 == 1)) || ((((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a11 == 1) && a26 == 1)) || (((((((((((!(1 == a11) && a3 <= 0) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a16 == 1) && a29 == 1) && 1 == a0) && 1 == a5) && a27 == 1) && a26 == 1)) || (((((((((((((((a18 == 1 && !(a11 == 1)) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 2 <= a3) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a27 == 1 && ((((((a3 <= 0 && !(a7 == 1)) && !(a12 == 1)) && a18 == 1) && 1 == a6) && a16 == 1) && a5 == 1) && a29 == 1) && a26 == 1)) || (((((((((((a6 <= 0 && a18 == 1) && a12 == 1) && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && !(1 == a11)) || (((a29 == 1 && (((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && 0 == a3) && 1 == a0)) && 1 == a5) && a27 == 1) && a26 == 1)) || ((0 == a3 && 1 == a0) && (((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1)) || (((((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a26 <= 0) && a16 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a0) && a20 <= 0) && a1 == 1)) || ((((((((((((((((!(1 == a8) && a4 == 1) && ((a6 <= 0 && a18 == 1) && !(a11 == 1)) && a26 <= 0) && a5 == 1) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && ((a19 == 1 || a17 == 1) || !(2 == input))) && 1 == a3) && a1 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 1 == a3) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((a1 == 1 && ((((((((((a18 == 1 && 1 == a5) && a16 == 1) && 1 == a22) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) && a11 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a20 <= 0) && a1 == 1)) || (a1 == 1 && (((((!(1 == a8) && a4 == 1) && 1 == a0 && ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && a15 == 1) && a23 <= 0) && a20 <= 0)) || (a1 == 1 && ((((1 == a5 && a27 == 1) && (((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0)) || (a27 == 1 && (((((!(a7 == 1) && 1 == a6) && a29 == 1) && a5 == 1) && ((a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) || (a29 == 1 && (!(a7 == 1) && a18 == 1) && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1)))) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((a27 == 1 && a11 == 1) && (((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a5 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && a15 == 1) && 1 == a0)) || ((a1 == 1 && ((((a5 == 1 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a16 == 1) && a15 == 1) || ((((1 == a6 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && 1 == a5))) && a20 <= 0)) || ((((((((((((((a18 == 1 && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a1 == 1) && a5 == 1) && a20 <= 0)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((a29 == 1 && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && 0 == a3) && 1 == a22) && 1 == a0) || ((((!(a7 == 1) && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && a29 == 1) && 0 == a3) && 1 == a0)) || (((((((a12 == a6 && a29 == 1) && 1 == a0) && (((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a26 <= 0) && a16 == 1) && a27 <= 0) && 1 == a5) && a11 == 1) && a20 <= 0) && a1 == 1)) || ((((((a12 == 1 && 0 == a3) && a5 == 1) && a29 == 1) && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a16 == 1) && a26 == 1) && a27 <= 0) && 1 == a22) && 1 == a0)) || (((((((((a18 == 1 && 1 == a6) && a5 == 1) && 1 == a22) && a3 <= 0) && !(a12 == 1)) && a27 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a15 == 1 && a20 <= 0) && (((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a11 == 1)) && a16 == 1) && a26 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a5 == 1) || ((((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a22)) || (a1 == 1 && (((((((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) || ((a27 == 1 && a26 == 1) && ((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a29 == 1) && 1 == a22) && a16 == 1) && 1 == a0) || (((((a12 == 1 && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && (((!(a7 == 1) && a6 <= 0) && a18 == 1) && a5 == 1) && a16 == 1)))) || ((((((((((((a18 == 1 && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a5) && 0 == a3) && 1 == a22) && 1 == a0)) || (((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a5) && a29 == 1) && 1 == a0) && a11 == 1)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a6 <= 0) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) && a20 <= 0)) || ((((((a27 == 1 && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 1 == a22) && a15 == 1)) || ((((((((((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (a26 == 1 && 1 == a6 && (((((((a18 == 1 && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a29 == 1) && a16 == 1) && a3 <= 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && (((a29 == 1 && (((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && 1 == a5) || ((((!(a7 == 1) && (((((a6 <= 0 && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && a5 == 1) && a29 == 1) && 1 == a22))) && a20 <= 0)) || (((((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a12 == 1) && a1 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((a1 == 1 && a15 == 1) && (((1 == a5 && ((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11)) && a27 <= 0)) || (a27 == 1 && ((0 == a3 && a29 == 1 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && 1 == a22) && 1 == a0)) || (a1 == 1 && (((((!(a7 == 1) && ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a27 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a16 == 1) && a23 <= 0) && a20 <= 0)) || (((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && a16 == 1) && a26 == 1) && 0 == a3) && 1 == a0) || ((((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && ((((1 == a5 && a27 == 1) && ((a12 == 1 && a29 == 1) && 1 == a0) && ((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a26 == 1) || (((((((((((!(1 == a11) && a18 == 1) && 1 == a5) && a16 == 1) && 1 == a22) && !(a7 == 1)) && a6 <= 0) && a27 == 1) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1))) && a20 <= 0)) || (a29 == 1 && ((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((a26 == 1 && ((a12 == 1 && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a29 == 1) && a5 == 1) && 1 == a0) && a1 == 1) && a20 <= 0)) || (a11 == 1 && ((0 == a3 && a29 == 1) && 1 == a0) && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a15 == 1) && a12 == 1) && a5 == 1) && 1 == a0)) || ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a26 == 1) && 1 == a22) && a16 == 1) && a27 <= 0) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a12 == 1) && a26 == 1) && a16 == 1) && 1 == a22) && (1 == a8 || ((a4 == 1 && a29 == 1) && a15 == 1))) && a27 <= 0)) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a23 <= 0) && (((0 == a3 && a29 == 1) && 1 == a22) && 1 == a0) && (((((!(a7 == 1) && a18 == 1) && 1 == a6) && a26 <= 0) && a5 == 1) && a16 == 1) && a15 == 1) && a1 == 1)) || ((1 == a8 || a11 == 1) && ((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a15 == 1) && !(a7 == 1)) && 0 == a3) && 1 == a0)) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a15 == 1) && 0 == a3) && 1 == a0)) || (1 == a6 && (((((((a18 == 1 && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a29 == 1) && a5 == 1) && a26 == 1) && 1 == a22) && 1 == a0)) || ((((((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((a1 == 1 && (((((a11 == 1 && (((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a29 == 1) && a26 == 1) && 1 == a0) || (((((((((((!(a12 == 1) && !(a7 == 1)) && a18 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((a27 == 1 && a26 == 1) && (((((((!(a7 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a22) && a26 == 1))) && a20 <= 0)) || ((((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a26 <= 0) && a16 == 1) && a29 == 1) && a5 == 1) && 1 == a0)) || (((((((((((((a18 == 1 && a5 == 1) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((1 == a22 && 1 == a0) && (((((a3 <= 0 && a18 == 1) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a26 == 1)) || ((((((!(a7 == 1) && (1 == a8 || a11 == 1)) && (a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && 1 == a5) && a27 == 1) && a26 == 1)) || ((((((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a11 == 1 && a26 == 1) && ((((1 == a6 && a12 == 1) && 0 == a3) && a5 == 1) && 1 == a0) && (!(a7 == 1) && a18 == 1) && a27 == 1)) || (((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && 1 == a22) && a16 == 1) && a27 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0) && a1 == 1)) || ((((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a11 == 1) && a26 == 1)) || (((((((((((!(1 == a11) && a3 <= 0) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a16 == 1) && a29 == 1) && 1 == a0) && 1 == a5) && a27 == 1) && a26 == 1)) || (((((((((((((((a18 == 1 && !(a11 == 1)) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 2 <= a3) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a27 == 1 && ((((((a3 <= 0 && !(a7 == 1)) && !(a12 == 1)) && a18 == 1) && 1 == a6) && a16 == 1) && a5 == 1) && a29 == 1) && a26 == 1)) || (((((((((((a6 <= 0 && a18 == 1) && a12 == 1) && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && !(1 == a11)) || (((a29 == 1 && (((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && 0 == a3) && 1 == a0)) && 1 == a5) && a27 == 1) && a26 == 1)) || ((0 == a3 && 1 == a0) && (((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1)) || (((((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a26 <= 0) && a16 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a0) && a20 <= 0) && a1 == 1)) || ((((((((((((((((!(1 == a8) && a4 == 1) && ((a6 <= 0 && a18 == 1) && !(a11 == 1)) && a26 <= 0) && a5 == 1) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && ((a19 == 1 || a17 == 1) || !(2 == input))) && 1 == a3) && a1 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 1 == a3) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((a1 == 1 && ((((((((((a18 == 1 && 1 == a5) && a16 == 1) && 1 == a22) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) && a11 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a20 <= 0) && a1 == 1)) || (a1 == 1 && (((((!(1 == a8) && a4 == 1) && 1 == a0 && ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && a15 == 1) && a23 <= 0) && a20 <= 0)) || (a1 == 1 && ((((1 == a5 && a27 == 1) && (((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0)) || (a27 == 1 && (((((!(a7 == 1) && 1 == a6) && a29 == 1) && a5 == 1) && ((a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) || (a29 == 1 && (!(a7 == 1) && a18 == 1) && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1)))) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((a27 == 1 && a11 == 1) && (((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a5 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && a15 == 1) && 1 == a0)) || ((a1 == 1 && ((((a5 == 1 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a16 == 1) && a15 == 1) || ((((1 == a6 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && 1 == a5))) && a20 <= 0)) || ((((((((((((((a18 == 1 && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a1 == 1) && a5 == 1) && a20 <= 0)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((a29 == 1 && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && 0 == a3) && 1 == a22) && 1 == a0) || ((((!(a7 == 1) && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && a29 == 1) && 0 == a3) && 1 == a0)) || (((((((a12 == a6 && a29 == 1) && 1 == a0) && (((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a26 <= 0) && a16 == 1) && a27 <= 0) && 1 == a5) && a11 == 1) && a20 <= 0) && a1 == 1)) || ((((((a12 == 1 && 0 == a3) && a5 == 1) && a29 == 1) && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a16 == 1) && a26 == 1) && a27 <= 0) && 1 == a22) && 1 == a0)) || (((((((((a18 == 1 && 1 == a6) && a5 == 1) && 1 == a22) && a3 <= 0) && !(a12 == 1)) && a27 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 238.2s, OverallIterations: 38, TraceHistogramMax: 12, AutomataDifference: 63.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 86.1s, HoareTripleCheckerStatistics: 5687 SDtfs, 15886 SDslu, 3953 SDs, 0 SdLazy, 28998 SolverSat, 4912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5643 GetRequests, 5475 SyntacticMatches, 17 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317003occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 372947 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 342 NumberOfFragments, 6803 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1223844 FormulaSimplificationTreeSizeReduction, 20.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2041464 FormulaSimplificationTreeSizeReductionInter, 65.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 22001 NumberOfCodeBlocks, 22001 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 21951 ConstructedInterpolants, 0 QuantifiedInterpolants, 50286451 SizeOfPredicates, 30 NumberOfNonLiveVariables, 8848 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 50 InterpolantComputations, 37 PerfectInterpolantSequences, 32421/33408 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...