./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af6b1525e2c938dd6f13a81192dad0348f6c2b6a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af6b1525e2c938dd6f13a81192dad0348f6c2b6a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 08:45:38,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:45:38,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:45:39,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:45:39,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:45:39,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:45:39,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:45:39,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:45:39,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:45:39,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:45:39,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:45:39,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:45:39,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:45:39,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:45:39,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:45:39,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:45:39,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:45:39,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:45:39,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:45:39,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:45:39,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:45:39,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:45:39,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:45:39,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:45:39,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:45:39,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:45:39,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:45:39,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:45:39,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:45:39,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:45:39,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:45:39,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:45:39,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:45:39,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:45:39,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:45:39,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:45:39,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:45:39,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:45:39,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:45:39,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:45:39,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:45:39,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 08:45:39,078 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:45:39,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:45:39,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:45:39,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 08:45:39,079 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 08:45:39,080 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:45:39,080 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 08:45:39,080 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 08:45:39,080 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 08:45:39,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:45:39,081 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:45:39,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:45:39,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:45:39,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:45:39,083 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> af6b1525e2c938dd6f13a81192dad0348f6c2b6a [2020-12-09 08:45:39,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:45:39,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:45:39,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:45:39,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:45:39,274 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:45:39,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-09 08:45:39,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/2d8c8720b/ef671806f7af44b3922c50e8056da900/FLAGf811d3c06 [2020-12-09 08:45:39,777 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:45:39,777 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-09 08:45:39,790 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/2d8c8720b/ef671806f7af44b3922c50e8056da900/FLAGf811d3c06 [2020-12-09 08:45:39,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/2d8c8720b/ef671806f7af44b3922c50e8056da900 [2020-12-09 08:45:39,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:45:39,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:45:39,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:45:39,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:45:39,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:45:39,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:45:39" (1/1) ... [2020-12-09 08:45:39,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c42ce1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:39, skipping insertion in model container [2020-12-09 08:45:39,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:45:39" (1/1) ... [2020-12-09 08:45:39,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:45:39,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:45:40,020 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2020-12-09 08:45:40,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:45:40,180 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:45:40,202 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2020-12-09 08:45:40,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:45:40,293 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:45:40,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40 WrapperNode [2020-12-09 08:45:40,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:45:40,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:45:40,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:45:40,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:45:40,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:45:40,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:45:40,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:45:40,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:45:40,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... [2020-12-09 08:45:40,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:45:40,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:45:40,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:45:40,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:45:40,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/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 [2020-12-09 08:45:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 08:45:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:45:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:45:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:45:51,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:45:51,538 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 08:45:51,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:45:51 BoogieIcfgContainer [2020-12-09 08:45:51,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:45:51,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:45:51,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:45:51,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:45:51,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:45:39" (1/3) ... [2020-12-09 08:45:51,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7012a1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:45:51, skipping insertion in model container [2020-12-09 08:45:51,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:45:40" (2/3) ... [2020-12-09 08:45:51,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7012a1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:45:51, skipping insertion in model container [2020-12-09 08:45:51,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:45:51" (3/3) ... [2020-12-09 08:45:51,546 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2020-12-09 08:45:51,555 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:45:51,558 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:45:51,564 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:45:51,580 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:45:51,580 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:45:51,580 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:45:51,580 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:45:51,580 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:45:51,580 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:45:51,580 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:45:51,580 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:45:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 08:45:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 08:45:51,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:45:51,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 08:45:51,592 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:45:51,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:45:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1037753679, now seen corresponding path program 1 times [2020-12-09 08:45:51,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:45:51,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499707121] [2020-12-09 08:45:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:45:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:45:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:45:51,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499707121] [2020-12-09 08:45:51,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:45:51,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:45:51,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015664209] [2020-12-09 08:45:51,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:45:51,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 08:45:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:45:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:45:51,791 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2020-12-09 08:45:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:45:51,882 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 08:45:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:45:51,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-09 08:45:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:45:51,892 INFO L225 Difference]: With dead ends: 23 [2020-12-09 08:45:51,893 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 08:45:51,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:45:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 08:45:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 08:45:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 08:45:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 08:45:51,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 08:45:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:45:51,924 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 08:45:51,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:45:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 08:45:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 08:45:51,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:45:51,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 08:45:51,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 08:45:51,925 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:45:51,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:45:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash 813414103, now seen corresponding path program 1 times [2020-12-09 08:45:51,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 08:45:51,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828707057] [2020-12-09 08:45:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 08:45:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:45:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:45:52,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828707057] [2020-12-09 08:45:52,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343352030] [2020-12-09 08:45:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/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 [2020-12-09 08:45:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:45:52,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 08:45:52,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:45:52,605 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 1337 DAG size of output: 79 [2020-12-09 08:45:52,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 08:45:52,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 08:45:52,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 08:45:52,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 08:45:52,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 08:45:52,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 7, 5, 5, 5, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,820 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 08:45:52,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,821 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 08:45:52,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,822 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 08:45:52,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 08:45:52,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 08:45:52,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 5, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,824 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 08:45:52,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 7, 5, 5, 5, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,824 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 08:45:52,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,825 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 08:45:52,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,826 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:45:52,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-12-09 08:45:52,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 08:45:52,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 5, 5, 4, 5, 3, 5, 2, 5, 1] term [2020-12-09 08:45:52,829 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 08:45:52,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 4, 4, 1] term [2020-12-09 08:45:52,898 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:45:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:45:52,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:45:53,140 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 1448 DAG size of output: 1318 [2020-12-09 08:45:53,157 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-12-09 08:45:53,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012223063] [2020-12-09 08:45:53,172 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 08:45:53,172 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 08:45:53,175 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 08:45:53,179 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 08:45:53,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 08:45:53,319 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 57 [2020-12-09 08:45:54,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 57 [2020-12-09 08:45:56,091 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 2463 DAG size of output: 2322 [2020-12-09 08:48:59,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 08:48:59,100 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 08:48:59,114 INFO L168 Benchmark]: Toolchain (without parser) took 199304.80 ms. Allocated memory was 96.5 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 65.2 MB in the beginning and 332.2 MB in the end (delta: -266.9 MB). Peak memory consumption was 981.6 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,115 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:48:59,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.82 ms. Allocated memory is still 96.5 MB. Free memory was 64.8 MB in the beginning and 52.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.73 ms. Allocated memory is still 96.5 MB. Free memory was 52.7 MB in the beginning and 43.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,119 INFO L168 Benchmark]: Boogie Preprocessor took 68.23 ms. Allocated memory is still 96.5 MB. Free memory was 43.2 MB in the beginning and 36.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,121 INFO L168 Benchmark]: RCFGBuilder took 11096.40 ms. Allocated memory was 96.5 MB in the beginning and 371.2 MB in the end (delta: 274.7 MB). Free memory was 36.3 MB in the beginning and 128.5 MB in the end (delta: -92.2 MB). Peak memory consumption was 214.0 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,122 INFO L168 Benchmark]: TraceAbstraction took 187569.75 ms. Allocated memory was 371.2 MB in the beginning and 1.3 GB in the end (delta: 893.4 MB). Free memory was 128.5 MB in the beginning and 332.2 MB in the end (delta: -203.6 MB). Peak memory consumption was 769.5 MB. Max. memory is 16.1 GB. [2020-12-09 08:48:59,124 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 484.82 ms. Allocated memory is still 96.5 MB. Free memory was 64.8 MB in the beginning and 52.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.73 ms. Allocated memory is still 96.5 MB. Free memory was 52.7 MB in the beginning and 43.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.23 ms. Allocated memory is still 96.5 MB. Free memory was 43.2 MB in the beginning and 36.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11096.40 ms. Allocated memory was 96.5 MB in the beginning and 371.2 MB in the end (delta: 274.7 MB). Free memory was 36.3 MB in the beginning and 128.5 MB in the end (delta: -92.2 MB). Peak memory consumption was 214.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 187569.75 ms. Allocated memory was 371.2 MB in the beginning and 1.3 GB in the end (delta: 893.4 MB). Free memory was 128.5 MB in the beginning and 332.2 MB in the end (delta: -203.6 MB). Peak memory consumption was 769.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 08:49:00,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 08:49:00,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 08:49:00,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 08:49:00,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 08:49:00,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 08:49:00,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 08:49:00,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 08:49:00,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 08:49:00,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 08:49:00,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 08:49:00,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 08:49:00,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 08:49:00,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 08:49:00,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 08:49:00,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 08:49:00,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 08:49:00,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 08:49:00,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 08:49:00,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 08:49:00,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 08:49:00,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 08:49:00,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 08:49:00,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 08:49:00,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 08:49:00,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 08:49:00,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 08:49:00,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 08:49:00,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 08:49:00,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 08:49:00,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 08:49:00,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 08:49:00,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 08:49:00,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 08:49:00,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 08:49:00,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 08:49:00,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 08:49:00,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 08:49:00,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 08:49:00,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 08:49:00,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 08:49:00,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 08:49:00,824 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 08:49:00,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 08:49:00,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 08:49:00,825 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 08:49:00,825 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 08:49:00,826 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 08:49:00,826 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 08:49:00,826 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 08:49:00,826 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 08:49:00,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 08:49:00,827 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 08:49:00,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 08:49:00,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 08:49:00,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 08:49:00,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 08:49:00,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 08:49:00,828 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 08:49:00,829 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 08:49:00,829 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 08:49:00,829 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 08:49:00,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 08:49:00,829 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 08:49:00,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 08:49:00,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 08:49:00,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 08:49:00,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 08:49:00,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 08:49:00,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 08:49:00,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 08:49:00,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 08:49:00,831 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 08:49:00,831 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 08:49:00,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 08:49:00,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 08:49:00,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 08:49:00,832 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> af6b1525e2c938dd6f13a81192dad0348f6c2b6a [2020-12-09 08:49:01,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 08:49:01,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 08:49:01,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 08:49:01,100 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 08:49:01,101 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 08:49:01,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-09 08:49:01,140 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/f0f9bc6e3/76b9bdc770f144679856c1cd6978bdfa/FLAG8235b3afa [2020-12-09 08:49:01,596 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 08:49:01,596 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-09 08:49:01,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/f0f9bc6e3/76b9bdc770f144679856c1cd6978bdfa/FLAG8235b3afa [2020-12-09 08:49:01,621 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/data/f0f9bc6e3/76b9bdc770f144679856c1cd6978bdfa [2020-12-09 08:49:01,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 08:49:01,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 08:49:01,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 08:49:01,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 08:49:01,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 08:49:01,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:49:01" (1/1) ... [2020-12-09 08:49:01,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39efdd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:01, skipping insertion in model container [2020-12-09 08:49:01,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:49:01" (1/1) ... [2020-12-09 08:49:01,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 08:49:01,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 08:49:01,816 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2020-12-09 08:49:01,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:49:01,973 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 08:49:01,994 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2020-12-09 08:49:02,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 08:49:02,108 INFO L208 MainTranslator]: Completed translation [2020-12-09 08:49:02,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02 WrapperNode [2020-12-09 08:49:02,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 08:49:02,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 08:49:02,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 08:49:02,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 08:49:02,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 08:49:02,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 08:49:02,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 08:49:02,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 08:49:02,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... [2020-12-09 08:49:02,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 08:49:02,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 08:49:02,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 08:49:02,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 08:49:02,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/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 [2020-12-09 08:49:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 08:49:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 08:49:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 08:49:02,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 08:49:04,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 08:49:04,664 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 08:49:04,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:49:04 BoogieIcfgContainer [2020-12-09 08:49:04,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 08:49:04,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 08:49:04,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 08:49:04,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 08:49:04,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:49:01" (1/3) ... [2020-12-09 08:49:04,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aebeb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:49:04, skipping insertion in model container [2020-12-09 08:49:04,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:49:02" (2/3) ... [2020-12-09 08:49:04,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aebeb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:49:04, skipping insertion in model container [2020-12-09 08:49:04,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:49:04" (3/3) ... [2020-12-09 08:49:04,670 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2020-12-09 08:49:04,679 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 08:49:04,682 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 08:49:04,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 08:49:04,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 08:49:04,707 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 08:49:04,707 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 08:49:04,707 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 08:49:04,707 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 08:49:04,707 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 08:49:04,707 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 08:49:04,707 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 08:49:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-09 08:49:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-09 08:49:04,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:04,726 INFO L422 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] [2020-12-09 08:49:04,726 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2020-12-09 08:49:04,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:04,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046689101] [2020-12-09 08:49:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:04,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:49:04,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:04,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:04,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046689101] [2020-12-09 08:49:04,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:04,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:49:04,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103965169] [2020-12-09 08:49:04,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:04,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:04,943 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-09 08:49:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:08,255 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2020-12-09 08:49:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:08,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-09 08:49:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:08,267 INFO L225 Difference]: With dead ends: 669 [2020-12-09 08:49:08,267 INFO L226 Difference]: Without dead ends: 360 [2020-12-09 08:49:08,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-09 08:49:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-09 08:49:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-09 08:49:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 522 transitions. [2020-12-09 08:49:08,314 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 522 transitions. Word has length 62 [2020-12-09 08:49:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:08,315 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 522 transitions. [2020-12-09 08:49:08,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 522 transitions. [2020-12-09 08:49:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-09 08:49:08,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:08,319 INFO L422 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:08,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 08:49:08,520 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 585592217, now seen corresponding path program 1 times [2020-12-09 08:49:08,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:08,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734739746] [2020-12-09 08:49:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:08,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:49:08,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:08,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:08,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734739746] [2020-12-09 08:49:08,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:08,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:49:08,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215279896] [2020-12-09 08:49:08,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:08,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:08,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:08,690 INFO L87 Difference]: Start difference. First operand 360 states and 522 transitions. Second operand 3 states. [2020-12-09 08:49:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:11,731 INFO L93 Difference]: Finished difference Result 1074 states and 1561 transitions. [2020-12-09 08:49:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:11,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-12-09 08:49:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:11,736 INFO L225 Difference]: With dead ends: 1074 [2020-12-09 08:49:11,736 INFO L226 Difference]: Without dead ends: 716 [2020-12-09 08:49:11,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-09 08:49:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-09 08:49:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 08:49:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 962 transitions. [2020-12-09 08:49:11,762 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 962 transitions. Word has length 128 [2020-12-09 08:49:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:11,763 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 962 transitions. [2020-12-09 08:49:11,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 962 transitions. [2020-12-09 08:49:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-09 08:49:11,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:11,765 INFO L422 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:11,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 08:49:11,967 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1395365876, now seen corresponding path program 1 times [2020-12-09 08:49:11,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:11,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707353822] [2020-12-09 08:49:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:49:12,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:12,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:12,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707353822] [2020-12-09 08:49:12,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:12,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:49:12,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405856795] [2020-12-09 08:49:12,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:12,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:12,142 INFO L87 Difference]: Start difference. First operand 716 states and 962 transitions. Second operand 3 states. [2020-12-09 08:49:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:14,945 INFO L93 Difference]: Finished difference Result 1966 states and 2656 transitions. [2020-12-09 08:49:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:14,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2020-12-09 08:49:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:14,950 INFO L225 Difference]: With dead ends: 1966 [2020-12-09 08:49:14,950 INFO L226 Difference]: Without dead ends: 1252 [2020-12-09 08:49:14,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-12-09 08:49:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2020-12-09 08:49:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2020-12-09 08:49:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1557 transitions. [2020-12-09 08:49:14,980 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1557 transitions. Word has length 130 [2020-12-09 08:49:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:14,981 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1557 transitions. [2020-12-09 08:49:14,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1557 transitions. [2020-12-09 08:49:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-09 08:49:14,983 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:14,983 INFO L422 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, 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] [2020-12-09 08:49:15,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 08:49:15,185 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash -56024554, now seen corresponding path program 1 times [2020-12-09 08:49:15,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:15,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411421207] [2020-12-09 08:49:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:15,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 08:49:15,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:15,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:15,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411421207] [2020-12-09 08:49:15,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [153438217] [2020-12-09 08:49:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt [2020-12-09 08:49:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:15,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 08:49:15,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 08:49:15,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:15,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 08:49:15,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2020-12-09 08:49:15,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252317659] [2020-12-09 08:49:15,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:49:15,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:49:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 08:49:15,905 INFO L87 Difference]: Start difference. First operand 1250 states and 1557 transitions. Second operand 4 states. [2020-12-09 08:49:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:21,979 INFO L93 Difference]: Finished difference Result 2912 states and 3798 transitions. [2020-12-09 08:49:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 08:49:21,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-12-09 08:49:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:21,986 INFO L225 Difference]: With dead ends: 2912 [2020-12-09 08:49:21,986 INFO L226 Difference]: Without dead ends: 1664 [2020-12-09 08:49:21,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 08:49:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2020-12-09 08:49:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1428. [2020-12-09 08:49:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-09 08:49:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1816 transitions. [2020-12-09 08:49:22,008 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1816 transitions. Word has length 142 [2020-12-09 08:49:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:22,009 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1816 transitions. [2020-12-09 08:49:22,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:49:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1816 transitions. [2020-12-09 08:49:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2020-12-09 08:49:22,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:22,013 INFO L422 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:22,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt [2020-12-09 08:49:22,415 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1148558455, now seen corresponding path program 1 times [2020-12-09 08:49:22,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:22,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188363485] [2020-12-09 08:49:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:22,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 08:49:22,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-12-09 08:49:22,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:22,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188363485] [2020-12-09 08:49:22,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:22,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:49:22,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877113159] [2020-12-09 08:49:22,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 08:49:22,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 08:49:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:49:22,851 INFO L87 Difference]: Start difference. First operand 1428 states and 1816 transitions. Second operand 4 states. [2020-12-09 08:49:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:24,929 INFO L93 Difference]: Finished difference Result 2527 states and 3279 transitions. [2020-12-09 08:49:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 08:49:24,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2020-12-09 08:49:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:24,935 INFO L225 Difference]: With dead ends: 2527 [2020-12-09 08:49:24,935 INFO L226 Difference]: Without dead ends: 1428 [2020-12-09 08:49:24,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 08:49:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-12-09 08:49:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2020-12-09 08:49:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-09 08:49:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1801 transitions. [2020-12-09 08:49:24,955 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1801 transitions. Word has length 318 [2020-12-09 08:49:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:24,956 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1801 transitions. [2020-12-09 08:49:24,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 08:49:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1801 transitions. [2020-12-09 08:49:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2020-12-09 08:49:24,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:24,962 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 08:49:25,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 08:49:25,163 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1749344894, now seen corresponding path program 1 times [2020-12-09 08:49:25,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:25,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834082713] [2020-12-09 08:49:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:25,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 08:49:25,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2020-12-09 08:49:25,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:25,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834082713] [2020-12-09 08:49:25,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:25,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 08:49:25,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142431645] [2020-12-09 08:49:25,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:25,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:25,858 INFO L87 Difference]: Start difference. First operand 1428 states and 1801 transitions. Second operand 3 states. [2020-12-09 08:49:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:27,988 INFO L93 Difference]: Finished difference Result 2498 states and 3235 transitions. [2020-12-09 08:49:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:27,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2020-12-09 08:49:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:27,993 INFO L225 Difference]: With dead ends: 2498 [2020-12-09 08:49:27,993 INFO L226 Difference]: Without dead ends: 1428 [2020-12-09 08:49:27,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-12-09 08:49:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2020-12-09 08:49:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-09 08:49:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1795 transitions. [2020-12-09 08:49:28,012 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1795 transitions. Word has length 413 [2020-12-09 08:49:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:28,012 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1795 transitions. [2020-12-09 08:49:28,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1795 transitions. [2020-12-09 08:49:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2020-12-09 08:49:28,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:28,020 INFO L422 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:28,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 08:49:28,221 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash 212928622, now seen corresponding path program 1 times [2020-12-09 08:49:28,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:28,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950791163] [2020-12-09 08:49:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:28,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 08:49:28,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 665 proven. 135 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2020-12-09 08:49:28,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2020-12-09 08:49:29,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950791163] [2020-12-09 08:49:29,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:49:29,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 08:49:29,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931955202] [2020-12-09 08:49:29,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:29,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:29,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:29,904 INFO L87 Difference]: Start difference. First operand 1428 states and 1795 transitions. Second operand 3 states. [2020-12-09 08:49:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:36,589 INFO L93 Difference]: Finished difference Result 3032 states and 3942 transitions. [2020-12-09 08:49:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:36,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2020-12-09 08:49:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:36,596 INFO L225 Difference]: With dead ends: 3032 [2020-12-09 08:49:36,596 INFO L226 Difference]: Without dead ends: 1962 [2020-12-09 08:49:36,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1028 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-12-09 08:49:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2020-12-09 08:49:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-09 08:49:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2192 transitions. [2020-12-09 08:49:36,620 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2192 transitions. Word has length 517 [2020-12-09 08:49:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:36,620 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2192 transitions. [2020-12-09 08:49:36,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2192 transitions. [2020-12-09 08:49:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2020-12-09 08:49:36,625 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:36,625 INFO L422 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:36,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 08:49:36,826 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1378082761, now seen corresponding path program 1 times [2020-12-09 08:49:36,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:36,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342197417] [2020-12-09 08:49:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:37,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 08:49:37,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 742 proven. 159 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2020-12-09 08:49:37,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 901 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2020-12-09 08:49:38,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342197417] [2020-12-09 08:49:38,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:49:38,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 08:49:38,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220284711] [2020-12-09 08:49:38,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:38,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:38,519 INFO L87 Difference]: Start difference. First operand 1784 states and 2192 transitions. Second operand 3 states. [2020-12-09 08:49:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:44,082 INFO L93 Difference]: Finished difference Result 4100 states and 5181 transitions. [2020-12-09 08:49:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:44,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2020-12-09 08:49:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:44,092 INFO L225 Difference]: With dead ends: 4100 [2020-12-09 08:49:44,092 INFO L226 Difference]: Without dead ends: 2674 [2020-12-09 08:49:44,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1110 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2020-12-09 08:49:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2020-12-09 08:49:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-09 08:49:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3088 transitions. [2020-12-09 08:49:44,132 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3088 transitions. Word has length 558 [2020-12-09 08:49:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:44,133 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 3088 transitions. [2020-12-09 08:49:44,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3088 transitions. [2020-12-09 08:49:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2020-12-09 08:49:44,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:44,137 INFO L422 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:44,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 08:49:44,339 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1372362145, now seen corresponding path program 1 times [2020-12-09 08:49:44,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:44,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690860778] [2020-12-09 08:49:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:44,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 08:49:44,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 746 proven. 277 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2020-12-09 08:49:45,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 994 proven. 29 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2020-12-09 08:49:46,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690860778] [2020-12-09 08:49:46,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [775519705] [2020-12-09 08:49:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 08:49:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:47,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 08:49:47,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2020-12-09 08:49:47,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:47,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 08:49:47,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 11 [2020-12-09 08:49:47,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773871566] [2020-12-09 08:49:47,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 08:49:47,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 08:49:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:49:47,888 INFO L87 Difference]: Start difference. First operand 2496 states and 3088 transitions. Second operand 6 states. [2020-12-09 08:49:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:50,729 INFO L93 Difference]: Finished difference Result 4708 states and 5889 transitions. [2020-12-09 08:49:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 08:49:50,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 574 [2020-12-09 08:49:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:50,738 INFO L225 Difference]: With dead ends: 4708 [2020-12-09 08:49:50,738 INFO L226 Difference]: Without dead ends: 2496 [2020-12-09 08:49:50,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1719 GetRequests, 1709 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-09 08:49:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2020-12-09 08:49:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2020-12-09 08:49:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-09 08:49:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2711 transitions. [2020-12-09 08:49:50,772 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2711 transitions. Word has length 574 [2020-12-09 08:49:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:50,772 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2711 transitions. [2020-12-09 08:49:50,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 08:49:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2711 transitions. [2020-12-09 08:49:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2020-12-09 08:49:50,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:50,778 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:51,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 08:49:51,180 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:51,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:51,182 INFO L82 PathProgramCache]: Analyzing trace with hash -912536852, now seen corresponding path program 1 times [2020-12-09 08:49:51,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:51,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180857068] [2020-12-09 08:49:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:51,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 08:49:51,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 1078 proven. 420 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-12-09 08:49:52,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:49:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 1498 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-12-09 08:49:54,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180857068] [2020-12-09 08:49:54,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:49:54,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 08:49:54,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311096781] [2020-12-09 08:49:54,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:54,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:54,353 INFO L87 Difference]: Start difference. First operand 2496 states and 2711 transitions. Second operand 3 states. [2020-12-09 08:49:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:49:57,036 INFO L93 Difference]: Finished difference Result 4990 states and 5474 transitions. [2020-12-09 08:49:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:49:57,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 787 [2020-12-09 08:49:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:49:57,046 INFO L225 Difference]: With dead ends: 4990 [2020-12-09 08:49:57,046 INFO L226 Difference]: Without dead ends: 2852 [2020-12-09 08:49:57,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1568 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 08:49:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-12-09 08:49:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2020-12-09 08:49:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2020-12-09 08:49:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3111 transitions. [2020-12-09 08:49:57,081 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3111 transitions. Word has length 787 [2020-12-09 08:49:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:49:57,082 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3111 transitions. [2020-12-09 08:49:57,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:49:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3111 transitions. [2020-12-09 08:49:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2020-12-09 08:49:57,093 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:49:57,094 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 08:49:57,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 08:49:57,295 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:49:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:49:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2123910187, now seen corresponding path program 1 times [2020-12-09 08:49:57,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:49:57,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949355787] [2020-12-09 08:49:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 08:49:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:49:57,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 08:49:57,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:49:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1595 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2020-12-09 08:49:58,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:49:58,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949355787] [2020-12-09 08:49:58,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 08:49:58,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 08:49:58,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087859164] [2020-12-09 08:49:58,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 08:49:58,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:49:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 08:49:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:49:58,307 INFO L87 Difference]: Start difference. First operand 2852 states and 3111 transitions. Second operand 3 states. [2020-12-09 08:50:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:00,019 INFO L93 Difference]: Finished difference Result 6414 states and 7055 transitions. [2020-12-09 08:50:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 08:50:00,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 885 [2020-12-09 08:50:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:00,037 INFO L225 Difference]: With dead ends: 6414 [2020-12-09 08:50:00,037 INFO L226 Difference]: Without dead ends: 3742 [2020-12-09 08:50:00,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 08:50:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2020-12-09 08:50:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2020-12-09 08:50:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2020-12-09 08:50:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4002 transitions. [2020-12-09 08:50:00,082 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4002 transitions. Word has length 885 [2020-12-09 08:50:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:00,082 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 4002 transitions. [2020-12-09 08:50:00,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 08:50:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4002 transitions. [2020-12-09 08:50:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2020-12-09 08:50:00,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:00,089 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 08:50:00,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 08:50:00,291 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:50:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 520305150, now seen corresponding path program 1 times [2020-12-09 08:50:00,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:50:00,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611965285] [2020-12-09 08:50:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 08:50:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:00,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 08:50:00,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2467 backedges. 1513 proven. 420 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2020-12-09 08:50:04,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:05,092 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 08:50:05,093 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 08:50:07,890 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2020-12-09 08:50:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2467 backedges. 1933 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2020-12-09 08:50:10,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611965285] [2020-12-09 08:50:10,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 08:50:10,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2020-12-09 08:50:10,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355131295] [2020-12-09 08:50:10,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 08:50:10,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:50:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 08:50:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 08:50:10,510 INFO L87 Difference]: Start difference. First operand 3742 states and 4002 transitions. Second operand 11 states. [2020-12-09 08:50:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:14,686 INFO L93 Difference]: Finished difference Result 7290 states and 7810 transitions. [2020-12-09 08:50:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 08:50:14,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 903 [2020-12-09 08:50:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:14,704 INFO L225 Difference]: With dead ends: 7290 [2020-12-09 08:50:14,704 INFO L226 Difference]: Without dead ends: 3897 [2020-12-09 08:50:14,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1804 GetRequests, 1744 SyntacticMatches, 42 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 08:50:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2020-12-09 08:50:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2020-12-09 08:50:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2020-12-09 08:50:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 4158 transitions. [2020-12-09 08:50:14,745 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 4158 transitions. Word has length 903 [2020-12-09 08:50:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:14,746 INFO L481 AbstractCegarLoop]: Abstraction has 3897 states and 4158 transitions. [2020-12-09 08:50:14,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 08:50:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 4158 transitions. [2020-12-09 08:50:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2020-12-09 08:50:14,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 08:50:14,754 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 08:50:14,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 08:50:14,955 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 08:50:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 08:50:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 630270292, now seen corresponding path program 1 times [2020-12-09 08:50:14,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 08:50:14,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855427357] [2020-12-09 08:50:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 08:50:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:15,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 08:50:15,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 479 proven. 2210 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-12-09 08:50:16,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 08:50:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 2019 proven. 97 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-09 08:50:18,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855427357] [2020-12-09 08:50:18,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1302742013] [2020-12-09 08:50:18,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 08:50:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 08:50:18,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 08:50:18,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 08:50:19,414 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 08:50:19,414 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 08:50:19,416 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 08:50:19,419 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:50:19,420 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 08:50:19,422 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:50:19,424 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:50:19,425 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 08:50:19,427 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 08:50:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 2581 trivial. 0 not checked. [2020-12-09 08:50:20,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 08:50:20,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 08:50:20,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 15 [2020-12-09 08:50:20,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653686442] [2020-12-09 08:50:20,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 08:50:20,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 08:50:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 08:50:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-12-09 08:50:20,137 INFO L87 Difference]: Start difference. First operand 3897 states and 4158 transitions. Second operand 7 states. [2020-12-09 08:50:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 08:50:24,201 INFO L93 Difference]: Finished difference Result 8495 states and 9168 transitions. [2020-12-09 08:50:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 08:50:24,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 980 [2020-12-09 08:50:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 08:50:24,202 INFO L225 Difference]: With dead ends: 8495 [2020-12-09 08:50:24,202 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 08:50:24,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2939 GetRequests, 2924 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-12-09 08:50:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 08:50:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 08:50:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 08:50:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 08:50:24,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 980 [2020-12-09 08:50:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 08:50:24,206 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 08:50:24,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 08:50:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 08:50:24,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 08:50:24,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,17 cvc4 --incremental --print-success --lang smt [2020-12-09 08:50:24,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 08:50:24,914 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-12-09 08:50:25,043 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-12-09 08:50:25,045 INFO L262 CegarLoopResult]: For program point L762(lines 762 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L895(line 895) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L829(lines 829 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L631(lines 631 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L565(lines 565 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L698(lines 698 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L500(lines 500 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L369(lines 369 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L303(lines 303 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L436(lines 436 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L239(lines 239 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L768(lines 768 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L636(lines 636 880) no Hoare annotation was computed. [2020-12-09 08:50:25,046 INFO L262 CegarLoopResult]: For program point L835(lines 835 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L571(lines 571 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L505(lines 505 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L704(lines 704 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L309(lines 309 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L442(lines 442 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L376(lines 376 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L245(lines 245 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L774(lines 774 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L642(lines 642 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L510(lines 510 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L841(lines 841 880) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,047 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L710(lines 710 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L578(lines 578 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L315(lines 315 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L448(lines 448 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L382(lines 382 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L251(lines 251 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L648(lines 648 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L516(lines 516 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L847(lines 847 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L781(lines 781 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L583(lines 583 880) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,048 INFO L262 CegarLoopResult]: For program point L716(lines 716 880) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L321(lines 321 880) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L454(lines 454 880) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L388(lines 388 880) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L257(lines 257 880) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 08:50:25,049 INFO L262 CegarLoopResult]: For program point L852(lines 852 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L654(lines 654 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L522(lines 522 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L787(lines 787 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L589(lines 589 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L722(lines 722 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L459(lines 459 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L327(lines 327 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L394(lines 394 880) no Hoare annotation was computed. [2020-12-09 08:50:25,050 INFO L262 CegarLoopResult]: For program point L262(lines 262 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L858(lines 858 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L660(lines 660 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L528(lines 528 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L793(lines 793 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L595(lines 595 880) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,051 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L728(lines 728 880) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L464(lines 464 880) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L333(lines 333 880) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L400(lines 400 880) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L268(lines 268 880) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 08:50:25,052 INFO L262 CegarLoopResult]: For program point L864(lines 864 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L666(lines 666 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L534(lines 534 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L799(lines 799 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L601(lines 601 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L734(lines 734 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L470(lines 470 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L339(lines 339 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L406(lines 406 880) no Hoare annotation was computed. [2020-12-09 08:50:25,053 INFO L262 CegarLoopResult]: For program point L274(lines 274 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L869(lines 869 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L672(lines 672 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L540(lines 540 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L805(lines 805 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L607(lines 607 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L740(lines 740 880) no Hoare annotation was computed. [2020-12-09 08:50:25,054 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L477(lines 477 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L345(lines 345 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L279(lines 279 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L412(lines 412 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L875(lines 875 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L678(lines 678 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L546(lines 546 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L811(lines 811 880) no Hoare annotation was computed. [2020-12-09 08:50:25,055 INFO L262 CegarLoopResult]: For program point L745(lines 745 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L613(lines 613 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L482(lines 482 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L351(lines 351 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L285(lines 285 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L418(lines 418 880) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,056 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L258 CegarLoopResult]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~a24~0))) (or (= (_ bv5 32) ~a15~0) (= (_ bv7 32) ~a15~0) (and .cse0 (not (bvsle ~a12~0 (_ bv4294967253 32)))) (and (or (not (= (_ bv8 32) ~a15~0)) (not (bvslt (_ bv80 32) ~a12~0))) (or (not (= (_ bv6 32) ~a21~0)) (not .cse0))) (= (_ bv8 32) ~a21~0))) [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L551(lines 551 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L221(lines 221 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L684(lines 684 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L817(lines 817 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L751(lines 751 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L619(lines 619 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L265 CegarLoopResult]: At program point L884(lines 884 900) the Hoare annotation is: true [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L488(lines 488 880) no Hoare annotation was computed. [2020-12-09 08:50:25,057 INFO L262 CegarLoopResult]: For program point L290(lines 290 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L687(lines 687 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L357(lines 357 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L424(lines 424 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L557(lines 557 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L227(lines 227 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L757(lines 757 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L625(lines 625 880) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,058 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L824(lines 824 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L258 CegarLoopResult]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~a24~0))) (or (= (_ bv5 32) ~a15~0) (= (_ bv7 32) ~a15~0) (and .cse0 (not (bvsle ~a12~0 (_ bv4294967253 32)))) (and (or (not (= (_ bv8 32) ~a15~0)) (not (bvslt (_ bv80 32) ~a12~0))) (or (not (= (_ bv6 32) ~a21~0)) (not .cse0))) (= (_ bv8 32) ~a21~0))) [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L494(lines 494 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L296(lines 296 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L693(lines 693 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L363(lines 363 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L562(lines 562 880) no Hoare annotation was computed. [2020-12-09 08:50:25,059 INFO L262 CegarLoopResult]: For program point L430(lines 430 880) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L233(lines 233 880) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 08:50:25,060 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 08:50:25,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:50:25 BoogieIcfgContainer [2020-12-09 08:50:25,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 08:50:25,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 08:50:25,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 08:50:25,073 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 08:50:25,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:49:04" (3/4) ... [2020-12-09 08:50:25,076 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 08:50:25,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 08:50:25,096 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 08:50:25,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 08:50:25,099 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 08:50:25,193 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_801cf7af-ec27-430d-ae08-feb3af4c8d64/bin/utaipan/witness.graphml [2020-12-09 08:50:25,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 08:50:25,194 INFO L168 Benchmark]: Toolchain (without parser) took 83568.86 ms. Allocated memory was 69.2 MB in the beginning and 436.2 MB in the end (delta: 367.0 MB). Free memory was 52.1 MB in the beginning and 215.9 MB in the end (delta: -163.8 MB). Peak memory consumption was 201.6 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,194 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 69.2 MB. Free memory is still 51.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 08:50:25,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.06 ms. Allocated memory was 69.2 MB in the beginning and 119.5 MB in the end (delta: 50.3 MB). Free memory was 51.8 MB in the beginning and 98.1 MB in the end (delta: -46.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 119.5 MB. Free memory was 97.6 MB in the beginning and 91.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,194 INFO L168 Benchmark]: Boogie Preprocessor took 51.04 ms. Allocated memory is still 119.5 MB. Free memory was 91.3 MB in the beginning and 86.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,195 INFO L168 Benchmark]: RCFGBuilder took 2442.68 ms. Allocated memory is still 119.5 MB. Free memory was 86.1 MB in the beginning and 81.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,195 INFO L168 Benchmark]: TraceAbstraction took 80406.37 ms. Allocated memory was 119.5 MB in the beginning and 436.2 MB in the end (delta: 316.7 MB). Free memory was 81.6 MB in the beginning and 234.8 MB in the end (delta: -153.1 MB). Peak memory consumption was 162.3 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,195 INFO L168 Benchmark]: Witness Printer took 119.80 ms. Allocated memory is still 436.2 MB. Free memory was 234.8 MB in the beginning and 215.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 08:50:25,197 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 69.2 MB. Free memory is still 51.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 483.06 ms. Allocated memory was 69.2 MB in the beginning and 119.5 MB in the end (delta: 50.3 MB). Free memory was 51.8 MB in the beginning and 98.1 MB in the end (delta: -46.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 119.5 MB. Free memory was 97.6 MB in the beginning and 91.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.04 ms. Allocated memory is still 119.5 MB. Free memory was 91.3 MB in the beginning and 86.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2442.68 ms. Allocated memory is still 119.5 MB. Free memory was 86.1 MB in the beginning and 81.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 80406.37 ms. Allocated memory was 119.5 MB in the beginning and 436.2 MB in the end (delta: 316.7 MB). Free memory was 81.6 MB in the beginning and 234.8 MB in the end (delta: -153.1 MB). Peak memory consumption was 162.3 MB. Max. memory is 16.1 GB. * Witness Printer took 119.80 ms. Allocated memory is still 436.2 MB. Free memory was 234.8 MB in the beginning and 215.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 200]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((5bv32 == a15 || 7bv32 == a15) || (1bv32 == a24 && !~bvsle32(a12, 4294967253bv32))) || ((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && (!(6bv32 == a21) || !(1bv32 == a24)))) || 8bv32 == a21 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((5bv32 == a15 || 7bv32 == a15) || (1bv32 == a24 && !~bvsle32(a12, 4294967253bv32))) || ((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && (!(6bv32 == a21) || !(1bv32 == a24)))) || 8bv32 == a21 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 79.9s, OverallIterations: 13, TraceHistogramMax: 9, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1423 SDtfs, 2235 SDslu, 120 SDs, 0 SdLazy, 9275 SolverSat, 1235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12535 GetRequests, 12423 SyntacticMatches, 47 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3897occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 594 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 75 NumberOfFragments, 75 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4482 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 438 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 8093 NumberOfCodeBlocks, 8093 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 12531 ConstructedInterpolants, 0 QuantifiedInterpolants, 50998263 SizeOfPredicates, 31 NumberOfNonLiveVariables, 9275 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 26534/30343 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...