./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7 --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 f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:33:13,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:33:13,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:33:13,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:33:13,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:33:13,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:33:13,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:33:13,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:33:13,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:33:13,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:33:13,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:33:13,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:33:13,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:33:13,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:33:13,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:33:13,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:33:13,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:33:13,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:33:13,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:33:13,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:33:13,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:33:13,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:33:13,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:33:13,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:33:13,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:33:13,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:33:13,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:33:13,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:33:13,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:33:13,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:33:13,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:33:13,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:33:13,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:33:13,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:33:13,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:33:13,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:33:13,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:33:13,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:33:13,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:33:13,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:33:13,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:33:13,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:33:13,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:33:13,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:33:13,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:33:13,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:33:13,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:33:13,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:33:13,942 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:33:13,943 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:33:13,943 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:33:13,943 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:33:13,943 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:33:13,943 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:33:13,944 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:33:13,944 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:33:13,944 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:33:13,944 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:33:13,944 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:33:13,944 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:33:13,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:33:13,945 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:33:13,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:33:13,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:33:13,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:33:13,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:33:13,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:33:13,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:33:13,947 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:33:13,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:33:13,947 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:33:13,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:33:13,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:33:13,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:33:13,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:33:13,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:33:13,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:33:13,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:33:13,949 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:33:13,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:33:13,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:33:13,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:33:13,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:33:13,949 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_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/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_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7 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 -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2021-11-25 20:33:14,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:33:14,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:33:14,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:33:14,264 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:33:14,265 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:33:14,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-11-25 20:33:14,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/data/e3e4267ff/67dd440dc9914befaa3de83710399d56/FLAG87697fa7f [2021-11-25 20:33:14,848 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:33:14,849 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-11-25 20:33:14,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/data/e3e4267ff/67dd440dc9914befaa3de83710399d56/FLAG87697fa7f [2021-11-25 20:33:15,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/data/e3e4267ff/67dd440dc9914befaa3de83710399d56 [2021-11-25 20:33:15,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:33:15,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:33:15,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:33:15,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:33:15,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:33:15,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4c47ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15, skipping insertion in model container [2021-11-25 20:33:15,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:33:15,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:33:15,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-11-25 20:33:15,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:33:15,526 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:33:15,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-11-25 20:33:15,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:33:15,579 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:33:15,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15 WrapperNode [2021-11-25 20:33:15,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:33:15,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:33:15,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:33:15,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:33:15,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,633 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2021-11-25 20:33:15,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:33:15,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:33:15,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:33:15,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:33:15,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:33:15,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:33:15,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:33:15,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:33:15,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (1/1) ... [2021-11-25 20:33:15,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:33:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:15,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:33:15,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:33:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:33:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:33:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:33:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:33:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 20:33:15,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 20:33:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 20:33:15,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 20:33:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 20:33:15,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 20:33:15,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-25 20:33:15,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-25 20:33:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:33:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 20:33:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 20:33:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:33:15,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:33:15,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:33:15,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:33:15,763 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:33:15,919 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:33:15,921 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:33:16,589 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:33:16,798 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:33:16,798 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-25 20:33:16,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:33:16 BoogieIcfgContainer [2021-11-25 20:33:16,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:33:16,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:33:16,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:33:16,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:33:16,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:33:15" (1/3) ... [2021-11-25 20:33:16,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:33:16, skipping insertion in model container [2021-11-25 20:33:16,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:33:15" (2/3) ... [2021-11-25 20:33:16,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:33:16, skipping insertion in model container [2021-11-25 20:33:16,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:33:16" (3/3) ... [2021-11-25 20:33:16,813 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2021-11-25 20:33:16,818 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:33:16,819 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:33:16,819 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 20:33:16,819 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:33:16,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,870 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,871 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,872 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,873 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,873 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,874 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,886 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,886 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,887 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,890 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,898 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,898 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,899 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,899 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,900 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,901 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,902 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,903 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,903 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,903 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,903 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,903 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,904 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,905 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,905 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,905 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,905 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,906 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,908 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,909 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,909 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,912 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,912 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,912 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,912 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,913 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,913 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,914 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,914 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,914 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,914 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,916 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,917 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,918 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,919 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,920 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,920 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,920 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,920 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,921 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,922 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,923 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:33:16,926 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-11-25 20:33:16,971 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:33:16,977 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:33:16,978 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-25 20:33:16,997 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:33:17,012 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 265 transitions, 562 flow [2021-11-25 20:33:17,015 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 265 transitions, 562 flow [2021-11-25 20:33:17,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2021-11-25 20:33:17,143 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2021-11-25 20:33:17,143 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-25 20:33:17,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2021-11-25 20:33:17,157 INFO L116 LiptonReduction]: Number of co-enabled transitions 1824 [2021-11-25 20:33:27,760 INFO L131 LiptonReduction]: Checked pairs total: 3134 [2021-11-25 20:33:27,761 INFO L133 LiptonReduction]: Total number of compositions: 265 [2021-11-25 20:33:27,769 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 42 transitions, 116 flow [2021-11-25 20:33:27,821 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:33:27,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:27,848 INFO L514 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] [2021-11-25 20:33:27,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -788120774, now seen corresponding path program 1 times [2021-11-25 20:33:27,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:27,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764352371] [2021-11-25 20:33:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:27,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:28,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:28,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764352371] [2021-11-25 20:33:28,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764352371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:28,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:28,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 20:33:28,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206054416] [2021-11-25 20:33:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:28,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:33:28,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:33:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:28,417 INFO L87 Difference]: Start difference. First operand has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:28,581 INFO L93 Difference]: Finished difference Result 778 states and 3201 transitions. [2021-11-25 20:33:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:33:28,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 20:33:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:28,623 INFO L225 Difference]: With dead ends: 778 [2021-11-25 20:33:28,623 INFO L226 Difference]: Without dead ends: 749 [2021-11-25 20:33:28,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:28,629 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:28,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-25 20:33:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2021-11-25 20:33:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 4.124331550802139) internal successors, (3085), 748 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 3085 transitions. [2021-11-25 20:33:28,763 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 3085 transitions. Word has length 28 [2021-11-25 20:33:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:28,764 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 3085 transitions. [2021-11-25 20:33:28,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 3085 transitions. [2021-11-25 20:33:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 20:33:28,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:28,772 INFO L514 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] [2021-11-25 20:33:28,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:33:28,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1768319932, now seen corresponding path program 1 times [2021-11-25 20:33:28,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:28,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774516648] [2021-11-25 20:33:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:28,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:28,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774516648] [2021-11-25 20:33:28,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774516648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:28,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:28,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:33:28,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920351753] [2021-11-25 20:33:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:28,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:33:28,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:33:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:28,945 INFO L87 Difference]: Start difference. First operand 749 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:29,043 INFO L93 Difference]: Finished difference Result 1103 states and 4353 transitions. [2021-11-25 20:33:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:33:29,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 20:33:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:29,057 INFO L225 Difference]: With dead ends: 1103 [2021-11-25 20:33:29,057 INFO L226 Difference]: Without dead ends: 1073 [2021-11-25 20:33:29,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:29,059 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:29,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-11-25 20:33:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 979. [2021-11-25 20:33:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 4.04601226993865) internal successors, (3957), 978 states have internal predecessors, (3957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3957 transitions. [2021-11-25 20:33:29,139 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3957 transitions. Word has length 30 [2021-11-25 20:33:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:29,139 INFO L470 AbstractCegarLoop]: Abstraction has 979 states and 3957 transitions. [2021-11-25 20:33:29,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3957 transitions. [2021-11-25 20:33:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 20:33:29,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:29,147 INFO L514 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] [2021-11-25 20:33:29,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:33:29,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1237536184, now seen corresponding path program 1 times [2021-11-25 20:33:29,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:29,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6187240] [2021-11-25 20:33:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:29,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:29,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:29,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6187240] [2021-11-25 20:33:29,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6187240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:29,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:29,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:33:29,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365796068] [2021-11-25 20:33:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:29,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:33:29,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:33:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:29,281 INFO L87 Difference]: Start difference. First operand 979 states and 3957 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:29,405 INFO L93 Difference]: Finished difference Result 1329 states and 5116 transitions. [2021-11-25 20:33:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:33:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-25 20:33:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:29,422 INFO L225 Difference]: With dead ends: 1329 [2021-11-25 20:33:29,422 INFO L226 Difference]: Without dead ends: 1271 [2021-11-25 20:33:29,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:33:29,426 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:29,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-11-25 20:33:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1149. [2021-11-25 20:33:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 3.9634146341463414) internal successors, (4550), 1148 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 4550 transitions. [2021-11-25 20:33:29,500 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 4550 transitions. Word has length 30 [2021-11-25 20:33:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:29,501 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 4550 transitions. [2021-11-25 20:33:29,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 4550 transitions. [2021-11-25 20:33:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 20:33:29,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:29,508 INFO L514 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] [2021-11-25 20:33:29,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:33:29,508 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1591544778, now seen corresponding path program 1 times [2021-11-25 20:33:29,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:29,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265182164] [2021-11-25 20:33:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:29,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:33:29,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265182164] [2021-11-25 20:33:29,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265182164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:29,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:29,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:33:29,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310369447] [2021-11-25 20:33:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:29,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:33:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:33:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:33:29,621 INFO L87 Difference]: Start difference. First operand 1149 states and 4550 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:29,812 INFO L93 Difference]: Finished difference Result 2220 states and 8210 transitions. [2021-11-25 20:33:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:33:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 20:33:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:29,840 INFO L225 Difference]: With dead ends: 2220 [2021-11-25 20:33:29,840 INFO L226 Difference]: Without dead ends: 2116 [2021-11-25 20:33:29,840 INFO L932 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 [2021-11-25 20:33:29,842 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:29,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 23 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2021-11-25 20:33:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1389. [2021-11-25 20:33:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 3.9373198847262247) internal successors, (5465), 1388 states have internal predecessors, (5465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 5465 transitions. [2021-11-25 20:33:29,944 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 5465 transitions. Word has length 31 [2021-11-25 20:33:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:29,944 INFO L470 AbstractCegarLoop]: Abstraction has 1389 states and 5465 transitions. [2021-11-25 20:33:29,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 5465 transitions. [2021-11-25 20:33:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 20:33:29,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:29,954 INFO L514 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] [2021-11-25 20:33:29,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:33:29,955 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -673522948, now seen corresponding path program 1 times [2021-11-25 20:33:29,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:29,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928617977] [2021-11-25 20:33:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:29,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:33:30,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928617977] [2021-11-25 20:33:30,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928617977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:30,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:30,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:33:30,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006694385] [2021-11-25 20:33:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:30,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:33:30,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:33:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:33:30,042 INFO L87 Difference]: Start difference. First operand 1389 states and 5465 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:30,202 INFO L93 Difference]: Finished difference Result 2065 states and 7737 transitions. [2021-11-25 20:33:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:33:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 20:33:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:30,222 INFO L225 Difference]: With dead ends: 2065 [2021-11-25 20:33:30,223 INFO L226 Difference]: Without dead ends: 1889 [2021-11-25 20:33:30,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:33:30,224 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:30,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 18 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2021-11-25 20:33:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1701. [2021-11-25 20:33:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 3.91) internal successors, (6647), 1700 states have internal predecessors, (6647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 6647 transitions. [2021-11-25 20:33:30,311 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 6647 transitions. Word has length 31 [2021-11-25 20:33:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:30,311 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 6647 transitions. [2021-11-25 20:33:30,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 6647 transitions. [2021-11-25 20:33:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:33:30,319 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:30,319 INFO L514 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] [2021-11-25 20:33:30,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:33:30,319 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1457288638, now seen corresponding path program 1 times [2021-11-25 20:33:30,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006884186] [2021-11-25 20:33:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:30,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:33:30,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006884186] [2021-11-25 20:33:30,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006884186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:30,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:30,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:33:30,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114385693] [2021-11-25 20:33:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:30,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:30,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:33:30,508 INFO L87 Difference]: Start difference. First operand 1701 states and 6647 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:30,748 INFO L93 Difference]: Finished difference Result 2673 states and 9972 transitions. [2021-11-25 20:33:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:33:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-25 20:33:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:30,774 INFO L225 Difference]: With dead ends: 2673 [2021-11-25 20:33:30,774 INFO L226 Difference]: Without dead ends: 2544 [2021-11-25 20:33:30,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:33:30,776 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:30,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 4 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2021-11-25 20:33:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1703. [2021-11-25 20:33:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 3.9071680376028204) internal successors, (6650), 1702 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 6650 transitions. [2021-11-25 20:33:30,881 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 6650 transitions. Word has length 32 [2021-11-25 20:33:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:30,882 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 6650 transitions. [2021-11-25 20:33:30,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 6650 transitions. [2021-11-25 20:33:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-25 20:33:30,890 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:30,890 INFO L514 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] [2021-11-25 20:33:30,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:33:30,891 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash -118667014, now seen corresponding path program 1 times [2021-11-25 20:33:30,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265844982] [2021-11-25 20:33:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:30,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:33:31,075 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265844982] [2021-11-25 20:33:31,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265844982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:31,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:31,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:33:31,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659644931] [2021-11-25 20:33:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:31,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:31,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:33:31,077 INFO L87 Difference]: Start difference. First operand 1703 states and 6650 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:31,292 INFO L93 Difference]: Finished difference Result 1945 states and 7331 transitions. [2021-11-25 20:33:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:33:31,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-25 20:33:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:31,310 INFO L225 Difference]: With dead ends: 1945 [2021-11-25 20:33:31,310 INFO L226 Difference]: Without dead ends: 1794 [2021-11-25 20:33:31,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:33:31,312 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:31,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 5 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2021-11-25 20:33:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1704. [2021-11-25 20:33:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.9048737522019965) internal successors, (6650), 1703 states have internal predecessors, (6650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 6650 transitions. [2021-11-25 20:33:31,393 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 6650 transitions. Word has length 32 [2021-11-25 20:33:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:31,394 INFO L470 AbstractCegarLoop]: Abstraction has 1704 states and 6650 transitions. [2021-11-25 20:33:31,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 6650 transitions. [2021-11-25 20:33:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 20:33:31,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:31,401 INFO L514 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] [2021-11-25 20:33:31,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:33:31,402 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash -153779052, now seen corresponding path program 1 times [2021-11-25 20:33:31,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:31,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565018064] [2021-11-25 20:33:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:31,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:33:31,616 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:31,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565018064] [2021-11-25 20:33:31,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565018064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:31,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:31,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:33:31,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479930821] [2021-11-25 20:33:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:31,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:31,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:33:31,619 INFO L87 Difference]: Start difference. First operand 1704 states and 6650 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:31,856 INFO L93 Difference]: Finished difference Result 1864 states and 7200 transitions. [2021-11-25 20:33:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:33:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 20:33:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:31,872 INFO L225 Difference]: With dead ends: 1864 [2021-11-25 20:33:31,872 INFO L226 Difference]: Without dead ends: 1493 [2021-11-25 20:33:31,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:33:31,873 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:31,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 2 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-11-25 20:33:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1253. [2021-11-25 20:33:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.9400958466453675) internal successors, (4933), 1252 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4933 transitions. [2021-11-25 20:33:31,959 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4933 transitions. Word has length 33 [2021-11-25 20:33:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:31,960 INFO L470 AbstractCegarLoop]: Abstraction has 1253 states and 4933 transitions. [2021-11-25 20:33:31,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4933 transitions. [2021-11-25 20:33:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 20:33:31,968 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:31,969 INFO L514 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] [2021-11-25 20:33:31,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:33:31,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1921340672, now seen corresponding path program 1 times [2021-11-25 20:33:31,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:31,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265337845] [2021-11-25 20:33:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:31,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:33:32,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:32,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265337845] [2021-11-25 20:33:32,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265337845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:32,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:33:32,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 20:33:32,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149082487] [2021-11-25 20:33:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:32,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:32,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:33:32,149 INFO L87 Difference]: Start difference. First operand 1253 states and 4933 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:32,285 INFO L93 Difference]: Finished difference Result 1131 states and 4313 transitions. [2021-11-25 20:33:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:33:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-25 20:33:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:32,293 INFO L225 Difference]: With dead ends: 1131 [2021-11-25 20:33:32,293 INFO L226 Difference]: Without dead ends: 890 [2021-11-25 20:33:32,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:33:32,294 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:32,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:33:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-11-25 20:33:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-11-25 20:33:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.953880764904387) internal successors, (3515), 889 states have internal predecessors, (3515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3515 transitions. [2021-11-25 20:33:32,333 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3515 transitions. Word has length 33 [2021-11-25 20:33:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:32,333 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 3515 transitions. [2021-11-25 20:33:32,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3515 transitions. [2021-11-25 20:33:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-25 20:33:32,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:32,338 INFO L514 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] [2021-11-25 20:33:32,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:33:32,338 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1575685074, now seen corresponding path program 1 times [2021-11-25 20:33:32,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:32,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873869944] [2021-11-25 20:33:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:32,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:32,424 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873869944] [2021-11-25 20:33:32,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873869944] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262230453] [2021-11-25 20:33:32,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:32,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:32,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:33:32,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:33:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:32,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 20:33:32,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:33:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:32,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:33:32,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262230453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:33:32,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:33:32,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-25 20:33:32,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650241523] [2021-11-25 20:33:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:32,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:33:32,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:33:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:33:32,716 INFO L87 Difference]: Start difference. First operand 890 states and 3515 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:32,914 INFO L93 Difference]: Finished difference Result 1632 states and 6503 transitions. [2021-11-25 20:33:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:33:32,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-25 20:33:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:32,924 INFO L225 Difference]: With dead ends: 1632 [2021-11-25 20:33:32,925 INFO L226 Difference]: Without dead ends: 1632 [2021-11-25 20:33:32,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:33:32,926 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:32,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 24 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2021-11-25 20:33:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1068. [2021-11-25 20:33:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 3.980318650421743) internal successors, (4247), 1067 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 4247 transitions. [2021-11-25 20:33:33,020 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 4247 transitions. Word has length 35 [2021-11-25 20:33:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:33,020 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 4247 transitions. [2021-11-25 20:33:33,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 4247 transitions. [2021-11-25 20:33:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-25 20:33:33,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:33,027 INFO L514 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] [2021-11-25 20:33:33,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:33:33,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 20:33:33,250 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2106468822, now seen corresponding path program 1 times [2021-11-25 20:33:33,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458687227] [2021-11-25 20:33:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:33,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:33,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458687227] [2021-11-25 20:33:33,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458687227] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459628166] [2021-11-25 20:33:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:33,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:33,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:33:33,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:33:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:33,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 20:33:33,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:33:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:33:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:33:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:33:33,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459628166] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:33,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 20:33:33,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 9 [2021-11-25 20:33:33,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104344129] [2021-11-25 20:33:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:33,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:33,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:33:33,927 INFO L87 Difference]: Start difference. First operand 1068 states and 4247 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:34,221 INFO L93 Difference]: Finished difference Result 1644 states and 6441 transitions. [2021-11-25 20:33:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:33:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-25 20:33:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:34,231 INFO L225 Difference]: With dead ends: 1644 [2021-11-25 20:33:34,231 INFO L226 Difference]: Without dead ends: 1644 [2021-11-25 20:33:34,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:33:34,232 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:34,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 23 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2021-11-25 20:33:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1046. [2021-11-25 20:33:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 3.9473684210526314) internal successors, (4125), 1045 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 4125 transitions. [2021-11-25 20:33:34,293 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 4125 transitions. Word has length 35 [2021-11-25 20:33:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:34,294 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 4125 transitions. [2021-11-25 20:33:34,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 4125 transitions. [2021-11-25 20:33:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-25 20:33:34,299 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:34,300 INFO L514 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] [2021-11-25 20:33:34,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:33:34,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:34,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1694680430, now seen corresponding path program 2 times [2021-11-25 20:33:34,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:34,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343321381] [2021-11-25 20:33:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:34,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:34,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:34,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343321381] [2021-11-25 20:33:34,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343321381] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:34,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750782976] [2021-11-25 20:33:34,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:33:34,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:34,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:34,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:33:34,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:33:34,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:33:34,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:33:34,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:33:34,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:33:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:35,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:33:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:33:35,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750782976] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:35,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 20:33:35,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2021-11-25 20:33:35,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022518234] [2021-11-25 20:33:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:33:35,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:33:35,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:33:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:33:35,259 INFO L87 Difference]: Start difference. First operand 1046 states and 4125 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:35,518 INFO L93 Difference]: Finished difference Result 1090 states and 4285 transitions. [2021-11-25 20:33:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:33:35,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-25 20:33:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:35,525 INFO L225 Difference]: With dead ends: 1090 [2021-11-25 20:33:35,526 INFO L226 Difference]: Without dead ends: 1090 [2021-11-25 20:33:35,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-25 20:33:35,527 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 64 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:35,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 7 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:33:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-11-25 20:33:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 966. [2021-11-25 20:33:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 3.9181347150259067) internal successors, (3781), 965 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3781 transitions. [2021-11-25 20:33:35,576 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 3781 transitions. Word has length 35 [2021-11-25 20:33:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:35,577 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 3781 transitions. [2021-11-25 20:33:35,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 3781 transitions. [2021-11-25 20:33:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:33:35,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:35,601 INFO L514 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] [2021-11-25 20:33:35,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:33:35,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 20:33:35,802 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:33:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:35,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1851198124, now seen corresponding path program 1 times [2021-11-25 20:33:35,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:35,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106762973] [2021-11-25 20:33:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:35,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:38,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106762973] [2021-11-25 20:33:38,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106762973] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610183275] [2021-11-25 20:33:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:38,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:38,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:33:38,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:33:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 79 conjunts are in the unsatisfiable core [2021-11-25 20:33:38,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:33:40,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:40,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:40,190 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:33:40,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:33:40,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:33:40,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:40,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:40,701 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:33:40,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2021-11-25 20:33:40,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:33:40,946 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:40,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2021-11-25 20:33:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:33:41,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:33:41,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (forall ((v_ArrVal_606 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 0))) is different from false [2021-11-25 20:33:41,272 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (and (forall ((v_ArrVal_606 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))) (<= c_~n1~0 c_~q1_front~0)) is different from false [2021-11-25 20:33:41,330 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0)))) is different from false [2021-11-25 20:33:42,010 INFO L354 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-11-25 20:33:42,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 504 treesize of output 621 [2021-11-25 20:33:42,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 341 [2021-11-25 20:33:42,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:42,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 322 [2021-11-25 20:33:42,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:42,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 286 [2021-11-25 20:33:42,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 245 [2021-11-25 20:33:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-11-25 20:33:52,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610183275] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:33:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [113507871] [2021-11-25 20:33:52,655 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:33:52,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:33:52,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 35 [2021-11-25 20:33:52,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692954117] [2021-11-25 20:33:52,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:33:52,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 20:33:52,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:52,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 20:33:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1017, Unknown=8, NotChecked=198, Total=1332 [2021-11-25 20:33:52,671 INFO L87 Difference]: Start difference. First operand 966 states and 3781 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:03,641 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~q1_front~0 0)) (.cse1 (<= c_~n1~0 c_~q1_front~0)) (.cse2 (< c_~q2_back~0 0))) (and (or (and (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= (* 4 c_~q2_front~0) (* 4 c_~q2_back~0)) (< 0 (+ c_~total~0 1)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (* 4 c_~i~0) (* 4 c_~j~0)) (= (* 4 c_~q1_front~0) (* 4 c_~q1_back~0)) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= c_~total~0 0)) .cse0 .cse1 (<= c_~n1~0 c_~q1_back~0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~q1_back~0 0) (<= 1 c_~q2_back~0) .cse2) (or .cse0 .cse1 (<= c_~n2~0 c_~q2_back~0) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse3 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (<= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_605))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_606) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse4 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) .cse2))) is different from false [2021-11-25 20:34:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:34:04,775 INFO L93 Difference]: Finished difference Result 5642 states and 22415 transitions. [2021-11-25 20:34:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 20:34:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:34:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:34:04,810 INFO L225 Difference]: With dead ends: 5642 [2021-11-25 20:34:04,810 INFO L226 Difference]: Without dead ends: 5601 [2021-11-25 20:34:04,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=657, Invalid=4939, Unknown=120, NotChecked=604, Total=6320 [2021-11-25 20:34:04,813 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 591 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1720 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:34:04,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 1 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1828 Invalid, 0 Unknown, 1720 Unchecked, 2.3s Time] [2021-11-25 20:34:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5601 states. [2021-11-25 20:34:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5601 to 1872. [2021-11-25 20:34:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 4.047033671833244) internal successors, (7572), 1871 states have internal predecessors, (7572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 7572 transitions. [2021-11-25 20:34:04,961 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 7572 transitions. Word has length 37 [2021-11-25 20:34:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:34:04,961 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 7572 transitions. [2021-11-25 20:34:04,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 7572 transitions. [2021-11-25 20:34:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:34:04,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:34:04,972 INFO L514 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] [2021-11-25 20:34:05,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:05,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 20:34:05,186 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:34:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:34:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1025123252, now seen corresponding path program 2 times [2021-11-25 20:34:05,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:34:05,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114890407] [2021-11-25 20:34:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:34:05,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:34:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:34:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:34:07,455 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:34:07,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114890407] [2021-11-25 20:34:07,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114890407] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:34:07,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21304108] [2021-11-25 20:34:07,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:34:07,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:34:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:34:07,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:34:07,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:34:07,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:34:07,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:34:07,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 20:34:07,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:34:08,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:08,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:08,830 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:34:08,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:34:08,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:34:09,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:09,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:09,210 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:34:09,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2021-11-25 20:34:09,439 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:09,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-11-25 20:34:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:34:09,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:34:09,667 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_684 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0) 0)) (forall ((v_ArrVal_684 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 1)))) is different from false [2021-11-25 20:34:09,696 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_684 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0)) (forall ((v_ArrVal_684 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0)) is different from false [2021-11-25 20:34:10,454 INFO L354 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-11-25 20:34:10,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 748 treesize of output 817 [2021-11-25 20:34:10,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 561 treesize of output 513 [2021-11-25 20:34:10,517 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:10,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 513 treesize of output 494 [2021-11-25 20:34:10,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:10,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 477 treesize of output 422 [2021-11-25 20:34:10,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 381 [2021-11-25 20:34:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2021-11-25 20:34:19,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21304108] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:34:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2135659599] [2021-11-25 20:34:19,404 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:34:19,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:34:19,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 35 [2021-11-25 20:34:19,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011540615] [2021-11-25 20:34:19,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:34:19,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 20:34:19,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:34:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 20:34:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1045, Unknown=45, NotChecked=134, Total=1332 [2021-11-25 20:34:19,409 INFO L87 Difference]: Start difference. First operand 1872 states and 7572 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:23,780 WARN L838 $PredicateComparison]: unable to prove that (and (or (< c_~q1_front~0 0) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_683))) (+ c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (< 0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_683))) (+ c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_684) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1))))) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) (< 0 (+ c_~total~0 1)) (<= c_~total~0 0)) is different from false [2021-11-25 20:34:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:34:31,885 INFO L93 Difference]: Finished difference Result 7250 states and 29327 transitions. [2021-11-25 20:34:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-25 20:34:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:34:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:34:31,927 INFO L225 Difference]: With dead ends: 7250 [2021-11-25 20:34:31,927 INFO L226 Difference]: Without dead ends: 7189 [2021-11-25 20:34:31,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=780, Invalid=4771, Unknown=161, NotChecked=450, Total=6162 [2021-11-25 20:34:31,930 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 607 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3049 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:34:31,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 6 Invalid, 4902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1713 Invalid, 0 Unknown, 3049 Unchecked, 2.1s Time] [2021-11-25 20:34:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7189 states. [2021-11-25 20:34:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7189 to 2086. [2021-11-25 20:34:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 4.09304556354916) internal successors, (8534), 2085 states have internal predecessors, (8534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 8534 transitions. [2021-11-25 20:34:32,148 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 8534 transitions. Word has length 37 [2021-11-25 20:34:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:34:32,149 INFO L470 AbstractCegarLoop]: Abstraction has 2086 states and 8534 transitions. [2021-11-25 20:34:32,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 36 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:34:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 8534 transitions. [2021-11-25 20:34:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:34:32,158 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:34:32,158 INFO L514 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] [2021-11-25 20:34:32,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:34:32,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:34:32,386 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:34:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:34:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -548671752, now seen corresponding path program 3 times [2021-11-25 20:34:32,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:34:32,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824907667] [2021-11-25 20:34:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:34:32,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:34:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:34:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:34:33,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:34:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824907667] [2021-11-25 20:34:33,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824907667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:34:33,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175532032] [2021-11-25 20:34:33,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:34:33,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:34:33,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:34:33,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:34:33,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:34:33,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:34:33,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:34:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-25 20:34:33,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:34:33,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:33,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:33,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:33,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,024 INFO L354 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2021-11-25 20:34:34,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 43 [2021-11-25 20:34:34,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,297 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-11-25 20:34:34,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2021-11-25 20:34:34,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:34:34,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:34,677 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-11-25 20:34:34,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 32 [2021-11-25 20:34:34,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:34:35,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:34:35,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:34:35,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:35,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:35,954 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 20:34:35,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:34:35,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:34:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:36,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:34:36,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2021-11-25 20:34:37,359 INFO L354 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2021-11-25 20:34:37,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 17 [2021-11-25 20:34:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:34:37,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:34:37,639 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (and (forall ((v_ArrVal_773 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_773 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n1~0 c_~q1_front~0) (< c_~q2_front~0 0)) is different from false [2021-11-25 20:34:37,726 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (< c_~q2_front~0 0) (and (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (<= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0)) (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (< 0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)))))) is different from false [2021-11-25 20:34:37,791 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (< c_~q2_front~0 0) (and (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (<= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0)) (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (< 0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1))))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:34:37,958 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (<= c_~n1~0 c_~q1_back~0) (< c_~q2_front~0 0) (forall ((~f~0.base Int)) (let ((.cse0 (select |c_#memory_int| ~f~0.base))) (or (not (= (select .cse0 (+ (* c_~i~0 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select .cse0 (+ (* c_~j~0 4) c_~f~0.offset))) 0))))) (and (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (<= (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0)) (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (< 0 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_773))) (+ (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select .cse2 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1))))) (< c_~q1_back~0 0) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:34:39,480 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:39,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 193 [2021-11-25 20:34:39,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:39,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1403590 treesize of output 1379030 [2021-11-25 20:34:44,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:44,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1379030 treesize of output 1304562 [2021-11-25 20:34:49,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:49,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1304562 treesize of output 1286110 [2021-11-25 20:34:54,004 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:34:54,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1286110 treesize of output 1248986 [2021-11-25 20:35:02,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:02,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1245165 treesize of output 1146878 [2021-11-25 20:35:07,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:07,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1146861 treesize of output 950270 [2021-11-25 20:35:11,569 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:11,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 950253 treesize of output 901118 [2021-11-25 20:35:16,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:16,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 901101 treesize of output 802814 [2021-11-25 20:35:20,440 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:35:20,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [762540707] [2021-11-25 20:35:20,441 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:35:20,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:35:20,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-25 20:35:20,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20567579] [2021-11-25 20:35:20,443 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:35:20,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:35:20,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:35:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:35:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=873, Unknown=10, NotChecked=252, Total=1260 [2021-11-25 20:35:20,445 INFO L87 Difference]: Start difference. First operand 2086 states and 8534 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:35:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:35:21,994 INFO L93 Difference]: Finished difference Result 3080 states and 12560 transitions. [2021-11-25 20:35:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:35:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:35:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:35:22,009 INFO L225 Difference]: With dead ends: 3080 [2021-11-25 20:35:22,010 INFO L226 Difference]: Without dead ends: 3063 [2021-11-25 20:35:22,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=164, Invalid=1248, Unknown=10, NotChecked=300, Total=1722 [2021-11-25 20:35:22,011 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 92 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:35:22,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 14 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:35:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2021-11-25 20:35:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2157. [2021-11-25 20:35:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 4.090909090909091) internal successors, (8820), 2156 states have internal predecessors, (8820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:35:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8820 transitions. [2021-11-25 20:35:22,118 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8820 transitions. Word has length 37 [2021-11-25 20:35:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:35:22,119 INFO L470 AbstractCegarLoop]: Abstraction has 2157 states and 8820 transitions. [2021-11-25 20:35:22,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:35:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8820 transitions. [2021-11-25 20:35:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:35:22,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:35:22,127 INFO L514 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] [2021-11-25 20:35:22,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:35:22,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 20:35:22,354 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:35:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:35:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash -362007086, now seen corresponding path program 4 times [2021-11-25 20:35:22,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:35:22,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320399719] [2021-11-25 20:35:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:35:22,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:35:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:35:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:35:24,936 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:35:24,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320399719] [2021-11-25 20:35:24,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320399719] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:35:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799566619] [2021-11-25 20:35:24,937 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:35:24,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:35:24,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:35:24,939 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:35:24,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:35:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:35:25,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 88 conjunts are in the unsatisfiable core [2021-11-25 20:35:25,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:35:25,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:35:25,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:35:25,693 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:35:25,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 20:35:25,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:35:25,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:35:26,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:35:26,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:35:26,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:35:26,791 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:35:26,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:35:26,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:35:26,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:35:26,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:35:27,000 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:35:27,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2021-11-25 20:35:27,366 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:27,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-11-25 20:35:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:35:27,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:35:27,716 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_857 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0)) 0)) (forall ((v_ArrVal_857 (Array Int Int))) (< 0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 1)))))) is different from false [2021-11-25 20:35:27,758 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (<= (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0)) is different from false [2021-11-25 20:35:27,806 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (<= (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:35:27,960 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_857 (Array Int Int))) (<= (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_857))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (<= c_~n1~0 c_~q1_back~0) (forall ((~f~0.base Int)) (let ((.cse2 (select |c_#memory_int| ~f~0.base))) (or (not (= (select .cse2 (+ (* c_~i~0 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select .cse2 (+ (* c_~j~0 4) c_~f~0.offset))) 0))))) (< c_~q1_back~0 0) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:35:29,442 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:29,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 193 [2021-11-25 20:35:29,826 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:29,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1882470 treesize of output 1849606 [2021-11-25 20:35:35,104 WARN L227 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 2196 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:35:35,428 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:35,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1849606 treesize of output 1750242 [2021-11-25 20:35:40,814 WARN L227 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 2238 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:35:41,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:41,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1750242 treesize of output 1725566 [2021-11-25 20:35:46,422 WARN L227 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 2280 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:35:46,706 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:46,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1725566 treesize of output 1675994 [2021-11-25 20:35:52,062 WARN L227 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 2322 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:35:57,418 WARN L227 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 2317 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:35:57,540 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:35:57,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1671149 treesize of output 1474558 [2021-11-25 20:36:02,904 WARN L227 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 2319 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:36:03,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:03,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1474541 treesize of output 1376254 [2021-11-25 20:36:08,314 WARN L227 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 2321 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:36:08,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:08,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1376237 treesize of output 1179646 [2021-11-25 20:36:13,754 WARN L227 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 2323 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:36:13,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:13,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1179629 treesize of output 1081342 [2021-11-25 20:36:19,392 WARN L227 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 2325 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:36:19,426 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:36:19,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356219890] [2021-11-25 20:36:19,427 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:36:19,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:36:19,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-25 20:36:19,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038124897] [2021-11-25 20:36:19,429 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:36:19,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:36:19,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:36:19,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:36:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1003, Unknown=10, NotChecked=268, Total=1406 [2021-11-25 20:36:19,431 INFO L87 Difference]: Start difference. First operand 2157 states and 8820 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:36:21,405 INFO L93 Difference]: Finished difference Result 2746 states and 11216 transitions. [2021-11-25 20:36:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:36:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:36:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:36:21,420 INFO L225 Difference]: With dead ends: 2746 [2021-11-25 20:36:21,420 INFO L226 Difference]: Without dead ends: 2729 [2021-11-25 20:36:21,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=163, Invalid=1483, Unknown=10, NotChecked=324, Total=1980 [2021-11-25 20:36:21,422 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:36:21,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 14 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:36:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2021-11-25 20:36:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2244. [2021-11-25 20:36:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2243 states have (on average 4.090949621043245) internal successors, (9176), 2243 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 9176 transitions. [2021-11-25 20:36:21,533 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 9176 transitions. Word has length 37 [2021-11-25 20:36:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:36:21,534 INFO L470 AbstractCegarLoop]: Abstraction has 2244 states and 9176 transitions. [2021-11-25 20:36:21,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 9176 transitions. [2021-11-25 20:36:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:36:21,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:36:21,542 INFO L514 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] [2021-11-25 20:36:21,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:36:21,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 20:36:21,769 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:36:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:36:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -51522076, now seen corresponding path program 5 times [2021-11-25 20:36:21,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:36:21,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296817798] [2021-11-25 20:36:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:36:21,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:36:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:36:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:36:23,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:36:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296817798] [2021-11-25 20:36:23,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296817798] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:36:23,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614915983] [2021-11-25 20:36:23,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:36:23,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:36:23,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:36:23,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:36:23,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:36:24,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 20:36:24,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:36:24,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-25 20:36:24,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:36:25,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:25,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:25,055 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:36:25,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:36:25,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:36:25,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:25,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:25,611 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:36:25,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-11-25 20:36:27,027 INFO L354 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2021-11-25 20:36:27,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 34 [2021-11-25 20:36:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:36:27,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:36:28,358 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_935 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (forall ((v_ArrVal_935 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 0))) is different from false [2021-11-25 20:36:28,390 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_935 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0)) (forall ((v_ArrVal_935 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))))))) is different from false [2021-11-25 20:36:28,439 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_934))) (+ c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)))) (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_934))) (+ c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0)) is different from false [2021-11-25 20:36:28,995 INFO L354 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-11-25 20:36:28,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 984 treesize of output 1005 [2021-11-25 20:36:29,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 701 [2021-11-25 20:36:29,068 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:29,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 701 treesize of output 646 [2021-11-25 20:36:29,107 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:29,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 574 [2021-11-25 20:36:29,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 557 treesize of output 509 [2021-11-25 20:36:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2021-11-25 20:36:33,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614915983] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:36:33,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1380778853] [2021-11-25 20:36:33,719 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:36:33,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:36:33,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 33 [2021-11-25 20:36:33,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755193291] [2021-11-25 20:36:33,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:36:33,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 20:36:33,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:36:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 20:36:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=906, Unknown=5, NotChecked=186, Total=1190 [2021-11-25 20:36:33,722 INFO L87 Difference]: Start difference. First operand 2244 states and 9176 transitions. Second operand has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:37,909 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (+ c_~total~0 1)) (or (and (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_934))) (+ c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)))) (forall ((v_ArrVal_935 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_934))) (+ c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_935) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) 0))) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0)) (<= c_~total~0 0)) is different from false [2021-11-25 20:36:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:36:45,104 INFO L93 Difference]: Finished difference Result 6077 states and 25408 transitions. [2021-11-25 20:36:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-25 20:36:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:36:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:36:45,126 INFO L225 Difference]: With dead ends: 6077 [2021-11-25 20:36:45,127 INFO L226 Difference]: Without dead ends: 6064 [2021-11-25 20:36:45,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=443, Invalid=3719, Unknown=14, NotChecked=516, Total=4692 [2021-11-25 20:36:45,129 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 593 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4255 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:36:45,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 30 Invalid, 5763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1400 Invalid, 0 Unknown, 4255 Unchecked, 1.4s Time] [2021-11-25 20:36:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2021-11-25 20:36:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 2629. [2021-11-25 20:36:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 3.9969558599695585) internal successors, (10504), 2628 states have internal predecessors, (10504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 10504 transitions. [2021-11-25 20:36:45,267 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 10504 transitions. Word has length 37 [2021-11-25 20:36:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:36:45,268 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 10504 transitions. [2021-11-25 20:36:45,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:36:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 10504 transitions. [2021-11-25 20:36:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:36:45,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:36:45,277 INFO L514 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] [2021-11-25 20:36:45,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:36:45,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 20:36:45,493 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:36:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:36:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1027755232, now seen corresponding path program 6 times [2021-11-25 20:36:45,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:36:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086418695] [2021-11-25 20:36:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:36:45,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:36:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:36:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:36:48,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:36:48,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086418695] [2021-11-25 20:36:48,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086418695] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:36:48,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293599455] [2021-11-25 20:36:48,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:36:48,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:36:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:36:48,024 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:36:48,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:36:48,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:36:48,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:36:48,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 93 conjunts are in the unsatisfiable core [2021-11-25 20:36:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:36:48,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:48,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:48,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:48,293 INFO L354 Elim1Store]: treesize reduction 86, result has 32.8 percent of original size [2021-11-25 20:36:48,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 47 [2021-11-25 20:36:48,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:36:48,544 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-25 20:36:48,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-25 20:36:48,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:36:48,947 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-25 20:36:48,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-11-25 20:36:49,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:36:49,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:36:49,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:36:50,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:50,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:36:50,110 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 20:36:50,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:36:50,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:36:51,141 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 20:36:51,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2021-11-25 20:36:51,214 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-25 20:36:51,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2021-11-25 20:36:51,416 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-25 20:36:51,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2021-11-25 20:36:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:36:51,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:36:51,751 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (and (forall ((v_ArrVal_1026 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0)) (forall ((v_ArrVal_1026 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))) (<= c_~n1~0 c_~q1_front~0) (< c_~q2_front~0 0)) is different from false [2021-11-25 20:36:51,808 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (< c_~q2_front~0 0)) is different from false [2021-11-25 20:36:51,844 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n2~0 c_~q2_back~0) (< c_~q2_front~0 0) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:36:51,994 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025))) (+ (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1026) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n2~0 c_~q2_back~0) (<= c_~n1~0 c_~q1_back~0) (< c_~q2_front~0 0) (forall ((~f~0.base Int)) (let ((.cse2 (select |c_#memory_int| ~f~0.base))) (or (not (= (select .cse2 (+ (* c_~i~0 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select .cse2 (+ (* c_~j~0 4) c_~f~0.offset))) 0))))) (< c_~q1_back~0 0) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:36:58,318 INFO L354 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2021-11-25 20:36:58,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 463 treesize of output 217 [2021-11-25 20:36:58,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:36:58,814 INFO L354 Elim1Store]: treesize reduction 234, result has 51.7 percent of original size [2021-11-25 20:36:58,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 78364 treesize of output 75725 [2021-11-25 20:36:59,266 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:36:59,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75725 treesize of output 74673 [2021-11-25 20:36:59,884 INFO L354 Elim1Store]: treesize reduction 76, result has 65.6 percent of original size [2021-11-25 20:36:59,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74673 treesize of output 68257 [2021-11-25 20:37:00,494 INFO L354 Elim1Store]: treesize reduction 76, result has 65.6 percent of original size [2021-11-25 20:37:00,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68257 treesize of output 65121 [2021-11-25 20:37:01,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62189 treesize of output 56045 [2021-11-25 20:37:01,718 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:37:01,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56045 treesize of output 46846 [2021-11-25 20:37:02,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:37:02,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46829 treesize of output 44542 [2021-11-25 20:37:02,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44525 treesize of output 42989 [2021-11-25 20:37:02,940 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:37:02,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60376677] [2021-11-25 20:37:02,941 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:37:02,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:37:02,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 20:37:02,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069471711] [2021-11-25 20:37:02,942 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:37:02,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:37:02,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:37:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1193, Unknown=12, NotChecked=292, Total=1640 [2021-11-25 20:37:02,944 INFO L87 Difference]: Start difference. First operand 2629 states and 10504 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:37:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:04,876 INFO L93 Difference]: Finished difference Result 3789 states and 15375 transitions. [2021-11-25 20:37:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:37:04,877 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:37:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:04,889 INFO L225 Difference]: With dead ends: 3789 [2021-11-25 20:37:04,890 INFO L226 Difference]: Without dead ends: 3764 [2021-11-25 20:37:04,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=184, Invalid=1626, Unknown=12, NotChecked=340, Total=2162 [2021-11-25 20:37:04,892 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 134 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:04,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 14 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:37:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2021-11-25 20:37:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 2430. [2021-11-25 20:37:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 3.995471387402223) internal successors, (9705), 2429 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:37:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 9705 transitions. [2021-11-25 20:37:04,996 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 9705 transitions. Word has length 37 [2021-11-25 20:37:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:04,997 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 9705 transitions. [2021-11-25 20:37:04,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:37:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 9705 transitions. [2021-11-25 20:37:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:37:05,006 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:05,006 INFO L514 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] [2021-11-25 20:37:05,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:37:05,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:05,221 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:37:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1977713876, now seen corresponding path program 7 times [2021-11-25 20:37:05,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:05,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117321774] [2021-11-25 20:37:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:05,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:37:07,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:07,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117321774] [2021-11-25 20:37:07,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117321774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:07,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840660738] [2021-11-25 20:37:07,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:37:07,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:37:07,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:37:07,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:37:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:07,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 91 conjunts are in the unsatisfiable core [2021-11-25 20:37:07,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:07,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:37:08,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:37:08,215 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:37:08,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 20:37:08,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:37:08,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:37:08,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:37:09,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:37:09,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:37:09,889 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:37:09,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-11-25 20:37:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:37:11,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:37:11,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:37:11,488 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-25 20:37:11,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 50 [2021-11-25 20:37:11,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:37:12,018 INFO L354 Elim1Store]: treesize reduction 8, result has 81.4 percent of original size [2021-11-25 20:37:12,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2021-11-25 20:37:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:37:12,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:37:12,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 1))) (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0) 0))) is different from false [2021-11-25 20:37:12,312 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_1110 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))))) (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0)))) is different from false [2021-11-25 20:37:12,399 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (and (forall ((v_ArrVal_1110 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))))) (forall ((v_ArrVal_1110 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1110) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4)))) 0))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:37:15,537 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:37:15,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 193 [2021-11-25 20:37:16,117 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:37:16,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 9612390 treesize of output 9362950 [2021-11-25 20:37:43,341 WARN L227 SmtUtils]: Spent 27.21s on a formula simplification that was a NOOP. DAG size: 4443 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:37:43,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:37:43,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9362950 treesize of output 7868000 [2021-11-25 20:38:11,235 WARN L227 SmtUtils]: Spent 27.54s on a formula simplification that was a NOOP. DAG size: 4460 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:38:11,766 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:38:11,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7868000 treesize of output 7681020 [2021-11-25 20:38:39,062 WARN L227 SmtUtils]: Spent 27.29s on a formula simplification that was a NOOP. DAG size: 4502 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:38:39,543 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:38:39,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7681020 treesize of output 6932440 [2021-11-25 20:39:07,024 WARN L227 SmtUtils]: Spent 27.47s on a formula simplification that was a NOOP. DAG size: 4544 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:39:07,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:39:07,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 6932440 treesize of output 6558260 [2021-11-25 20:39:34,902 WARN L227 SmtUtils]: Spent 27.33s on a formula simplification that was a NOOP. DAG size: 4586 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:40:01,863 WARN L227 SmtUtils]: Spent 26.95s on a formula simplification that was a NOOP. DAG size: 4581 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:40:02,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6488045 treesize of output 5701613 [2021-11-25 20:40:28,705 WARN L227 SmtUtils]: Spent 26.65s on a formula simplification that was a NOOP. DAG size: 4580 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:40:28,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5701613 treesize of output 5505005 [2021-11-25 20:40:55,525 WARN L227 SmtUtils]: Spent 26.62s on a formula simplification that was a NOOP. DAG size: 4579 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 20:40:55,592 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:40:55,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1269146016] [2021-11-25 20:40:55,592 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:40:55,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:40:55,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 20:40:55,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344870266] [2021-11-25 20:40:55,594 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:40:55,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:40:55,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:40:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:40:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1075, Unknown=10, NotChecked=204, Total=1406 [2021-11-25 20:40:55,596 INFO L87 Difference]: Start difference. First operand 2430 states and 9705 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:40:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:40:57,335 INFO L93 Difference]: Finished difference Result 3328 states and 13397 transitions. [2021-11-25 20:40:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:40:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:40:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:40:57,343 INFO L225 Difference]: With dead ends: 3328 [2021-11-25 20:40:57,344 INFO L226 Difference]: Without dead ends: 3311 [2021-11-25 20:40:57,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=150, Invalid=1492, Unknown=10, NotChecked=240, Total=1892 [2021-11-25 20:40:57,345 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:40:57,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 14 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:40:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2021-11-25 20:40:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 2454. [2021-11-25 20:40:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2453 states have (on average 3.9922543823889116) internal successors, (9793), 2453 states have internal predecessors, (9793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:40:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 9793 transitions. [2021-11-25 20:40:57,437 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 9793 transitions. Word has length 37 [2021-11-25 20:40:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:40:57,438 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 9793 transitions. [2021-11-25 20:40:57,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:40:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 9793 transitions. [2021-11-25 20:40:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:40:57,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:40:57,446 INFO L514 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] [2021-11-25 20:40:57,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:40:57,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:40:57,674 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:40:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:40:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -82616456, now seen corresponding path program 8 times [2021-11-25 20:40:57,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:40:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58752930] [2021-11-25 20:40:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:40:57,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:40:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:41:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:41:00,001 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:41:00,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58752930] [2021-11-25 20:41:00,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58752930] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:41:00,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6220952] [2021-11-25 20:41:00,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:41:00,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:41:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:41:00,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:41:00,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:41:00,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:41:00,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:41:00,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-25 20:41:00,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:41:00,272 INFO L354 Elim1Store]: treesize reduction 137, result has 25.9 percent of original size [2021-11-25 20:41:00,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 211 [2021-11-25 20:41:00,533 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:41:00,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 20:41:01,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:41:01,375 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:41:01,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-11-25 20:41:01,709 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 20:41:01,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2021-11-25 20:41:01,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-25 20:41:02,024 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:41:02,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2021-11-25 20:41:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:41:02,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:41:02,308 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (and (forall ((v_ArrVal_1197 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1197 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n1~0 c_~q1_front~0)) is different from false [2021-11-25 20:41:02,356 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (and (forall ((v_ArrVal_1197 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1197 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:41:02,852 INFO L354 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-11-25 20:41:02,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1056 treesize of output 1125 [2021-11-25 20:41:02,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:41:02,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1125 treesize of output 1101 [2021-11-25 20:41:02,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:41:02,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 701 treesize of output 622 [2021-11-25 20:41:02,992 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:41:02,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 605 treesize of output 526 [2021-11-25 20:44:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2021-11-25 20:44:49,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6220952] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:44:49,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618707005] [2021-11-25 20:44:49,978 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:44:49,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:44:49,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2021-11-25 20:44:49,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371372244] [2021-11-25 20:44:49,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:44:49,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-25 20:44:49,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:44:49,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-25 20:44:49,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1156, Unknown=2, NotChecked=138, Total=1406 [2021-11-25 20:44:49,981 INFO L87 Difference]: Start difference. First operand 2454 states and 9793 transitions. Second operand has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:44:58,100 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (+ c_~total~0 1)) (or (< c_~q1_front~0 0) (and (forall ((v_ArrVal_1197 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) (forall ((v_ArrVal_1197 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1197))) (+ c_~total~0 (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) 0))) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) (<= c_~total~0 0)) is different from false [2021-11-25 20:45:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:03,961 INFO L93 Difference]: Finished difference Result 6705 states and 27225 transitions. [2021-11-25 20:45:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 20:45:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:45:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:03,978 INFO L225 Difference]: With dead ends: 6705 [2021-11-25 20:45:03,978 INFO L226 Difference]: Without dead ends: 6680 [2021-11-25 20:45:03,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=509, Invalid=3645, Unknown=18, NotChecked=384, Total=4556 [2021-11-25 20:45:03,980 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 498 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2144 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:03,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 17 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1976 Invalid, 0 Unknown, 2144 Unchecked, 2.4s Time] [2021-11-25 20:45:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2021-11-25 20:45:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 3137. [2021-11-25 20:45:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3136 states have (on average 4.048788265306122) internal successors, (12697), 3136 states have internal predecessors, (12697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 12697 transitions. [2021-11-25 20:45:04,156 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 12697 transitions. Word has length 37 [2021-11-25 20:45:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:04,157 INFO L470 AbstractCegarLoop]: Abstraction has 3137 states and 12697 transitions. [2021-11-25 20:45:04,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 12697 transitions. [2021-11-25 20:45:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:45:04,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:04,169 INFO L514 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] [2021-11-25 20:45:04,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:45:04,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:04,392 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:45:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash 104048210, now seen corresponding path program 9 times [2021-11-25 20:45:04,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:04,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854648990] [2021-11-25 20:45:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:04,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:45:06,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:06,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854648990] [2021-11-25 20:45:06,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854648990] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498694591] [2021-11-25 20:45:06,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:45:06,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:06,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:06,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:06,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 20:45:06,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:45:06,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:45:06,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-25 20:45:06,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:07,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:07,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:07,353 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:45:07,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-11-25 20:45:07,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:07,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:07,672 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-25 20:45:07,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2021-11-25 20:45:07,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:07,950 INFO L354 Elim1Store]: treesize reduction 16, result has 62.8 percent of original size [2021-11-25 20:45:07,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2021-11-25 20:45:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:45:08,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:09,020 INFO L354 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-11-25 20:45:09,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2496 treesize of output 2373 [2021-11-25 20:45:09,078 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:09,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2373 treesize of output 2205 [2021-11-25 20:45:09,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:09,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1805 treesize of output 1438 [2021-11-25 20:45:09,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:09,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1421 treesize of output 1342 [2021-11-25 20:45:09,205 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 20:45:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [127243557] [2021-11-25 20:45:09,205 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-25 20:45:09,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:45:09,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-25 20:45:09,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281966275] [2021-11-25 20:45:09,207 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 20:45:09,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-25 20:45:09,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:45:09,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-25 20:45:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=838, Unknown=2, NotChecked=0, Total=930 [2021-11-25 20:45:09,209 INFO L87 Difference]: Start difference. First operand 3137 states and 12697 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:45:11,089 INFO L93 Difference]: Finished difference Result 4035 states and 16425 transitions. [2021-11-25 20:45:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:45:11,089 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 20:45:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:45:11,101 INFO L225 Difference]: With dead ends: 4035 [2021-11-25 20:45:11,101 INFO L226 Difference]: Without dead ends: 4018 [2021-11-25 20:45:11,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=128, Invalid=1276, Unknown=2, NotChecked=0, Total=1406 [2021-11-25 20:45:11,103 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 106 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:45:11,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 14 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:45:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2021-11-25 20:45:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3172. [2021-11-25 20:45:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 4.063071586250394) internal successors, (12884), 3171 states have internal predecessors, (12884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 12884 transitions. [2021-11-25 20:45:11,216 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 12884 transitions. Word has length 37 [2021-11-25 20:45:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:45:11,216 INFO L470 AbstractCegarLoop]: Abstraction has 3172 states and 12884 transitions. [2021-11-25 20:45:11,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:45:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 12884 transitions. [2021-11-25 20:45:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 20:45:11,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:45:11,227 INFO L514 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] [2021-11-25 20:45:11,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 20:45:11,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:11,449 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-25 20:45:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:45:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1073543816, now seen corresponding path program 10 times [2021-11-25 20:45:11,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:45:11,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073307681] [2021-11-25 20:45:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:45:11,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:45:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:45:13,043 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:45:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073307681] [2021-11-25 20:45:13,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073307681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:45:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607976758] [2021-11-25 20:45:13,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:45:13,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:45:13,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:45:13,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:45:13,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9807e5e-57e0-4ffb-97b0-45f1a5359290/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 20:45:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:45:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 96 conjunts are in the unsatisfiable core [2021-11-25 20:45:13,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:45:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:13,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:13,395 INFO L354 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2021-11-25 20:45:13,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2021-11-25 20:45:13,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 20:45:13,662 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 20:45:13,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 20:45:13,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:13,963 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-25 20:45:13,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:45:14,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:14,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:15,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 20:45:17,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:17,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:17,431 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 20:45:17,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-11-25 20:45:20,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:20,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:20,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:45:20,792 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-25 20:45:20,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2021-11-25 20:45:22,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:45:22,394 INFO L354 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2021-11-25 20:45:22,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 43 [2021-11-25 20:45:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:45:22,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:45:22,690 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (and (forall ((v_ArrVal_1365 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1365))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 1)))) (forall ((v_ArrVal_1365 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1365))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0)) 0)))) is different from false [2021-11-25 20:45:22,761 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q1_front~0 0) (<= c_~n1~0 c_~q1_front~0) (<= c_~n2~0 c_~q2_back~0) (and (forall ((v_ArrVal_1365 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1365))) (+ (select (select .cse0 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0 1)))) (forall ((v_ArrVal_1365 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1365))) (+ (select (select .cse1 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) c_~total~0)) 0))) (not (= (+ (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~j~0 4) c_~f~0.offset))) 0)) (< c_~q2_back~0 0)) is different from false [2021-11-25 20:45:34,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:34,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 301 treesize of output 217 [2021-11-25 20:45:44,310 WARN L227 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-25 20:45:44,311 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:45:44,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61044438876134 treesize of output 60533136384302