./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:19:03,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:19:03,530 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:19:03,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:19:03,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:19:03,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:19:03,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:19:03,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:19:03,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:19:03,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:19:03,563 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:19:03,564 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:19:03,564 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:19:03,565 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:19:03,565 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:19:03,566 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:19:03,566 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:19:03,567 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:19:03,567 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:19:03,568 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:19:03,568 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:19:03,569 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:19:03,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:19:03,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:19:03,570 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:19:03,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:19:03,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:19:03,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:19:03,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:19:03,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:19:03,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:19:03,573 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:19:03,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:19:03,574 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:19:03,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:19:03,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:19:03,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:19:03,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:19:03,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:19:03,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:19:03,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:19:03,578 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:19:03,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:19:03,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:19:03,578 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:19:03,578 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:19:03,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:19:03,579 INFO L153 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/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_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2023-12-02 17:19:03,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:19:03,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:19:03,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:19:03,843 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:19:03,844 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:19:03,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 17:19:06,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:19:06,793 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:19:06,793 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 17:19:06,802 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/45fb9d43c/c7fe1167e29e4056b03bf5fcc6f81494/FLAGd67fd84be [2023-12-02 17:19:06,817 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/45fb9d43c/c7fe1167e29e4056b03bf5fcc6f81494 [2023-12-02 17:19:06,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:19:06,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:19:06,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:19:06,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:19:06,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:19:06,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:19:06" (1/1) ... [2023-12-02 17:19:06,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6cf9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:06, skipping insertion in model container [2023-12-02 17:19:06,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:19:06" (1/1) ... [2023-12-02 17:19:06,855 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:19:07,028 WARN L240 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 17:19:07,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:19:07,047 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:19:07,068 WARN L240 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 17:19:07,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:19:07,080 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:19:07,080 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:19:07,086 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:19:07,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07 WrapperNode [2023-12-02 17:19:07,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:19:07,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:19:07,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:19:07,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:19:07,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,117 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-12-02 17:19:07,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:19:07,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:19:07,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:19:07,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:19:07,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:19:07,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:19:07,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:19:07,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:19:07,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (1/1) ... [2023-12-02 17:19:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:19:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:07,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:19:07,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:19:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:19:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:19:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:19:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:19:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 17:19:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 17:19:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 17:19:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:19:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:19:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:19:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:19:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:19:07,203 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:19:07,304 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:19:07,306 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:19:07,567 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:19:07,770 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:19:07,770 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 17:19:07,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:19:07 BoogieIcfgContainer [2023-12-02 17:19:07,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:19:07,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:19:07,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:19:07,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:19:07,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:19:06" (1/3) ... [2023-12-02 17:19:07,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5368874a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:19:07, skipping insertion in model container [2023-12-02 17:19:07,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:19:07" (2/3) ... [2023-12-02 17:19:07,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5368874a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:19:07, skipping insertion in model container [2023-12-02 17:19:07,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:19:07" (3/3) ... [2023-12-02 17:19:07,780 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-12-02 17:19:07,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:19:07,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:19:07,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:19:07,799 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:19:07,888 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 17:19:07,918 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2023-12-02 17:19:07,977 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 17:19:07,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:19:07,996 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63ddcf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:19:07,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 17:19:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 17:19:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:19:08,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:08,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:08,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:08,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1975033521, now seen corresponding path program 1 times [2023-12-02 17:19:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373750095] [2023-12-02 17:19:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:08,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373750095] [2023-12-02 17:19:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373750095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:19:08,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:19:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:19:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739260478] [2023-12-02 17:19:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:19:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:19:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:19:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:19:08,480 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2023-12-02 17:19:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:08,570 INFO L93 Difference]: Finished difference Result 377 states and 1223 transitions. [2023-12-02 17:19:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:19:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2023-12-02 17:19:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:08,586 INFO L225 Difference]: With dead ends: 377 [2023-12-02 17:19:08,586 INFO L226 Difference]: Without dead ends: 377 [2023-12-02 17:19:08,588 INFO L412 NwaCegarLoop]: 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 [2023-12-02 17:19:08,591 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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 [2023-12-02 17:19:08,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:19:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-02 17:19:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2023-12-02 17:19:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.252659574468085) internal successors, (1223), 376 states have internal predecessors, (1223), 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) [2023-12-02 17:19:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1223 transitions. [2023-12-02 17:19:08,663 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1223 transitions. Word has length 21 [2023-12-02 17:19:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:08,663 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 1223 transitions. [2023-12-02 17:19:08,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2023-12-02 17:19:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1223 transitions. [2023-12-02 17:19:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 17:19:08,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:08,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:08,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:19:08,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:08,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 492711160, now seen corresponding path program 1 times [2023-12-02 17:19:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:08,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948894092] [2023-12-02 17:19:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:08,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948894092] [2023-12-02 17:19:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948894092] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792039548] [2023-12-02 17:19:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:08,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:08,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:19:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:08,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:19:08,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:09,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792039548] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:19:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-12-02 17:19:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444476851] [2023-12-02 17:19:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:19:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:19:09,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:19:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:19:09,067 INFO L87 Difference]: Start difference. First operand 377 states and 1223 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2023-12-02 17:19:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:09,172 INFO L93 Difference]: Finished difference Result 439 states and 1432 transitions. [2023-12-02 17:19:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:19:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-12-02 17:19:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:09,178 INFO L225 Difference]: With dead ends: 439 [2023-12-02 17:19:09,178 INFO L226 Difference]: Without dead ends: 439 [2023-12-02 17:19:09,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:19:09,180 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:09,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:19:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-02 17:19:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2023-12-02 17:19:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.269406392694064) internal successors, (1432), 438 states have internal predecessors, (1432), 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) [2023-12-02 17:19:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1432 transitions. [2023-12-02 17:19:09,211 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1432 transitions. Word has length 22 [2023-12-02 17:19:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:09,211 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 1432 transitions. [2023-12-02 17:19:09,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2023-12-02 17:19:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1432 transitions. [2023-12-02 17:19:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:19:09,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:09,214 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:09,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:19:09,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:09,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:09,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash -596567879, now seen corresponding path program 1 times [2023-12-02 17:19:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:09,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265529656] [2023-12-02 17:19:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:19:09,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265529656] [2023-12-02 17:19:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265529656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:19:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:19:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:19:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818162273] [2023-12-02 17:19:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:19:09,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:19:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:09,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:19:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:19:09,509 INFO L87 Difference]: Start difference. First operand 439 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 17:19:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:09,601 INFO L93 Difference]: Finished difference Result 511 states and 1676 transitions. [2023-12-02 17:19:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:19:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-12-02 17:19:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:09,606 INFO L225 Difference]: With dead ends: 511 [2023-12-02 17:19:09,606 INFO L226 Difference]: Without dead ends: 511 [2023-12-02 17:19:09,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:19:09,608 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:09,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:19:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-02 17:19:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-12-02 17:19:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2862745098039214) internal successors, (1676), 510 states have internal predecessors, (1676), 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) [2023-12-02 17:19:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1676 transitions. [2023-12-02 17:19:09,625 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1676 transitions. Word has length 25 [2023-12-02 17:19:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:09,625 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1676 transitions. [2023-12-02 17:19:09,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 17:19:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1676 transitions. [2023-12-02 17:19:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:09,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:09,627 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:09,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:19:09,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:09,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash -922026908, now seen corresponding path program 1 times [2023-12-02 17:19:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043121196] [2023-12-02 17:19:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:10,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043121196] [2023-12-02 17:19:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043121196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430587794] [2023-12-02 17:19:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:10,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:10,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:19:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:11,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 17:19:11,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:11,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:19:11,108 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 12 [2023-12-02 17:19:11,190 INFO L378 Elim1Store]: Elim1 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 1 [2023-12-02 17:19:11,276 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-02 17:19:11,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:19:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 17:19:11,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 17:19:12,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 40 [2023-12-02 17:19:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:12,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:12,876 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max3~0 1)) (.cse5 (+ c_~max2~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (and (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse1 .cse2) (= c_~max1~0 .cse1)))) (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse4 .cse2) (< c_~max2~0 .cse4)))))) (or (and (= c_~max1~0 c_~max3~0) (<= .cse5 c_~max3~0)) (and .cse0 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_101 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3)))) (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse6 .cse2) (< .cse6 .cse5) (= c_~max1~0 .cse6)))))) is different from false [2023-12-02 17:19:15,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:15,595 INFO L378 Elim1Store]: Elim1 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 144 treesize of output 96 [2023-12-02 17:19:15,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:15,617 INFO L378 Elim1Store]: Elim1 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 2777 treesize of output 2525 [2023-12-02 17:19:15,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:15,669 INFO L378 Elim1Store]: Elim1 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 283 treesize of output 263 [2023-12-02 17:19:15,694 INFO L378 Elim1Store]: Elim1 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 178 treesize of output 142 [2023-12-02 17:19:15,714 INFO L378 Elim1Store]: Elim1 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 211 treesize of output 139 [2023-12-02 17:19:16,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,119 INFO L378 Elim1Store]: Elim1 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 113 treesize of output 77 [2023-12-02 17:19:16,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,138 INFO L378 Elim1Store]: Elim1 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 109 treesize of output 89 [2023-12-02 17:19:16,157 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,157 INFO L378 Elim1Store]: Elim1 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 47 treesize of output 35 [2023-12-02 17:19:16,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,203 INFO L378 Elim1Store]: Elim1 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 123 treesize of output 87 [2023-12-02 17:19:16,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,211 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,222 INFO L378 Elim1Store]: Elim1 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 117 treesize of output 93 [2023-12-02 17:19:16,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,244 INFO L378 Elim1Store]: Elim1 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 51 treesize of output 35 [2023-12-02 17:19:16,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,293 INFO L378 Elim1Store]: Elim1 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 79 treesize of output 55 [2023-12-02 17:19:16,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,312 INFO L378 Elim1Store]: Elim1 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 76 treesize of output 64 [2023-12-02 17:19:16,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,330 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 28 [2023-12-02 17:19:16,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,378 INFO L378 Elim1Store]: Elim1 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 89 treesize of output 65 [2023-12-02 17:19:16,385 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,399 INFO L378 Elim1Store]: Elim1 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 84 treesize of output 68 [2023-12-02 17:19:16,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,430 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 28 [2023-12-02 17:19:16,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,462 INFO L378 Elim1Store]: Elim1 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 89 treesize of output 65 [2023-12-02 17:19:16,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,483 INFO L378 Elim1Store]: Elim1 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 84 treesize of output 68 [2023-12-02 17:19:16,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,520 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 30 [2023-12-02 17:19:16,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,568 INFO L378 Elim1Store]: Elim1 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 101 treesize of output 65 [2023-12-02 17:19:16,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,592 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,593 INFO L378 Elim1Store]: Elim1 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 97 treesize of output 81 [2023-12-02 17:19:16,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,643 INFO L378 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-12-02 17:19:16,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,685 INFO L378 Elim1Store]: Elim1 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 79 treesize of output 55 [2023-12-02 17:19:16,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,708 INFO L378 Elim1Store]: Elim1 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 76 treesize of output 64 [2023-12-02 17:19:16,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,731 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 28 [2023-12-02 17:19:16,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:16,800 INFO L378 Elim1Store]: Elim1 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 55 treesize of output 43 [2023-12-02 17:19:16,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,809 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:19:16,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,822 INFO L378 Elim1Store]: Elim1 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 51 treesize of output 43 [2023-12-02 17:19:16,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:19:16,843 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 23 [2023-12-02 17:19:16,882 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:19:16,882 INFO L378 Elim1Store]: Elim1 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 132 treesize of output 1 [2023-12-02 17:19:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:17,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430587794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:17,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341482854] [2023-12-02 17:19:17,074 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:17,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-12-02 17:19:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658395159] [2023-12-02 17:19:17,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:19:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:19:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=521, Unknown=10, NotChecked=48, Total=702 [2023-12-02 17:19:17,078 INFO L87 Difference]: Start difference. First operand 511 states and 1676 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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) [2023-12-02 17:19:18,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse4 (+ c_~max3~0 1)) (.cse5 (= c_~max1~0 c_~max2~0)) (.cse12 (<= c_~max3~0 c_~max2~0)) (.cse8 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse25 (= c_~max1~0 c_~max3~0)) (.cse14 (<= .cse2 c_~max3~0))) (let ((.cse19 (and .cse25 .cse14)) (.cse13 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8)))) (.cse20 (and .cse5 .cse12)) (.cse11 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse30 .cse4) (< c_~max2~0 .cse30)))))) (let ((.cse27 (select |c_#memory_int| c_~A~0.base)) (.cse16 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (= c_~max1~0 .cse29) (< .cse29 .cse4) (< .cse29 .cse2))))) (.cse17 (or .cse5 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (= c_~max1~0 .cse28) (< .cse28 .cse4)))) .cse11))) (.cse21 (or .cse19 .cse13 .cse20))) (let ((.cse0 (and .cse16 .cse17 .cse21)) (.cse1 (select .cse27 c_~A~0.offset)) (.cse18 (select .cse27 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4)))) (.cse6 (select .cse27 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse15 (+ c_~max1~0 1)) (.cse3 (select .cse27 .cse8))) (and (or .cse0 (< c_~max1~0 .cse1)) (or (and (<= .cse2 .cse3) (= c_~max1~0 .cse3)) (< .cse3 .cse4) (and .cse5 (<= .cse3 c_~max2~0))) (or (< c_~max1~0 .cse6) .cse0) (or (let ((.cse9 (= .cse1 c_~max2~0))) (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse7 .cse4) (< .cse7 .cse2) (= .cse1 .cse7)))) (or .cse9 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse10 .cse4) (= .cse1 .cse10)))) .cse11)) (or (and .cse9 .cse12) .cse13 (and (= .cse1 c_~max3~0) .cse14)))) (< .cse1 .cse15)) .cse16 .cse17 (or (and (<= .cse18 c_~max2~0) .cse5) (and (= c_~max1~0 .cse18) (<= .cse2 .cse18)) (< .cse18 .cse4)) (or .cse19 .cse20 (< c_~max3~0 .cse18)) .cse21 (or (let ((.cse22 (= .cse6 c_~max2~0))) (and (or (and .cse14 (= .cse6 c_~max3~0)) .cse13 (and .cse12 .cse22)) (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse23 .cse4) (= .cse6 .cse23) (< .cse23 .cse2)))) (or (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse24 .cse4) (= .cse6 .cse24)))) .cse11) .cse22))) (< .cse6 .cse15)) (or .cse19 (< c_~max3~0 .cse3) .cse20) (let ((.cse26 (= c_~max2~0 0))) (or (and .cse25 (<= 1 c_~max3~0) .cse26) (and (= c_~max1~0 0) .cse26 (= c_~max3~0 0)))))))))) is different from false [2023-12-02 17:19:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:20,714 INFO L93 Difference]: Finished difference Result 1509 states and 4935 transitions. [2023-12-02 17:19:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:19:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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 [2023-12-02 17:19:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:20,725 INFO L225 Difference]: With dead ends: 1509 [2023-12-02 17:19:20,725 INFO L226 Difference]: Without dead ends: 1495 [2023-12-02 17:19:20,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=179, Invalid=742, Unknown=17, NotChecked=118, Total=1056 [2023-12-02 17:19:20,726 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 310 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 20 mSolverCounterUnsat, 92 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 92 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:20,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 69 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1035 Invalid, 92 Unknown, 375 Unchecked, 2.4s Time] [2023-12-02 17:19:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2023-12-02 17:19:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 721. [2023-12-02 17:19:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.2680555555555557) internal successors, (2353), 720 states have internal predecessors, (2353), 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) [2023-12-02 17:19:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2353 transitions. [2023-12-02 17:19:20,757 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2353 transitions. Word has length 28 [2023-12-02 17:19:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:20,758 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 2353 transitions. [2023-12-02 17:19:20,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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) [2023-12-02 17:19:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2353 transitions. [2023-12-02 17:19:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:20,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:20,760 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:20,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 17:19:20,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:20,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:20,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1365180364, now seen corresponding path program 2 times [2023-12-02 17:19:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175486912] [2023-12-02 17:19:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:22,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175486912] [2023-12-02 17:19:22,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175486912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715615318] [2023-12-02 17:19:22,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:22,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:22,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:22,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:22,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:19:22,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:22,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:22,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 17:19:22,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:22,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:19:22,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 17:19:22,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:19:22,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 17:19:22,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 31 [2023-12-02 17:19:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:22,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:23,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max3~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse1 (+ c_~max2~0 1)) (.cse4 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_135) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse0) (< .cse0 .cse1) (< .cse0 .cse2)))) (or .cse4 (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_135) c_~A~0.base) .cse3))) (or (< .cse5 .cse2) (< c_~max2~0 .cse5))))) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_135) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse6) (< .cse6 .cse2)))) .cse4) (or (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_135) c_~A~0.base) .cse3))) (and (= c_~max1~0 c_~max3~0) (<= .cse1 c_~max3~0)) (and .cse4 (<= c_~max3~0 c_~max2~0))))) is different from false [2023-12-02 17:19:23,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:23,600 INFO L378 Elim1Store]: Elim1 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 807 treesize of output 711 [2023-12-02 17:19:23,626 INFO L378 Elim1Store]: Elim1 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 515 treesize of output 503 [2023-12-02 17:19:23,640 INFO L378 Elim1Store]: Elim1 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 503 treesize of output 491 [2023-12-02 17:19:23,652 INFO L378 Elim1Store]: Elim1 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 491 treesize of output 455 [2023-12-02 17:19:23,665 INFO L378 Elim1Store]: Elim1 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 455 treesize of output 431 [2023-12-02 17:19:23,675 INFO L378 Elim1Store]: Elim1 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 431 treesize of output 419 [2023-12-02 17:19:23,685 INFO L378 Elim1Store]: Elim1 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 419 treesize of output 413 [2023-12-02 17:19:23,696 INFO L378 Elim1Store]: Elim1 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 413 treesize of output 389 [2023-12-02 17:19:23,705 INFO L378 Elim1Store]: Elim1 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 389 treesize of output 371 [2023-12-02 17:19:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:24,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715615318] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:24,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [782627730] [2023-12-02 17:19:24,494 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:24,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-12-02 17:19:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054127464] [2023-12-02 17:19:24,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:24,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 17:19:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 17:19:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=697, Unknown=6, NotChecked=54, Total=870 [2023-12-02 17:19:24,496 INFO L87 Difference]: Start difference. First operand 721 states and 2353 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 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) [2023-12-02 17:19:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:26,064 INFO L93 Difference]: Finished difference Result 1189 states and 3902 transitions. [2023-12-02 17:19:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:19:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 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 [2023-12-02 17:19:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:26,073 INFO L225 Difference]: With dead ends: 1189 [2023-12-02 17:19:26,073 INFO L226 Difference]: Without dead ends: 1182 [2023-12-02 17:19:26,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=220, Invalid=1260, Unknown=6, NotChecked=74, Total=1560 [2023-12-02 17:19:26,075 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 277 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:26,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 46 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1168 Invalid, 0 Unknown, 184 Unchecked, 0.9s Time] [2023-12-02 17:19:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-12-02 17:19:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 721. [2023-12-02 17:19:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.2680555555555557) internal successors, (2353), 720 states have internal predecessors, (2353), 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) [2023-12-02 17:19:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2353 transitions. [2023-12-02 17:19:26,099 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2353 transitions. Word has length 28 [2023-12-02 17:19:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:26,100 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 2353 transitions. [2023-12-02 17:19:26,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 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) [2023-12-02 17:19:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2353 transitions. [2023-12-02 17:19:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:26,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:26,103 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:26,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 17:19:26,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:26,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:26,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1059673566, now seen corresponding path program 3 times [2023-12-02 17:19:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039881238] [2023-12-02 17:19:26,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:27,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039881238] [2023-12-02 17:19:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039881238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558611463] [2023-12-02 17:19:27,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:27,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:27,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:19:27,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:27,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:27,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:19:27,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:27,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 31 [2023-12-02 17:19:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:27,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:27,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:27,981 INFO L378 Elim1Store]: Elim1 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 131 treesize of output 75 [2023-12-02 17:19:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558611463] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213879359] [2023-12-02 17:19:28,413 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:28,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2023-12-02 17:19:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821197962] [2023-12-02 17:19:28,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:28,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 17:19:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 17:19:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:19:28,415 INFO L87 Difference]: Start difference. First operand 721 states and 2353 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 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) [2023-12-02 17:19:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:30,753 INFO L93 Difference]: Finished difference Result 1747 states and 5782 transitions. [2023-12-02 17:19:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 17:19:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 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 [2023-12-02 17:19:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:30,764 INFO L225 Difference]: With dead ends: 1747 [2023-12-02 17:19:30,765 INFO L226 Difference]: Without dead ends: 1733 [2023-12-02 17:19:30,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=3286, Unknown=0, NotChecked=0, Total=3906 [2023-12-02 17:19:30,766 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 277 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:30,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 17:19:30,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-12-02 17:19:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 767. [2023-12-02 17:19:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 3.2715404699738904) internal successors, (2506), 766 states have internal predecessors, (2506), 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) [2023-12-02 17:19:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2506 transitions. [2023-12-02 17:19:30,795 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2506 transitions. Word has length 28 [2023-12-02 17:19:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:30,795 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2506 transitions. [2023-12-02 17:19:30,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 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) [2023-12-02 17:19:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2506 transitions. [2023-12-02 17:19:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:30,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:30,798 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:30,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 17:19:31,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:31,000 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:31,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1157533970, now seen corresponding path program 4 times [2023-12-02 17:19:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827032344] [2023-12-02 17:19:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:31,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827032344] [2023-12-02 17:19:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827032344] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349345030] [2023-12-02 17:19:31,838 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:19:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:31,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:31,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:19:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:31,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 17:19:31,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:32,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 31 [2023-12-02 17:19:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:32,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:32,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:32,596 INFO L378 Elim1Store]: Elim1 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 123 treesize of output 75 [2023-12-02 17:19:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349345030] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030225481] [2023-12-02 17:19:32,951 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:32,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2023-12-02 17:19:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489033961] [2023-12-02 17:19:32,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:19:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:19:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-02 17:19:32,953 INFO L87 Difference]: Start difference. First operand 767 states and 2506 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 21 states have internal predecessors, (73), 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) [2023-12-02 17:19:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:33,537 INFO L93 Difference]: Finished difference Result 1156 states and 3817 transitions. [2023-12-02 17:19:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:19:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 21 states have internal predecessors, (73), 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 [2023-12-02 17:19:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:33,544 INFO L225 Difference]: With dead ends: 1156 [2023-12-02 17:19:33,544 INFO L226 Difference]: Without dead ends: 1149 [2023-12-02 17:19:33,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:19:33,545 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 147 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:33,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 53 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:19:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-02 17:19:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 811. [2023-12-02 17:19:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.274074074074074) internal successors, (2652), 810 states have internal predecessors, (2652), 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) [2023-12-02 17:19:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2652 transitions. [2023-12-02 17:19:33,578 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2652 transitions. Word has length 28 [2023-12-02 17:19:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:33,579 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2652 transitions. [2023-12-02 17:19:33,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 21 states have internal predecessors, (73), 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) [2023-12-02 17:19:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2652 transitions. [2023-12-02 17:19:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:33,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:33,582 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:33,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 17:19:33,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:33,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:33,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -335827294, now seen corresponding path program 5 times [2023-12-02 17:19:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400517241] [2023-12-02 17:19:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:34,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400517241] [2023-12-02 17:19:34,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400517241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867037375] [2023-12-02 17:19:34,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:34,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:34,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:19:34,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:34,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:34,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 17:19:34,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:34,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 31 [2023-12-02 17:19:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:35,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:35,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:35,378 INFO L378 Elim1Store]: Elim1 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 131 treesize of output 75 [2023-12-02 17:19:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867037375] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533818365] [2023-12-02 17:19:35,795 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:35,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:35,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2023-12-02 17:19:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808175746] [2023-12-02 17:19:35,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:35,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:19:35,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:19:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2023-12-02 17:19:35,797 INFO L87 Difference]: Start difference. First operand 811 states and 2652 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 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) [2023-12-02 17:19:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:36,420 INFO L93 Difference]: Finished difference Result 1204 states and 3971 transitions. [2023-12-02 17:19:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:19:36,420 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 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 [2023-12-02 17:19:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:36,428 INFO L225 Difference]: With dead ends: 1204 [2023-12-02 17:19:36,428 INFO L226 Difference]: Without dead ends: 1197 [2023-12-02 17:19:36,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2023-12-02 17:19:36,429 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 168 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:36,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 37 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:19:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-12-02 17:19:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 839. [2023-12-02 17:19:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 3.2911694510739857) internal successors, (2758), 838 states have internal predecessors, (2758), 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) [2023-12-02 17:19:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2758 transitions. [2023-12-02 17:19:36,452 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 2758 transitions. Word has length 28 [2023-12-02 17:19:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:36,453 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 2758 transitions. [2023-12-02 17:19:36,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 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) [2023-12-02 17:19:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 2758 transitions. [2023-12-02 17:19:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:36,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:36,455 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:36,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:19:36,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:36,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:36,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1881380242, now seen corresponding path program 6 times [2023-12-02 17:19:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826663836] [2023-12-02 17:19:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:37,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826663836] [2023-12-02 17:19:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826663836] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876871719] [2023-12-02 17:19:37,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:37,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:37,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:37,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:37,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:19:37,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:37,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:37,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:19:37,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:37,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 31 [2023-12-02 17:19:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:38,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:38,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:38,286 INFO L378 Elim1Store]: Elim1 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 123 treesize of output 75 [2023-12-02 17:19:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876871719] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808513184] [2023-12-02 17:19:38,749 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:38,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:38,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2023-12-02 17:19:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877713431] [2023-12-02 17:19:38,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:19:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:19:38,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:19:38,752 INFO L87 Difference]: Start difference. First operand 839 states and 2758 transitions. Second operand has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 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) [2023-12-02 17:19:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:40,256 INFO L93 Difference]: Finished difference Result 1408 states and 4659 transitions. [2023-12-02 17:19:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 17:19:40,256 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 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 [2023-12-02 17:19:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:40,267 INFO L225 Difference]: With dead ends: 1408 [2023-12-02 17:19:40,267 INFO L226 Difference]: Without dead ends: 1401 [2023-12-02 17:19:40,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=468, Invalid=2184, Unknown=0, NotChecked=0, Total=2652 [2023-12-02 17:19:40,269 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 243 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:40,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 77 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:19:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2023-12-02 17:19:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 851. [2023-12-02 17:19:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 3.2729411764705882) internal successors, (2782), 850 states have internal predecessors, (2782), 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) [2023-12-02 17:19:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 2782 transitions. [2023-12-02 17:19:40,299 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 2782 transitions. Word has length 28 [2023-12-02 17:19:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:40,300 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 2782 transitions. [2023-12-02 17:19:40,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 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) [2023-12-02 17:19:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 2782 transitions. [2023-12-02 17:19:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:19:40,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:40,303 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:40,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:19:40,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:40,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:40,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2090711984, now seen corresponding path program 7 times [2023-12-02 17:19:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:40,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715035028] [2023-12-02 17:19:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:41,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715035028] [2023-12-02 17:19:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715035028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737925302] [2023-12-02 17:19:41,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:19:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:41,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:41,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:19:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:41,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 17:19:41,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:41,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 30 [2023-12-02 17:19:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:41,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:41,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:19:41,862 INFO L378 Elim1Store]: Elim1 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 107 treesize of output 75 [2023-12-02 17:19:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:19:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737925302] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [405752030] [2023-12-02 17:19:42,262 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:42,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:42,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2023-12-02 17:19:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428835706] [2023-12-02 17:19:42,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:19:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:19:42,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-12-02 17:19:42,265 INFO L87 Difference]: Start difference. First operand 851 states and 2782 transitions. Second operand has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 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) [2023-12-02 17:19:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:43,058 INFO L93 Difference]: Finished difference Result 1288 states and 4241 transitions. [2023-12-02 17:19:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 17:19:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 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 [2023-12-02 17:19:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:43,066 INFO L225 Difference]: With dead ends: 1288 [2023-12-02 17:19:43,066 INFO L226 Difference]: Without dead ends: 1281 [2023-12-02 17:19:43,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2023-12-02 17:19:43,067 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 191 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:43,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 81 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:19:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2023-12-02 17:19:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 869. [2023-12-02 17:19:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 3.2776497695852536) internal successors, (2845), 868 states have internal predecessors, (2845), 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) [2023-12-02 17:19:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2845 transitions. [2023-12-02 17:19:43,089 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2845 transitions. Word has length 28 [2023-12-02 17:19:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:43,089 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 2845 transitions. [2023-12-02 17:19:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.590909090909091) internal successors, (79), 21 states have internal predecessors, (79), 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) [2023-12-02 17:19:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2845 transitions. [2023-12-02 17:19:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 17:19:43,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:43,091 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:43,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:19:43,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:19:43,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:43,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -467853251, now seen corresponding path program 8 times [2023-12-02 17:19:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395320443] [2023-12-02 17:19:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:43,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395320443] [2023-12-02 17:19:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395320443] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151555251] [2023-12-02 17:19:43,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:43,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:43,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:43,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:19:43,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:43,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:43,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:43,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:43,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151555251] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:43,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [49761258] [2023-12-02 17:19:43,612 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:43,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:43,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:19:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372507137] [2023-12-02 17:19:43,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:43,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:19:43,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:43,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:19:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:19:43,614 INFO L87 Difference]: Start difference. First operand 869 states and 2845 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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) [2023-12-02 17:19:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:43,887 INFO L93 Difference]: Finished difference Result 1754 states and 5771 transitions. [2023-12-02 17:19:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:19:43,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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 29 [2023-12-02 17:19:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:43,898 INFO L225 Difference]: With dead ends: 1754 [2023-12-02 17:19:43,898 INFO L226 Difference]: Without dead ends: 1754 [2023-12-02 17:19:43,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:19:43,899 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 121 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:43,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 30 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:19:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2023-12-02 17:19:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1083. [2023-12-02 17:19:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 3.33456561922366) internal successors, (3608), 1082 states have internal predecessors, (3608), 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) [2023-12-02 17:19:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3608 transitions. [2023-12-02 17:19:43,926 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3608 transitions. Word has length 29 [2023-12-02 17:19:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:43,926 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 3608 transitions. [2023-12-02 17:19:43,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 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) [2023-12-02 17:19:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3608 transitions. [2023-12-02 17:19:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:19:43,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:43,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:43,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:19:44,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 17:19:44,129 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:44,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1399565467, now seen corresponding path program 9 times [2023-12-02 17:19:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638557790] [2023-12-02 17:19:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:44,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638557790] [2023-12-02 17:19:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638557790] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132958825] [2023-12-02 17:19:44,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:44,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:44,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:44,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:19:44,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:44,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:44,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:44,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:44,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132958825] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2078072600] [2023-12-02 17:19:44,471 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:44,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2023-12-02 17:19:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069716028] [2023-12-02 17:19:44,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:19:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:19:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:19:44,473 INFO L87 Difference]: Start difference. First operand 1083 states and 3608 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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) [2023-12-02 17:19:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:45,505 INFO L93 Difference]: Finished difference Result 1843 states and 5917 transitions. [2023-12-02 17:19:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 17:19:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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 [2023-12-02 17:19:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:45,518 INFO L225 Difference]: With dead ends: 1843 [2023-12-02 17:19:45,518 INFO L226 Difference]: Without dead ends: 1833 [2023-12-02 17:19:45,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 17:19:45,519 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 320 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:45,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 87 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 17:19:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-02 17:19:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1377. [2023-12-02 17:19:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 3.3132267441860463) internal successors, (4559), 1376 states have internal predecessors, (4559), 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) [2023-12-02 17:19:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 4559 transitions. [2023-12-02 17:19:45,555 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 4559 transitions. Word has length 31 [2023-12-02 17:19:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:45,556 INFO L495 AbstractCegarLoop]: Abstraction has 1377 states and 4559 transitions. [2023-12-02 17:19:45,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 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) [2023-12-02 17:19:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 4559 transitions. [2023-12-02 17:19:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:19:45,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:45,559 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:19:45,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 17:19:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 17:19:45,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:45,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash -314398134, now seen corresponding path program 1 times [2023-12-02 17:19:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588897986] [2023-12-02 17:19:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:19:45,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588897986] [2023-12-02 17:19:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588897986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894457242] [2023-12-02 17:19:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:45,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:45,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:19:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:45,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:45,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:19:46,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:19:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894457242] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721132699] [2023-12-02 17:19:46,057 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:46,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:46,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-12-02 17:19:46,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837399023] [2023-12-02 17:19:46,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:46,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 17:19:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 17:19:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-02 17:19:46,060 INFO L87 Difference]: Start difference. First operand 1377 states and 4559 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 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) [2023-12-02 17:19:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:46,208 INFO L93 Difference]: Finished difference Result 1278 states and 3960 transitions. [2023-12-02 17:19:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:19:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 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 [2023-12-02 17:19:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:46,216 INFO L225 Difference]: With dead ends: 1278 [2023-12-02 17:19:46,216 INFO L226 Difference]: Without dead ends: 1250 [2023-12-02 17:19:46,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:19:46,217 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:46,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 14 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:19:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-02 17:19:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1191. [2023-12-02 17:19:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 3.1747899159663864) internal successors, (3778), 1190 states have internal predecessors, (3778), 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) [2023-12-02 17:19:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3778 transitions. [2023-12-02 17:19:46,241 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3778 transitions. Word has length 31 [2023-12-02 17:19:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:46,241 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 3778 transitions. [2023-12-02 17:19:46,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 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) [2023-12-02 17:19:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3778 transitions. [2023-12-02 17:19:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:19:46,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:46,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:46,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:19:46,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 17:19:46,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:46,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1364194521, now seen corresponding path program 10 times [2023-12-02 17:19:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732839540] [2023-12-02 17:19:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:46,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732839540] [2023-12-02 17:19:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732839540] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121232560] [2023-12-02 17:19:46,559 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:19:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:46,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:46,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:19:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:46,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 17:19:46,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:46,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:19:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121232560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:46,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643701179] [2023-12-02 17:19:46,860 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:46,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:19:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789677877] [2023-12-02 17:19:46,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:19:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:19:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:19:46,862 INFO L87 Difference]: Start difference. First operand 1191 states and 3778 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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) [2023-12-02 17:19:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:47,039 INFO L93 Difference]: Finished difference Result 1071 states and 3323 transitions. [2023-12-02 17:19:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:19:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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 [2023-12-02 17:19:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:47,043 INFO L225 Difference]: With dead ends: 1071 [2023-12-02 17:19:47,043 INFO L226 Difference]: Without dead ends: 802 [2023-12-02 17:19:47,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:19:47,044 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:47,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:19:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2023-12-02 17:19:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2023-12-02 17:19:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 3.262172284644195) internal successors, (2613), 801 states have internal predecessors, (2613), 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) [2023-12-02 17:19:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2613 transitions. [2023-12-02 17:19:47,065 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2613 transitions. Word has length 31 [2023-12-02 17:19:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:47,065 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 2613 transitions. [2023-12-02 17:19:47,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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) [2023-12-02 17:19:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2613 transitions. [2023-12-02 17:19:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:47,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:47,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:47,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:19:47,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 17:19:47,268 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:47,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 10197504, now seen corresponding path program 11 times [2023-12-02 17:19:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830513490] [2023-12-02 17:19:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:47,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830513490] [2023-12-02 17:19:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830513490] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549799890] [2023-12-02 17:19:47,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:47,392 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:47,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:19:47,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:47,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:47,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:19:47,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:47,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549799890] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470239514] [2023-12-02 17:19:47,750 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:47,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 17:19:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957180243] [2023-12-02 17:19:47,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:47,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:19:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:19:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:19:47,752 INFO L87 Difference]: Start difference. First operand 802 states and 2613 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 17:19:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:48,212 INFO L93 Difference]: Finished difference Result 2048 states and 6948 transitions. [2023-12-02 17:19:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 17:19:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 [2023-12-02 17:19:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:48,219 INFO L225 Difference]: With dead ends: 2048 [2023-12-02 17:19:48,219 INFO L226 Difference]: Without dead ends: 2048 [2023-12-02 17:19:48,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2023-12-02 17:19:48,220 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 202 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:48,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 7 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:19:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2023-12-02 17:19:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 930. [2023-12-02 17:19:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.3541442411194833) internal successors, (3116), 929 states have internal predecessors, (3116), 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) [2023-12-02 17:19:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 3116 transitions. [2023-12-02 17:19:48,246 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 3116 transitions. Word has length 32 [2023-12-02 17:19:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:48,246 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 3116 transitions. [2023-12-02 17:19:48,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 17:19:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 3116 transitions. [2023-12-02 17:19:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:48,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:48,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:48,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 17:19:48,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 17:19:48,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:48,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1772863080, now seen corresponding path program 12 times [2023-12-02 17:19:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339565671] [2023-12-02 17:19:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:48,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339565671] [2023-12-02 17:19:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339565671] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629211975] [2023-12-02 17:19:48,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:48,559 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:48,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 17:19:48,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:48,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:48,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:48,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:19:48,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:19:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629211975] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674025347] [2023-12-02 17:19:48,808 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:48,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-12-02 17:19:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650291916] [2023-12-02 17:19:48,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:48,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:19:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:19:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:19:48,809 INFO L87 Difference]: Start difference. First operand 930 states and 3116 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 17:19:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:50,683 INFO L93 Difference]: Finished difference Result 2737 states and 9527 transitions. [2023-12-02 17:19:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-12-02 17:19:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 [2023-12-02 17:19:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:50,691 INFO L225 Difference]: With dead ends: 2737 [2023-12-02 17:19:50,691 INFO L226 Difference]: Without dead ends: 2737 [2023-12-02 17:19:50,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1481, Invalid=5161, Unknown=0, NotChecked=0, Total=6642 [2023-12-02 17:19:50,694 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 310 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:50,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 11 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:19:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2023-12-02 17:19:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 950. [2023-12-02 17:19:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.398314014752371) internal successors, (3225), 949 states have internal predecessors, (3225), 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) [2023-12-02 17:19:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3225 transitions. [2023-12-02 17:19:50,726 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3225 transitions. Word has length 32 [2023-12-02 17:19:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:50,727 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 3225 transitions. [2023-12-02 17:19:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 17:19:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3225 transitions. [2023-12-02 17:19:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:50,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:50,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:50,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 17:19:50,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 17:19:50,930 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:50,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1521130304, now seen corresponding path program 13 times [2023-12-02 17:19:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759287433] [2023-12-02 17:19:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:51,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759287433] [2023-12-02 17:19:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759287433] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763173276] [2023-12-02 17:19:51,068 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:19:51,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:51,070 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:51,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 17:19:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:51,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:19:51,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:51,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763173276] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813760347] [2023-12-02 17:19:51,357 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:51,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-12-02 17:19:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697831460] [2023-12-02 17:19:51,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:19:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:19:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:19:51,359 INFO L87 Difference]: Start difference. First operand 950 states and 3225 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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) [2023-12-02 17:19:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:51,831 INFO L93 Difference]: Finished difference Result 2028 states and 7119 transitions. [2023-12-02 17:19:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 17:19:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 [2023-12-02 17:19:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:51,837 INFO L225 Difference]: With dead ends: 2028 [2023-12-02 17:19:51,837 INFO L226 Difference]: Without dead ends: 2028 [2023-12-02 17:19:51,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 17:19:51,838 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:51,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 7 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:19:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2023-12-02 17:19:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 970. [2023-12-02 17:19:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.3787409700722395) internal successors, (3274), 969 states have internal predecessors, (3274), 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) [2023-12-02 17:19:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3274 transitions. [2023-12-02 17:19:51,865 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3274 transitions. Word has length 32 [2023-12-02 17:19:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:51,865 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3274 transitions. [2023-12-02 17:19:51,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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) [2023-12-02 17:19:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3274 transitions. [2023-12-02 17:19:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:51,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:51,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:51,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 17:19:52,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 17:19:52,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1050433302, now seen corresponding path program 14 times [2023-12-02 17:19:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008266059] [2023-12-02 17:19:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:52,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008266059] [2023-12-02 17:19:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008266059] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849881906] [2023-12-02 17:19:52,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:52,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:52,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:52,175 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:52,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 17:19:52,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:52,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:52,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:19:52,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:52,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849881906] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867554127] [2023-12-02 17:19:52,509 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:52,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 17:19:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157532363] [2023-12-02 17:19:52,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:52,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:19:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:19:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:19:52,511 INFO L87 Difference]: Start difference. First operand 970 states and 3274 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 17:19:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:53,209 INFO L93 Difference]: Finished difference Result 1828 states and 6128 transitions. [2023-12-02 17:19:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 17:19:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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 [2023-12-02 17:19:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:53,214 INFO L225 Difference]: With dead ends: 1828 [2023-12-02 17:19:53,214 INFO L226 Difference]: Without dead ends: 1828 [2023-12-02 17:19:53,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2023-12-02 17:19:53,214 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 195 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:53,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 22 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 17:19:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2023-12-02 17:19:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1070. [2023-12-02 17:19:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 3.4415341440598692) internal successors, (3679), 1069 states have internal predecessors, (3679), 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) [2023-12-02 17:19:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 3679 transitions. [2023-12-02 17:19:53,239 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 3679 transitions. Word has length 32 [2023-12-02 17:19:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:53,239 INFO L495 AbstractCegarLoop]: Abstraction has 1070 states and 3679 transitions. [2023-12-02 17:19:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 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) [2023-12-02 17:19:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 3679 transitions. [2023-12-02 17:19:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:53,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:53,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:53,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 17:19:53,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 17:19:53,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:53,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1481868418, now seen corresponding path program 15 times [2023-12-02 17:19:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:53,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479585257] [2023-12-02 17:19:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:53,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479585257] [2023-12-02 17:19:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479585257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646674986] [2023-12-02 17:19:53,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:53,548 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:53,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:19:53,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:53,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:53,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:53,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:19:53,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:19:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646674986] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1458399830] [2023-12-02 17:19:53,849 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:53,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-12-02 17:19:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900236126] [2023-12-02 17:19:53,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:53,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:19:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:19:53,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:19:53,851 INFO L87 Difference]: Start difference. First operand 1070 states and 3679 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 17:19:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:56,291 INFO L93 Difference]: Finished difference Result 2972 states and 10212 transitions. [2023-12-02 17:19:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 17:19:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 [2023-12-02 17:19:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:56,298 INFO L225 Difference]: With dead ends: 2972 [2023-12-02 17:19:56,298 INFO L226 Difference]: Without dead ends: 2972 [2023-12-02 17:19:56,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1794, Invalid=7518, Unknown=0, NotChecked=0, Total=9312 [2023-12-02 17:19:56,301 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 331 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:56,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 31 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:19:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2023-12-02 17:19:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1090. [2023-12-02 17:19:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1089 states have (on average 3.47842056932966) internal successors, (3788), 1089 states have internal predecessors, (3788), 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) [2023-12-02 17:19:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 3788 transitions. [2023-12-02 17:19:56,334 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 3788 transitions. Word has length 32 [2023-12-02 17:19:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:56,334 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 3788 transitions. [2023-12-02 17:19:56,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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) [2023-12-02 17:19:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 3788 transitions. [2023-12-02 17:19:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:56,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:56,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:56,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-02 17:19:56,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:56,537 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:56,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1733601194, now seen corresponding path program 16 times [2023-12-02 17:19:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918546528] [2023-12-02 17:19:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:56,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918546528] [2023-12-02 17:19:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918546528] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614178633] [2023-12-02 17:19:56,646 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:19:56,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:56,647 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:56,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 17:19:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:56,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:19:56,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:56,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614178633] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933875781] [2023-12-02 17:19:56,989 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:56,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-12-02 17:19:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810480685] [2023-12-02 17:19:56,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:56,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:19:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:19:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:19:56,991 INFO L87 Difference]: Start difference. First operand 1090 states and 3788 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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) [2023-12-02 17:19:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:57,770 INFO L93 Difference]: Finished difference Result 2817 states and 9675 transitions. [2023-12-02 17:19:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 17:19:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 [2023-12-02 17:19:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:57,775 INFO L225 Difference]: With dead ends: 2817 [2023-12-02 17:19:57,775 INFO L226 Difference]: Without dead ends: 2817 [2023-12-02 17:19:57,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 17:19:57,787 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 297 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:57,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 24 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:19:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2023-12-02 17:19:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 1010. [2023-12-02 17:19:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 3.381565906838454) internal successors, (3412), 1009 states have internal predecessors, (3412), 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) [2023-12-02 17:19:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 3412 transitions. [2023-12-02 17:19:57,818 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 3412 transitions. Word has length 32 [2023-12-02 17:19:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:57,818 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 3412 transitions. [2023-12-02 17:19:57,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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) [2023-12-02 17:19:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 3412 transitions. [2023-12-02 17:19:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:57,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:57,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:57,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 17:19:58,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:58,020 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:58,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash -84579988, now seen corresponding path program 17 times [2023-12-02 17:19:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134329835] [2023-12-02 17:19:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:58,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134329835] [2023-12-02 17:19:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134329835] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864475066] [2023-12-02 17:19:58,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:19:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:58,119 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:58,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 17:19:58,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:19:58,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:58,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:19:58,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:58,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:19:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864475066] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:19:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [642746592] [2023-12-02 17:19:58,445 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:19:58,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:19:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-12-02 17:19:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051328543] [2023-12-02 17:19:58,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:19:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:19:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:19:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:19:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:19:58,446 INFO L87 Difference]: Start difference. First operand 1010 states and 3412 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 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) [2023-12-02 17:19:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:19:59,432 INFO L93 Difference]: Finished difference Result 3626 states and 12754 transitions. [2023-12-02 17:19:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 17:19:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 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 [2023-12-02 17:19:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:19:59,440 INFO L225 Difference]: With dead ends: 3626 [2023-12-02 17:19:59,440 INFO L226 Difference]: Without dead ends: 3626 [2023-12-02 17:19:59,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=667, Invalid=1783, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 17:19:59,441 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 368 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:19:59,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 15 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 17:19:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2023-12-02 17:19:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1050. [2023-12-02 17:19:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 3.4413727359389896) internal successors, (3610), 1049 states have internal predecessors, (3610), 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) [2023-12-02 17:19:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3610 transitions. [2023-12-02 17:19:59,480 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 3610 transitions. Word has length 32 [2023-12-02 17:19:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:19:59,481 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 3610 transitions. [2023-12-02 17:19:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 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) [2023-12-02 17:19:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 3610 transitions. [2023-12-02 17:19:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:19:59,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:19:59,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:19:59,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 17:19:59,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 17:19:59,683 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:19:59,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:19:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -336312764, now seen corresponding path program 18 times [2023-12-02 17:19:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:19:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359882051] [2023-12-02 17:19:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:19:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:19:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:19:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:19:59,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:19:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359882051] [2023-12-02 17:19:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359882051] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:19:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782329925] [2023-12-02 17:19:59,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:19:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:19:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:19:59,788 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:19:59,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 17:19:59,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:19:59,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:19:59,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:19:59,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:19:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:19:59,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:20:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:20:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782329925] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:20:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1487243642] [2023-12-02 17:20:00,062 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:20:00,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:20:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-12-02 17:20:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869792565] [2023-12-02 17:20:00,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:20:00,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:20:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:20:00,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:20:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:20:00,063 INFO L87 Difference]: Start difference. First operand 1050 states and 3610 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2023-12-02 17:20:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:02,943 INFO L93 Difference]: Finished difference Result 4588 states and 16136 transitions. [2023-12-02 17:20:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-12-02 17:20:02,943 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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 [2023-12-02 17:20:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:02,951 INFO L225 Difference]: With dead ends: 4588 [2023-12-02 17:20:02,951 INFO L226 Difference]: Without dead ends: 4588 [2023-12-02 17:20:02,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6237 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3464, Invalid=12792, Unknown=0, NotChecked=0, Total=16256 [2023-12-02 17:20:02,956 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 473 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:02,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 22 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:20:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2023-12-02 17:20:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 1030. [2023-12-02 17:20:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 3.402332361516035) internal successors, (3501), 1029 states have internal predecessors, (3501), 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) [2023-12-02 17:20:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 3501 transitions. [2023-12-02 17:20:03,001 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 3501 transitions. Word has length 32 [2023-12-02 17:20:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:03,001 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 3501 transitions. [2023-12-02 17:20:03,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2023-12-02 17:20:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 3501 transitions. [2023-12-02 17:20:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:20:03,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:03,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:03,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 17:20:03,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:03,203 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:20:03,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1355866518, now seen corresponding path program 19 times [2023-12-02 17:20:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:20:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095000445] [2023-12-02 17:20:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:20:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:20:03,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:20:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095000445] [2023-12-02 17:20:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095000445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:20:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001969458] [2023-12-02 17:20:03,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:20:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:20:03,295 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:20:03,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 17:20:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:03,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:20:03,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:20:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:20:03,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:20:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:20:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001969458] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:20:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1305881383] [2023-12-02 17:20:03,582 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:20:03,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:20:03,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-12-02 17:20:03,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659026245] [2023-12-02 17:20:03,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:20:03,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:20:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:20:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:20:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:20:03,584 INFO L87 Difference]: Start difference. First operand 1030 states and 3501 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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) [2023-12-02 17:20:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:04,123 INFO L93 Difference]: Finished difference Result 1667 states and 5571 transitions. [2023-12-02 17:20:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:20:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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 [2023-12-02 17:20:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:04,126 INFO L225 Difference]: With dead ends: 1667 [2023-12-02 17:20:04,126 INFO L226 Difference]: Without dead ends: 1667 [2023-12-02 17:20:04,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-12-02 17:20:04,127 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 157 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:04,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 20 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:20:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-12-02 17:20:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1050. [2023-12-02 17:20:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 3.3841754051477597) internal successors, (3550), 1049 states have internal predecessors, (3550), 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) [2023-12-02 17:20:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3550 transitions. [2023-12-02 17:20:04,153 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 3550 transitions. Word has length 32 [2023-12-02 17:20:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:04,154 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 3550 transitions. [2023-12-02 17:20:04,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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) [2023-12-02 17:20:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 3550 transitions. [2023-12-02 17:20:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:20:04,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:04,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:04,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 17:20:04,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:04,356 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:20:04,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1448857256, now seen corresponding path program 20 times [2023-12-02 17:20:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:20:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393342244] [2023-12-02 17:20:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:20:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:20:04,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:20:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393342244] [2023-12-02 17:20:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393342244] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:20:04,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088017627] [2023-12-02 17:20:04,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:20:04,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:04,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:20:04,448 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:20:04,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 17:20:04,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:20:04,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:20:04,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:20:04,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:20:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:20:04,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:20:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:20:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088017627] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:20:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977735020] [2023-12-02 17:20:04,728 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:20:04,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:20:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-02 17:20:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141498306] [2023-12-02 17:20:04,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:20:04,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:20:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:20:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:20:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:20:04,730 INFO L87 Difference]: Start difference. First operand 1050 states and 3550 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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) [2023-12-02 17:20:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:20:05,151 INFO L93 Difference]: Finished difference Result 1739 states and 5629 transitions. [2023-12-02 17:20:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:20:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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 [2023-12-02 17:20:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:20:05,155 INFO L225 Difference]: With dead ends: 1739 [2023-12-02 17:20:05,155 INFO L226 Difference]: Without dead ends: 1739 [2023-12-02 17:20:05,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2023-12-02 17:20:05,155 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 134 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:20:05,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 20 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:20:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-12-02 17:20:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1052. [2023-12-02 17:20:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.3482397716460515) internal successors, (3519), 1051 states have internal predecessors, (3519), 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) [2023-12-02 17:20:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3519 transitions. [2023-12-02 17:20:05,175 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3519 transitions. Word has length 32 [2023-12-02 17:20:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:20:05,175 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 3519 transitions. [2023-12-02 17:20:05,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 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) [2023-12-02 17:20:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3519 transitions. [2023-12-02 17:20:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 17:20:05,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:20:05,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:20:05,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 17:20:05,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:05,378 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:20:05,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:20:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash -277183294, now seen corresponding path program 2 times [2023-12-02 17:20:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:20:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123890036] [2023-12-02 17:20:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:20:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:20:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:20:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:07,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:20:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123890036] [2023-12-02 17:20:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123890036] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:20:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031283690] [2023-12-02 17:20:07,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:20:07,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:20:07,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:20:07,991 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:20:07,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 17:20:08,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:20:08,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:20:08,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 17:20:08,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:20:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:20:08,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:20:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:20:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:20:10,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:20:10,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 72 [2023-12-02 17:20:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:10,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:20:15,700 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 17:20:15,703 INFO L378 Elim1Store]: Elim1 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 7817 treesize of output 6539 [2023-12-02 17:20:16,120 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,121 INFO L378 Elim1Store]: Elim1 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 3913 treesize of output 3899 [2023-12-02 17:20:16,235 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,236 INFO L378 Elim1Store]: Elim1 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 3899 treesize of output 3871 [2023-12-02 17:20:16,350 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,351 INFO L378 Elim1Store]: Elim1 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 3871 treesize of output 3843 [2023-12-02 17:20:16,469 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,470 INFO L378 Elim1Store]: Elim1 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 3843 treesize of output 3829 [2023-12-02 17:20:16,569 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,570 INFO L378 Elim1Store]: Elim1 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 3829 treesize of output 3821 [2023-12-02 17:20:16,669 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,670 INFO L378 Elim1Store]: Elim1 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 3821 treesize of output 3809 [2023-12-02 17:20:16,771 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,772 INFO L378 Elim1Store]: Elim1 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 3809 treesize of output 3787 [2023-12-02 17:20:16,883 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:16,885 INFO L378 Elim1Store]: Elim1 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 3787 treesize of output 3743 [2023-12-02 17:20:17,013 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,014 INFO L378 Elim1Store]: Elim1 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 3743 treesize of output 3719 [2023-12-02 17:20:17,115 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,116 INFO L378 Elim1Store]: Elim1 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 3719 treesize of output 3699 [2023-12-02 17:20:17,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,229 INFO L378 Elim1Store]: Elim1 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 3699 treesize of output 3683 [2023-12-02 17:20:17,330 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,332 INFO L378 Elim1Store]: Elim1 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 3683 treesize of output 3673 [2023-12-02 17:20:17,433 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,435 INFO L378 Elim1Store]: Elim1 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 3673 treesize of output 3657 [2023-12-02 17:20:17,536 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,537 INFO L378 Elim1Store]: Elim1 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 3657 treesize of output 3625 [2023-12-02 17:20:17,647 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,648 INFO L378 Elim1Store]: Elim1 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 3625 treesize of output 3585 [2023-12-02 17:20:17,749 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,751 INFO L378 Elim1Store]: Elim1 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 3585 treesize of output 3565 [2023-12-02 17:20:17,851 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,852 INFO L378 Elim1Store]: Elim1 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 3565 treesize of output 3555 [2023-12-02 17:20:17,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:17,955 INFO L378 Elim1Store]: Elim1 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 3555 treesize of output 3535 [2023-12-02 17:20:18,063 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,064 INFO L378 Elim1Store]: Elim1 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 3535 treesize of output 3517 [2023-12-02 17:20:18,166 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,167 INFO L378 Elim1Store]: Elim1 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 3517 treesize of output 3481 [2023-12-02 17:20:18,268 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,270 INFO L378 Elim1Store]: Elim1 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 3481 treesize of output 3471 [2023-12-02 17:20:18,377 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,379 INFO L378 Elim1Store]: Elim1 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 3471 treesize of output 3451 [2023-12-02 17:20:18,479 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,480 INFO L378 Elim1Store]: Elim1 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 3451 treesize of output 3441 [2023-12-02 17:20:18,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,584 INFO L378 Elim1Store]: Elim1 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 3441 treesize of output 3421 [2023-12-02 17:20:18,687 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,688 INFO L378 Elim1Store]: Elim1 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 3421 treesize of output 3409 [2023-12-02 17:20:18,796 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,797 INFO L378 Elim1Store]: Elim1 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 3409 treesize of output 3385 [2023-12-02 17:20:18,898 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:18,899 INFO L378 Elim1Store]: Elim1 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 3385 treesize of output 3363 [2023-12-02 17:20:18,999 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,001 INFO L378 Elim1Store]: Elim1 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 3363 treesize of output 3319 [2023-12-02 17:20:19,102 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,104 INFO L378 Elim1Store]: Elim1 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 3319 treesize of output 3283 [2023-12-02 17:20:19,211 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,212 INFO L378 Elim1Store]: Elim1 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 3283 treesize of output 3243 [2023-12-02 17:20:19,313 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,315 INFO L378 Elim1Store]: Elim1 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 3243 treesize of output 3225 [2023-12-02 17:20:19,417 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,419 INFO L378 Elim1Store]: Elim1 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 3225 treesize of output 3217 [2023-12-02 17:20:19,527 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,528 INFO L378 Elim1Store]: Elim1 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 3217 treesize of output 3201 [2023-12-02 17:20:19,629 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,631 INFO L378 Elim1Store]: Elim1 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 3201 treesize of output 3181 [2023-12-02 17:20:19,735 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,736 INFO L378 Elim1Store]: Elim1 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 3181 treesize of output 3165 [2023-12-02 17:20:19,840 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,842 INFO L378 Elim1Store]: Elim1 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 3165 treesize of output 3151 [2023-12-02 17:20:19,951 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:19,952 INFO L378 Elim1Store]: Elim1 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 3151 treesize of output 3123 [2023-12-02 17:20:20,053 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:20,054 INFO L378 Elim1Store]: Elim1 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 3123 treesize of output 3095 [2023-12-02 17:20:20,157 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:20,159 INFO L378 Elim1Store]: Elim1 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 3095 treesize of output 3081 [2023-12-02 17:20:20,270 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:20:20,272 INFO L378 Elim1Store]: Elim1 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 3081 treesize of output 3049 [2023-12-02 17:20:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:20:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031283690] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:20:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [567783167] [2023-12-02 17:20:25,208 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:20:25,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:20:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 47 [2023-12-02 17:20:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905770715] [2023-12-02 17:20:25,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:20:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 17:20:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:20:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 17:20:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2066, Unknown=10, NotChecked=0, Total=2256 [2023-12-02 17:20:25,210 INFO L87 Difference]: Start difference. First operand 1052 states and 3519 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 47 states have internal predecessors, (99), 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) [2023-12-02 17:20:42,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:20:44,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:20:55,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:20:57,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:20,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:22,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:24,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:26,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:28,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:31,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:33,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:44,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:46,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:50,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:21:52,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:04,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:10,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:15,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:17,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:30,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:32,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:34,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:38,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:40,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:42,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:45,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:47,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:49,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:51,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:22:53,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:14,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:16,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:19,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:21,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:23,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:25,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:27,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:29,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:31,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:33,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:35,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:37,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:39,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:47,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:49,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:51,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:53,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:55,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:57,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:23:59,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:02,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:04,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:17,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:19,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:21,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:24,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:26,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:28,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:30,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:32,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:34,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:36,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:38,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:40,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:42,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:44,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:46,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:48,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:50,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:52,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:55,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:24:57,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:03,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:05,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:07,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:10,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:12,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:14,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:16,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:19,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:21,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:23,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:25,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:27,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:29,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:33,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:35,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:37,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:39,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:41,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:43,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:45,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:47,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:51,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:53,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:56,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:25:58,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:00,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:02,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:04,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:07,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:09,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:11,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:15,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:18,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:20,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:25,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:27,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:30,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:32,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:26:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:26:35,374 INFO L93 Difference]: Finished difference Result 3765 states and 12353 transitions. [2023-12-02 17:26:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-02 17:26:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 47 states have internal predecessors, (99), 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 [2023-12-02 17:26:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:26:35,381 INFO L225 Difference]: With dead ends: 3765 [2023-12-02 17:26:35,381 INFO L226 Difference]: Without dead ends: 3744 [2023-12-02 17:26:35,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4249 ImplicationChecksByTransitivity, 100.6s TimeCoverageRelationStatistics Valid=1199, Invalid=12847, Unknown=234, NotChecked=0, Total=14280 [2023-12-02 17:26:35,382 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1470 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 7152 mSolverCounterSat, 220 mSolverCounterUnsat, 1153 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 269.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 8525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 7152 IncrementalHoareTripleChecker+Invalid, 1153 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 272.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:26:35,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 252 Invalid, 8525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 7152 Invalid, 1153 Unknown, 0 Unchecked, 272.9s Time] [2023-12-02 17:26:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2023-12-02 17:26:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 1391. [2023-12-02 17:26:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1390 states have (on average 3.3906474820143884) internal successors, (4713), 1390 states have internal predecessors, (4713), 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) [2023-12-02 17:26:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 4713 transitions. [2023-12-02 17:26:35,415 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 4713 transitions. Word has length 35 [2023-12-02 17:26:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:26:35,415 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 4713 transitions. [2023-12-02 17:26:35,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 47 states have internal predecessors, (99), 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) [2023-12-02 17:26:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 4713 transitions. [2023-12-02 17:26:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 17:26:35,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:26:35,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:26:35,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 17:26:35,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:26:35,618 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:26:35,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:26:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1073209016, now seen corresponding path program 3 times [2023-12-02 17:26:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:26:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373989651] [2023-12-02 17:26:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:26:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:26:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:26:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:26:38,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:26:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373989651] [2023-12-02 17:26:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373989651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:26:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251144721] [2023-12-02 17:26:38,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:26:38,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:26:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:26:38,058 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:26:38,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 17:26:38,199 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:26:38,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:26:38,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 17:26:38,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:26:38,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:26:38,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:26:38,212 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-12-02 17:26:38,353 INFO L378 Elim1Store]: Elim1 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 1 [2023-12-02 17:26:38,416 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-02 17:26:39,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:26:39,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:26:39,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:26:41,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:26:41,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 72 [2023-12-02 17:26:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:26:41,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:26:59,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~max2~0 1))) (let ((.cse15 (= c_~max1~0 c_~max3~0)) (.cse59 (< c_~max2~0 c_~max3~0)) (.cse81 (< c_~max3~0 .cse12)) (.cse0 (= c_~max1~0 c_~max2~0)) (.cse4 (+ c_~max3~0 1)) (.cse8 (+ c_~max1~0 1)) (.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse5 (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 .cse2)) (.cse1 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse1 .cse2)) (< .cse3 .cse4) (= .cse3 c_~max1~0) (< c_~max1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse7 .cse8) (< .cse7 (select .cse9 .cse2)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 .cse2)) (.cse10 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse7 .cse10) (< .cse11 .cse4) (< .cse10 .cse11) (< .cse10 .cse12)))))))))) (or .cse15 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (+ .cse16 1)) (< c_~max1~0 (select .cse17 .cse2)) (< c_~max3~0 (select .cse18 .cse2)) (< c_~max1~0 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse16 .cse12))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse24 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse22 (select (store (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse20 c_~max3~0) (= .cse21 .cse20) (< c_~max3~0 (select .cse22 .cse2)) (< .cse20 .cse12))))) (< c_~max1~0 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse21 .cse8)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse25 .cse2)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select .cse27 .cse2))) (or (< .cse26 .cse12) (< .cse26 .cse4) (= .cse26 c_~max1~0) (< c_~max2~0 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< c_~max1~0 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse30 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select (store (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (select .cse30 .cse2))) (or (< c_~max3~0 (select .cse29 .cse2)) (< c_~max1~0 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse31 .cse8) (< c_~max2~0 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse31 c_~max3~0) (= .cse31 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse33 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse35 (select (store (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (select .cse36 .cse2))) (or (< .cse33 .cse8) (< .cse34 (+ .cse33 1)) (< c_~max3~0 (select .cse35 .cse2)) (< c_~max2~0 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse34 c_~max3~0) (= .cse34 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse40 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse39 (select (store (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse39 .cse2))) (or (< .cse38 .cse12) (< .cse38 .cse4) (< c_~max2~0 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse38 .cse40))))) (< .cse40 .cse8) (< .cse40 (select .cse42 .cse2))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse43 .cse8) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse45 (select (store (store .cse46 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (+ .cse44 1)) (< c_~max3~0 (select .cse45 .cse2)) (< .cse44 .cse12))))) (< .cse43 (select .cse47 .cse2)) (= .cse43 c_~max3~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse53 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse51 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse52 (select .cse53 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse49 (select (store (store .cse50 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse48 (select .cse49 .cse2))) (or (< c_~max2~0 .cse48) (< .cse48 .cse4) (< c_~max2~0 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< .cse51 .cse8) (< .cse52 (+ .cse51 1)) (= .cse52 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse58 (select .cse57 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse55 (select (store (store .cse56 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (+ .cse54 1)) (< c_~max3~0 (select .cse55 .cse2)) (< .cse54 .cse12))))) (< c_~max1~0 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse58 .cse8) (= .cse58 c_~max3~0)))))) (or .cse59 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse61 (select .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse60 (select (store (store .cse63 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse62 (select .cse61 .cse2))) (or (< c_~max3~0 (select .cse60 .cse2)) (< c_~max1~0 (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse62 .cse8) (< c_~max2~0 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse62 c_~max2~0))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse66 (select (store (store .cse67 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse65 (select .cse66 .cse2)) (.cse64 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~max1~0 .cse64) (< .cse65 .cse4) (< .cse64 .cse65) (< .cse64 .cse12))))) (< c_~max1~0 (select .cse68 .cse2)) (< c_~max1~0 (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse69 (select .cse74 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse70 (select .cse74 .cse2))) (or (< .cse69 .cse8) (< .cse70 (+ .cse69 1)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse72 (select (store (store .cse73 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse71 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (+ .cse71 1)) (< c_~max3~0 (select .cse72 .cse2)) (< .cse71 .cse12))))) (= .cse70 c_~max3~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse76 (select .cse80 .cse2)) (.cse79 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse77 (select (store (store .cse78 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse75 (select .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse75 c_~max3~0) (= .cse76 .cse75) (< c_~max3~0 (select .cse77 .cse2)) (< .cse75 .cse12))))) (< .cse79 .cse8) (< .cse76 (+ .cse79 1))))))) (or .cse81 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse85 (select .cse86 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse82 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse84 (select (store (store .cse86 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse83 (select .cse85 .cse2))) (or (< .cse82 .cse8) (< .cse83 (+ .cse82 1)) (< c_~max3~0 (select .cse84 .cse2)) (< c_~max2~0 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse83 c_~max3~0))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse92 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse87 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse87 .cse8) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse90 (select (store (store .cse91 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse88 (select .cse90 .cse2)) (.cse89 (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse88 .cse4) (< .cse89 .cse12) (= .cse88 .cse87) (< .cse88 (+ .cse89 1)))))) (< .cse87 (select .cse92 .cse2))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse93 (select .cse98 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse94 (select .cse93 .cse2))) (or (< c_~max1~0 (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse94 .cse8) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse97 (select (store (store .cse98 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse95 (select .cse97 .cse2)) (.cse96 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse94 .cse95) (< .cse95 .cse4) (< .cse96 .cse12) (< .cse95 (+ .cse96 1))))))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse100 (select .cse103 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse99 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse99 .cse8) (< .cse99 (select .cse100 .cse2)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse102 (select (store (store .cse103 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse101 (select .cse102 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse101 c_~max3~0) (= .cse99 .cse101) (< c_~max3~0 (select .cse102 .cse2)) (< .cse101 .cse12)))))))))) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse106 (select .cse107 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse104 (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse105 (select (store (store .cse107 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= .cse104 c_~max2~0) (< .cse104 .cse8) (< c_~max3~0 (select .cse105 .cse2)) (< .cse104 (select .cse106 .cse2)) (= .cse104 c_~max3~0) (< c_~max2~0 (select .cse105 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse112 (select .cse111 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse108 (select .cse112 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse110 (select (store (store .cse111 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse109 (select .cse110 .cse2))) (or (= .cse108 .cse109) (< .cse109 .cse12) (< .cse109 .cse4) (< c_~max2~0 (select .cse110 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< c_~max1~0 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse108 .cse8)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse118 (select .cse116 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse113 (select .cse118 .cse2)) (.cse117 (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse115 (select (store (store .cse116 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse114 (select .cse115 .cse2))) (or (= .cse113 .cse114) (< .cse114 .cse12) (< .cse114 .cse4) (< c_~max2~0 (select .cse115 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< .cse117 .cse8) (< .cse113 (+ .cse117 1))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse121 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse122 (select .cse121 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse123 (select .cse122 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse120 (select (store (store .cse121 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse119 (select .cse120 .cse2))) (or (< c_~max2~0 .cse119) (< .cse119 .cse4) (< c_~max2~0 (select .cse120 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< c_~max1~0 (select .cse122 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse123 .cse8) (= .cse123 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse130 (select .cse128 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse124 (select .cse130 .cse2)) (.cse129 (select .cse130 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse127 (select (store (store .cse128 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse126 (select .cse127 .cse2)) (.cse125 (select .cse127 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse124 .cse125) (< .cse126 .cse4) (< .cse125 .cse126) (< .cse125 .cse12))))) (< .cse129 .cse8) (< .cse124 (+ .cse129 1))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse131 (select .cse135 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse133 (select (store (store .cse134 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse132 (select .cse133 .cse2))) (or (= .cse131 .cse132) (< .cse132 .cse4) (< c_~max2~0 (select .cse133 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< c_~max1~0 (select .cse135 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse131 .cse8) (= .cse131 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse139 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse140 (select .cse139 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse138 (select (store (store .cse139 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse137 (select .cse138 .cse2)) (.cse136 (select .cse138 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~max1~0 .cse136) (< .cse137 .cse4) (= .cse137 c_~max1~0) (< .cse136 .cse12))))) (< c_~max1~0 (select .cse140 .cse2)) (< c_~max1~0 (select .cse140 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse145 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse147 (select .cse145 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse141 (select .cse147 .cse2)) (.cse146 (select .cse147 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse144 (select (store (store .cse145 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse142 (select .cse144 .cse2)) (.cse143 (select .cse144 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse141 .cse142) (= .cse141 .cse143) (< .cse142 .cse4) (< .cse143 .cse12))))) (< .cse146 .cse8) (< .cse141 (+ .cse146 1))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse152 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse148 (select .cse152 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse149 (select .cse148 .cse2))) (or (< c_~max1~0 (select .cse148 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse149 .cse8) (= .cse149 c_~max3~0) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse151 (select (store (store .cse152 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse150 (select .cse151 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse149 .cse150) (< c_~max3~0 (select .cse151 .cse2)) (< .cse150 .cse12)))))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse156 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse158 (select .cse156 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse157 (select .cse158 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse153 (select .cse158 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse155 (select (store (store .cse156 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse154 (select .cse155 .cse2))) (or (= .cse153 .cse154) (< .cse154 .cse4) (< c_~max2~0 (select .cse155 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (< .cse157 .cse8) (< .cse153 (+ .cse157 1)) (= .cse153 c_~max2~0)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse163 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse164 (select .cse163 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse159 (select .cse164 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse162 (select (store (store .cse163 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse160 (select .cse162 .cse2)) (.cse161 (select .cse162 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse159 .cse160) (= .cse159 .cse161) (< .cse160 .cse4) (< .cse161 .cse12))))) (< c_~max1~0 (select .cse164 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse159 .cse8)))))) (or (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse168 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse167 (select .cse168 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse165 (select .cse167 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse166 (select (store (store .cse168 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= .cse165 c_~max2~0) (< .cse165 .cse8) (< c_~max3~0 (select .cse166 .cse2)) (< .cse165 (select .cse167 .cse2)) (< c_~max2~0 (select .cse166 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) .cse59) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse172 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse173 (select .cse172 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse171 (select (store (store .cse172 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse169 (select .cse171 .cse2)) (.cse170 (select .cse171 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse169 .cse4) (= .cse169 c_~max1~0) (< .cse170 .cse12) (< .cse169 (+ .cse170 1)))))) (< c_~max1~0 (select .cse173 .cse2)) (< c_~max1~0 (select .cse173 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse179 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse180 (select .cse179 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse174 (select .cse180 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse175 (select .cse180 .cse2))) (or (< .cse174 .cse8) (< .cse175 (+ .cse174 1)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse178 (select (store (store .cse179 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse176 (select .cse178 .cse2)) (.cse177 (select .cse178 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse175 .cse176) (< .cse176 .cse4) (< .cse177 .cse12) (< .cse176 (+ .cse177 1))))))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse185 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse182 (select .cse185 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse181 (select .cse182 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse181 .cse8) (< .cse181 (select .cse182 .cse2)) (= .cse181 c_~max3~0) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse184 (select (store (store .cse185 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse183 (select .cse184 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse181 .cse183) (< c_~max3~0 (select .cse184 .cse2)) (< .cse183 .cse12)))))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse188 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse189 (select .cse188 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse187 (select (store (store .cse188 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse186 (select .cse187 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse186 c_~max3~0) (= c_~max1~0 .cse186) (< c_~max3~0 (select .cse187 .cse2)) (< .cse186 .cse12))))) (< c_~max1~0 (select .cse189 .cse2)) (< c_~max1~0 (select .cse189 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse194 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse195 (select .cse194 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse190 (select .cse195 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse191 (select .cse195 .cse2))) (or (< .cse190 .cse8) (< .cse191 (+ .cse190 1)) (= .cse191 c_~max3~0) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse193 (select (store (store .cse194 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse192 (select .cse193 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse191 .cse192) (< c_~max3~0 (select .cse193 .cse2)) (< .cse192 .cse12)))))))))) (or (and .cse15 (<= .cse12 c_~max3~0)) (and .cse0 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse198 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse196 (select .cse198 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse197 (select (store (store .cse198 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse196 .cse2)) (< c_~max3~0 (select .cse197 .cse2)) (< c_~max1~0 (select .cse196 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select .cse197 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse202 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse203 (select .cse202 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse201 (select .cse203 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse200 (select (store (store .cse202 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse199 (select .cse200 .cse2))) (or (< .cse199 .cse4) (< c_~max2~0 (select .cse200 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse199 .cse201))))) (= .cse201 c_~max2~0) (< .cse201 .cse8) (< .cse201 (select .cse203 .cse2))))))) (or .cse81 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse207 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse206 (select .cse207 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse204 (select .cse206 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse205 (select (store (store .cse207 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< .cse204 .cse8) (< c_~max3~0 (select .cse205 .cse2)) (< .cse204 (select .cse206 .cse2)) (= .cse204 c_~max3~0) (< c_~max2~0 (select .cse205 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or .cse15 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse211 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse210 (select (store (store .cse211 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse209 (select .cse211 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse208 (select .cse210 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~max1~0 .cse208) (< c_~max1~0 (select .cse209 .cse2)) (< c_~max3~0 (select .cse210 .cse2)) (< c_~max1~0 (select .cse209 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse208 .cse12))))))) (or .cse59 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse216 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse215 (select .cse216 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse212 (select .cse215 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse214 (select (store (store .cse216 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse213 (select .cse215 .cse2))) (or (< .cse212 .cse8) (< .cse213 (+ .cse212 1)) (< c_~max3~0 (select .cse214 .cse2)) (< c_~max2~0 (select .cse214 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse213 c_~max2~0))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse221 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse222 (select .cse221 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse217 (select .cse222 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse220 (select (store (store .cse221 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse218 (select .cse220 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse219 (select .cse220 .cse2))) (or (= .cse217 .cse218) (< .cse219 .cse4) (< .cse218 .cse12) (= .cse219 .cse217))))) (< .cse217 .cse8) (< .cse217 (select .cse222 .cse2))))))) (or (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse226 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse224 (select .cse226 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse223 (select (store (store .cse226 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse225 (select .cse224 .cse2))) (or (< c_~max3~0 (select .cse223 .cse2)) (< c_~max1~0 (select .cse224 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse225 .cse8) (< c_~max2~0 (select .cse223 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse225 c_~max3~0)))))) .cse81) (or .cse0 (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse230 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse229 (select (store (store .cse230 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse227 (select .cse229 .cse2)) (.cse228 (select .cse230 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max2~0 .cse227) (< c_~max1~0 (select .cse228 .cse2)) (< .cse227 .cse4) (< c_~max1~0 (select .cse228 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select .cse229 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse233 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse235 (select .cse233 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse234 (select .cse235 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse232 (select (store (store .cse233 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse231 (select .cse232 .cse2))) (or (< c_~max2~0 .cse231) (< .cse231 .cse4) (< c_~max2~0 (select .cse232 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (= .cse234 c_~max2~0) (< .cse234 .cse8) (< .cse234 (select .cse235 .cse2))))))) (forall ((v_ArrVal_867 (Array Int Int))) (let ((.cse240 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_867))) (let ((.cse241 (select .cse240 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse236 (select .cse241 .cse2))) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (let ((.cse239 (select (store (store .cse240 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse238 (select .cse239 .cse2)) (.cse237 (select .cse239 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse236 .cse237) (< .cse238 .cse4) (< .cse237 .cse238) (< .cse237 .cse12))))) (< c_~max1~0 (select .cse241 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse236 .cse8))))))))) is different from false [2023-12-02 17:26:59,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:26:59,769 INFO L378 Elim1Store]: Elim1 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 192 treesize of output 120 [2023-12-02 17:26:59,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:26:59,791 INFO L378 Elim1Store]: Elim1 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 6071 treesize of output 5549 [2023-12-02 17:26:59,840 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 309 treesize of output 281 [2023-12-02 17:26:59,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:26:59,861 INFO L378 Elim1Store]: Elim1 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 451 treesize of output 395 [2023-12-02 17:26:59,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:26:59,887 INFO L378 Elim1Store]: Elim1 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 221 treesize of output 193 [2023-12-02 17:27:00,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,098 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 88 [2023-12-02 17:27:00,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 96 [2023-12-02 17:27:00,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,119 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 42 [2023-12-02 17:27:00,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,147 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 103 [2023-12-02 17:27:00,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 139 treesize of output 111 [2023-12-02 17:27:00,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,173 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 51 [2023-12-02 17:27:00,205 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,206 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 1 [2023-12-02 17:27:00,215 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,215 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-12-02 17:27:00,224 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,225 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 1 [2023-12-02 17:27:00,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,234 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 108 [2023-12-02 17:27:00,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 153 treesize of output 121 [2023-12-02 17:27:00,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,259 INFO L378 Elim1Store]: Elim1 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 65 treesize of output 47 [2023-12-02 17:27:00,296 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,296 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 17:27:00,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,306 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 83 [2023-12-02 17:27:00,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 122 treesize of output 96 [2023-12-02 17:27:00,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,338 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 42 [2023-12-02 17:27:00,361 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,361 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 1 [2023-12-02 17:27:00,372 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,373 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2023-12-02 17:27:00,382 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,382 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 1 [2023-12-02 17:27:00,391 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,391 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 1 [2023-12-02 17:27:00,401 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,401 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2023-12-02 17:27:00,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,414 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 89 [2023-12-02 17:27:00,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,419 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 122 treesize of output 98 [2023-12-02 17:27:00,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,438 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 42 [2023-12-02 17:27:00,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,478 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 1 [2023-12-02 17:27:00,488 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,489 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 17:27:00,500 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,500 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 17:27:00,509 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,509 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 1 [2023-12-02 17:27:00,518 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,518 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2023-12-02 17:27:00,527 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,527 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 1 [2023-12-02 17:27:00,535 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,536 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 1 [2023-12-02 17:27:00,544 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,545 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 1 [2023-12-02 17:27:00,553 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,554 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 1 [2023-12-02 17:27:00,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,568 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 69 [2023-12-02 17:27:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:27:00,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 93 treesize of output 73 [2023-12-02 17:27:00,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:27:00,594 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 37 [2023-12-02 17:27:00,616 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,616 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 1 [2023-12-02 17:27:00,627 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,628 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 1 [2023-12-02 17:27:00,639 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,640 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 1 [2023-12-02 17:27:00,651 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,651 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2023-12-02 17:27:00,661 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,662 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 1 [2023-12-02 17:27:00,672 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,673 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-12-02 17:27:00,682 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,682 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-12-02 17:27:00,692 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,692 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 1 [2023-12-02 17:27:00,702 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,702 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 1 [2023-12-02 17:27:00,711 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,711 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 17:27:00,721 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,722 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 1 [2023-12-02 17:27:00,732 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,732 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-12-02 17:27:00,742 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,742 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 1 [2023-12-02 17:27:00,753 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,753 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 1 [2023-12-02 17:27:00,762 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,763 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2023-12-02 17:27:00,774 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,775 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2023-12-02 17:27:00,786 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,787 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 1 [2023-12-02 17:27:00,799 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,799 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 1 [2023-12-02 17:27:00,812 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,812 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2023-12-02 17:27:00,825 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,825 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 1 [2023-12-02 17:27:00,835 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:27:00,835 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 1 [2023-12-02 17:27:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 17:27:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251144721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:27:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961213484] [2023-12-02 17:27:01,011 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:27:01,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:27:01,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 50 [2023-12-02 17:27:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410582773] [2023-12-02 17:27:01,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:27:01,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 17:27:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:27:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 17:27:01,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2207, Unknown=17, NotChecked=96, Total=2550 [2023-12-02 17:27:01,013 INFO L87 Difference]: Start difference. First operand 1391 states and 4713 transitions. Second operand has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 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) [2023-12-02 17:27:10,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:28:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:28:29,903 INFO L93 Difference]: Finished difference Result 2758 states and 8923 transitions. [2023-12-02 17:28:29,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 17:28:29,904 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 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 [2023-12-02 17:28:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:28:29,908 INFO L225 Difference]: With dead ends: 2758 [2023-12-02 17:28:29,908 INFO L226 Difference]: Without dead ends: 2744 [2023-12-02 17:28:29,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=672, Invalid=5960, Unknown=178, NotChecked=162, Total=6972 [2023-12-02 17:28:29,909 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 768 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3755 mSolverCounterSat, 128 mSolverCounterUnsat, 509 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 4812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3755 IncrementalHoareTripleChecker+Invalid, 509 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 51.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:28:29,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 50 Invalid, 4812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 3755 Invalid, 509 Unknown, 420 Unchecked, 51.1s Time] [2023-12-02 17:28:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2023-12-02 17:28:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1411. [2023-12-02 17:28:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1410 states have (on average 3.3836879432624114) internal successors, (4771), 1410 states have internal predecessors, (4771), 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) [2023-12-02 17:28:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4771 transitions. [2023-12-02 17:28:29,946 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4771 transitions. Word has length 35 [2023-12-02 17:28:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:28:29,947 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 4771 transitions. [2023-12-02 17:28:29,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 50 states have internal predecessors, (99), 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) [2023-12-02 17:28:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4771 transitions. [2023-12-02 17:28:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 17:28:29,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:28:29,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:28:29,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 17:28:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 17:28:30,151 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:28:30,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:28:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 63964734, now seen corresponding path program 4 times [2023-12-02 17:28:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:28:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55820542] [2023-12-02 17:28:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:28:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:28:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:28:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:28:33,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:28:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55820542] [2023-12-02 17:28:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55820542] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:28:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587014558] [2023-12-02 17:28:33,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:28:33,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:28:33,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:28:33,125 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:28:33,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 17:28:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:28:33,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 17:28:33,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:28:34,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:28:34,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:28:34,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:28:34,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 69 [2023-12-02 17:28:35,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:28:35,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 72 [2023-12-02 17:28:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:28:36,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:28:42,513 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-12-02 17:28:42,515 INFO L378 Elim1Store]: Elim1 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 6975 treesize of output 6011 [2023-12-02 17:28:42,806 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:42,808 INFO L378 Elim1Store]: Elim1 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 3917 treesize of output 3901 [2023-12-02 17:28:42,931 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:42,932 INFO L378 Elim1Store]: Elim1 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 3901 treesize of output 3869 [2023-12-02 17:28:43,044 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,045 INFO L378 Elim1Store]: Elim1 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 3869 treesize of output 3849 [2023-12-02 17:28:43,167 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,168 INFO L378 Elim1Store]: Elim1 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 3849 treesize of output 3839 [2023-12-02 17:28:43,280 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,281 INFO L378 Elim1Store]: Elim1 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 3839 treesize of output 3795 [2023-12-02 17:28:43,391 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,392 INFO L378 Elim1Store]: Elim1 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 3795 treesize of output 3773 [2023-12-02 17:28:43,502 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,503 INFO L378 Elim1Store]: Elim1 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 3773 treesize of output 3749 [2023-12-02 17:28:43,624 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,625 INFO L378 Elim1Store]: Elim1 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 3749 treesize of output 3737 [2023-12-02 17:28:43,735 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,736 INFO L378 Elim1Store]: Elim1 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 3737 treesize of output 3729 [2023-12-02 17:28:43,846 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,847 INFO L378 Elim1Store]: Elim1 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 3729 treesize of output 3713 [2023-12-02 17:28:43,955 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:43,957 INFO L378 Elim1Store]: Elim1 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 3713 treesize of output 3703 [2023-12-02 17:28:44,065 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,067 INFO L378 Elim1Store]: Elim1 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 3703 treesize of output 3683 [2023-12-02 17:28:44,193 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,194 INFO L378 Elim1Store]: Elim1 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 3683 treesize of output 3655 [2023-12-02 17:28:44,306 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,307 INFO L378 Elim1Store]: Elim1 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 3655 treesize of output 3641 [2023-12-02 17:28:44,421 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,422 INFO L378 Elim1Store]: Elim1 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 3641 treesize of output 3627 [2023-12-02 17:28:44,548 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,550 INFO L378 Elim1Store]: Elim1 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 3627 treesize of output 3599 [2023-12-02 17:28:44,670 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,672 INFO L378 Elim1Store]: Elim1 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 3599 treesize of output 3563 [2023-12-02 17:28:44,800 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,801 INFO L378 Elim1Store]: Elim1 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 3563 treesize of output 3545 [2023-12-02 17:28:44,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:44,944 INFO L378 Elim1Store]: Elim1 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 3545 treesize of output 3525 [2023-12-02 17:28:45,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,063 INFO L378 Elim1Store]: Elim1 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 3525 treesize of output 3485 [2023-12-02 17:28:45,225 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,226 INFO L378 Elim1Store]: Elim1 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 3485 treesize of output 3471 [2023-12-02 17:28:45,338 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,339 INFO L378 Elim1Store]: Elim1 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 3471 treesize of output 3443 [2023-12-02 17:28:45,475 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,476 INFO L378 Elim1Store]: Elim1 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 3443 treesize of output 3421 [2023-12-02 17:28:45,583 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,584 INFO L378 Elim1Store]: Elim1 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 3421 treesize of output 3377 [2023-12-02 17:28:45,695 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,696 INFO L378 Elim1Store]: Elim1 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 3377 treesize of output 3365 [2023-12-02 17:28:45,804 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,805 INFO L378 Elim1Store]: Elim1 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 3365 treesize of output 3341 [2023-12-02 17:28:45,923 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:45,924 INFO L378 Elim1Store]: Elim1 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 3341 treesize of output 3301 [2023-12-02 17:28:46,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,064 INFO L378 Elim1Store]: Elim1 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 3301 treesize of output 3281 [2023-12-02 17:28:46,173 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,174 INFO L378 Elim1Store]: Elim1 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 3281 treesize of output 3265 [2023-12-02 17:28:46,284 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,286 INFO L378 Elim1Store]: Elim1 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 3265 treesize of output 3233 [2023-12-02 17:28:46,394 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,395 INFO L378 Elim1Store]: Elim1 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 3233 treesize of output 3213 [2023-12-02 17:28:46,506 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,507 INFO L378 Elim1Store]: Elim1 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 3213 treesize of output 3203 [2023-12-02 17:28:46,623 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,625 INFO L378 Elim1Store]: Elim1 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 3203 treesize of output 3189 [2023-12-02 17:28:46,757 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,758 INFO L378 Elim1Store]: Elim1 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 3189 treesize of output 3161 [2023-12-02 17:28:46,883 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:46,885 INFO L378 Elim1Store]: Elim1 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 3161 treesize of output 3141 [2023-12-02 17:28:47,007 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:47,009 INFO L378 Elim1Store]: Elim1 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 3141 treesize of output 3131 [2023-12-02 17:28:47,131 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:47,132 INFO L378 Elim1Store]: Elim1 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 3131 treesize of output 3123 [2023-12-02 17:28:47,247 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:47,248 INFO L378 Elim1Store]: Elim1 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 3123 treesize of output 3107 [2023-12-02 17:28:47,372 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:47,373 INFO L378 Elim1Store]: Elim1 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 3107 treesize of output 3089 [2023-12-02 17:28:47,498 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:28:47,499 INFO L378 Elim1Store]: Elim1 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 3089 treesize of output 3053 [2023-12-02 17:28:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:28:56,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587014558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:28:56,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1366782796] [2023-12-02 17:28:56,088 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:28:56,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:28:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 48 [2023-12-02 17:28:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817882123] [2023-12-02 17:28:56,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:28:56,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 17:28:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:28:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 17:28:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2151, Unknown=8, NotChecked=0, Total=2352 [2023-12-02 17:28:56,090 INFO L87 Difference]: Start difference. First operand 1411 states and 4771 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 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) [2023-12-02 17:30:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:30,303 INFO L93 Difference]: Finished difference Result 4702 states and 15386 transitions. [2023-12-02 17:30:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-02 17:30:30,304 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 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 [2023-12-02 17:30:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:30,311 INFO L225 Difference]: With dead ends: 4702 [2023-12-02 17:30:30,312 INFO L226 Difference]: Without dead ends: 4695 [2023-12-02 17:30:30,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 69.7s TimeCoverageRelationStatistics Valid=1438, Invalid=13419, Unknown=149, NotChecked=0, Total=15006 [2023-12-02 17:30:30,313 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1450 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 7509 mSolverCounterSat, 374 mSolverCounterUnsat, 201 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 7509 IncrementalHoareTripleChecker+Invalid, 201 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:30,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 219 Invalid, 8084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 7509 Invalid, 201 Unknown, 0 Unchecked, 29.2s Time] [2023-12-02 17:30:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2023-12-02 17:30:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 1507. [2023-12-02 17:30:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 3.3904382470119523) internal successors, (5106), 1506 states have internal predecessors, (5106), 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) [2023-12-02 17:30:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 5106 transitions. [2023-12-02 17:30:30,358 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 5106 transitions. Word has length 35 [2023-12-02 17:30:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:30,358 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 5106 transitions. [2023-12-02 17:30:30,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 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) [2023-12-02 17:30:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 5106 transitions. [2023-12-02 17:30:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 17:30:30,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:30,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:30,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 17:30:30,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 17:30:30,562 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:30:30,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1401409361, now seen corresponding path program 21 times [2023-12-02 17:30:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38711055] [2023-12-02 17:30:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:33,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38711055] [2023-12-02 17:30:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38711055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358076849] [2023-12-02 17:30:33,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:30:33,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:33,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:33,252 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:33,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 17:30:33,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:30:33,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:30:33,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 17:30:33,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:33,414 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-12-02 17:30:33,546 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2023-12-02 17:30:33,608 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-02 17:30:34,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2023-12-02 17:30:34,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2023-12-02 17:30:36,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:36,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 141 treesize of output 77 [2023-12-02 17:30:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:36,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:54,544 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~max2~0 1))) (let ((.cse25 (< c_~max2~0 c_~max3~0)) (.cse142 (< c_~max3~0 .cse12)) (.cse61 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~max3~0 1)) (.cse8 (+ c_~max1~0 1)) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 .cse6))) (or (= .cse0 c_~max2~0) (< c_~max1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse5 (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (select .cse5 .cse6))) (or (< .cse2 .cse3) (< .cse4 (+ .cse2 1)) (< c_~max2~0 .cse4))))) (< .cse0 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse9 .cse6))) (or (< c_~max1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse10 .cse11) (< .cse11 .cse3) (< .cse11 .cse12) (< .cse11 (select .cse13 .cse6)))))) (< .cse10 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse15 .cse8) (< .cse15 (select .cse16 .cse6)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse17 (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse17 .cse6))) (or (< c_~max3~0 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse18 .cse12) (< .cse18 .cse3) (= .cse18 .cse15)))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse21 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse21 .cse6))) (or (= .cse20 c_~max2~0) (< c_~max1~0 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse22 (select (store (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse23 (select .cse22 .cse6))) (or (< c_~max3~0 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse23 .cse3) (= .cse20 .cse23))))) (< .cse20 .cse8)))))) (or .cse25 (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select (store (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse27 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse26 .cse6)) (< .cse27 .cse8) (= c_~max2~0 .cse27) (< .cse27 (select .cse28 .cse6)))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse35 .cse6)) (.cse31 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse30 c_~max2~0) (< .cse30 (+ .cse31 1)) (< .cse31 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse32 (select (store (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse33 (select .cse32 .cse6))) (or (< c_~max3~0 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse33 .cse3) (< c_~max2~0 .cse33)))))))))) (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select (store (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse36 (select .cse37 .cse6))) (or (= .cse36 c_~max2~0) (< c_~max1~0 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse38 .cse6)) (= .cse36 c_~max3~0) (< .cse36 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse41 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse40 .cse8) (= c_~max2~0 .cse40) (< .cse40 (select .cse41 .cse6)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse43 (select (store (store .cse44 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse42 .cse3) (= .cse42 .cse40) (< .cse42 (select .cse43 .cse6))))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse45 (select .cse50 .cse6))) (or (= .cse45 c_~max2~0) (< .cse45 (+ .cse46 1)) (< .cse46 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse47 (select (store (store .cse49 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse48 (select .cse47 .cse6))) (or (< c_~max3~0 (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse48 .cse3) (= .cse45 .cse48)))))))))) (or (and (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse54 (select (store (store .cse55 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse53 (select .cse54 .cse6))) (or (< .cse52 .cse3) (< .cse53 (+ .cse52 1)) (< c_~max2~0 .cse53))))) (< c_~max1~0 (select .cse51 .cse6)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse59 (select (store (store .cse60 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse57 (select .cse59 .cse6)) (.cse58 (select .cse59 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~max1~0 .cse57) (< .cse58 .cse3) (< .cse57 (+ .cse58 1)))))) (< c_~max1~0 (select .cse56 .cse6))))))) .cse61) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse63 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse62 .cse8) (< .cse62 (select .cse63 .cse6)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse66 (select (store (store .cse67 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse65 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse64 (select .cse66 .cse6))) (or (< .cse64 .cse12) (< .cse65 .cse3) (< .cse64 (+ .cse65 1)) (= .cse64 .cse62)))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse69 (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse68 (select .cse69 .cse6))) (or (= .cse68 c_~max2~0) (< c_~max1~0 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse71 (select (store (store .cse72 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse70 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse70 .cse3) (< c_~max2~0 .cse70) (< .cse70 (select .cse71 .cse6)))))) (< .cse68 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse78 (select .cse77 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse74 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse73 (select .cse78 .cse6))) (or (< .cse73 (+ .cse74 1)) (< .cse74 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse75 (select (store (store .cse77 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse76 (select .cse75 .cse6))) (or (< c_~max3~0 (select .cse75 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse76 .cse12) (< .cse76 .cse3) (= .cse73 .cse76)))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse80 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse79 (select .cse80 .cse6))) (or (= .cse79 c_~max2~0) (< c_~max1~0 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse83 (select (store (store .cse84 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse81 (select .cse83 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse82 (select .cse83 .cse6))) (or (< .cse81 .cse3) (< .cse82 (+ .cse81 1)) (= .cse79 .cse82))))) (< .cse79 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse90 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse85 (select .cse90 .cse6)) (.cse89 (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse85 c_~max2~0) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse87 (select (store (store .cse88 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse86 (select .cse87 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse85 .cse86) (< .cse86 .cse3) (< .cse86 (select .cse87 .cse6)))))) (< .cse85 (+ .cse89 1)) (< .cse89 .cse8)))))) (or .cse61 (and (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse91 (select .cse94 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse91 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse93 (select (store (store .cse94 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse92 (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse92 .cse3) (< c_~max2~0 .cse92) (< .cse92 (select .cse93 .cse6)))))) (< c_~max1~0 (select .cse91 .cse6)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse95 (select .cse98 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse95 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse97 (select (store (store .cse98 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse96 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse96 .cse3) (= c_~max1~0 .cse96) (< .cse96 (select .cse97 .cse6)))))) (< c_~max1~0 (select .cse95 .cse6)))))))) (or .cse25 (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse100 (select .cse102 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse101 (select (store (store .cse102 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse99 (select .cse100 .cse6))) (or (= .cse99 c_~max2~0) (< c_~max1~0 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse101 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse101 .cse6)) (< .cse99 .cse8))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse103 (select .cse107 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse106 (select .cse103 .cse6))) (or (< c_~max1~0 (select .cse103 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse104 (select (store (store .cse107 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse105 (select .cse104 .cse6))) (or (< c_~max3~0 (select .cse104 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse105 .cse12) (< .cse105 .cse3) (= .cse106 .cse105))))) (< .cse106 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse112 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse113 (select .cse112 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse109 (select .cse113 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse108 (select .cse113 .cse6))) (or (< .cse108 (+ .cse109 1)) (< .cse109 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse111 (select (store (store .cse112 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse110 (select .cse111 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse108 .cse110) (< .cse110 .cse3) (< .cse110 .cse12) (< .cse110 (select .cse111 .cse6))))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse118 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse119 (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse116 (select .cse119 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse117 (select (store (store .cse118 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse114 (select .cse117 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse115 (select .cse117 .cse6))) (or (< .cse114 .cse3) (< .cse115 (+ .cse114 1)) (= .cse115 .cse116))))) (< .cse116 .cse8) (= c_~max2~0 .cse116) (< .cse116 (select .cse119 .cse6))))))) (or (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse124 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse123 (select .cse124 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse121 (select (store (store .cse124 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse120 (select .cse123 .cse6)) (.cse122 (select .cse123 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse120 c_~max2~0) (< c_~max3~0 (select .cse121 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse121 .cse6)) (< .cse120 (+ .cse122 1)) (< .cse122 .cse8)))))) .cse25) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse129 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse126 (select .cse129 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse125 (select .cse126 .cse6))) (or (= .cse125 c_~max2~0) (< c_~max1~0 (select .cse126 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse128 (select (store (store .cse129 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse127 (select .cse128 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse125 .cse127) (< .cse127 .cse3) (< .cse127 (select .cse128 .cse6)))))) (< .cse125 .cse8)))))) (or (and (= c_~max1~0 c_~max3~0) (<= .cse12 c_~max3~0)) (and .cse61 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse132 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse131 (select (store (store .cse132 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse130 (select .cse132 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse130 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse131 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse131 .cse6)) (< c_~max1~0 (select .cse130 .cse6))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse137 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse133 (select .cse137 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse133 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse136 (select (store (store .cse137 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse134 (select .cse136 .cse6)) (.cse135 (select .cse136 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse134 .cse12) (= c_~max1~0 .cse134) (< .cse135 .cse3) (< .cse134 (+ .cse135 1)))))) (< c_~max1~0 (select .cse133 .cse6)))))) (or (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse141 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse140 (select .cse141 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse138 (select (store (store .cse141 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse139 (select .cse140 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse138 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse139 c_~max3~0) (< c_~max3~0 (select .cse138 .cse6)) (< .cse139 .cse8) (< .cse139 (select .cse140 .cse6))))))) .cse142) (or .cse142 (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse147 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse146 (select .cse147 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse143 (select (store (store .cse147 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse145 (select .cse146 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse144 (select .cse146 .cse6))) (or (< c_~max3~0 (select .cse143 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse143 .cse6)) (< .cse144 (+ .cse145 1)) (< .cse145 .cse8) (= .cse144 c_~max3~0))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse151 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse152 (select .cse151 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse150 (select .cse152 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse148 (select (store (store .cse151 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse149 (select .cse148 .cse6))) (or (< c_~max3~0 (select .cse148 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse149 .cse3) (= .cse149 .cse150))))) (< .cse150 .cse8) (= c_~max2~0 .cse150) (< .cse150 (select .cse152 .cse6))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse158 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse159 (select .cse158 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse153 (select .cse159 .cse6)) (.cse154 (select .cse159 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse153 c_~max2~0) (< .cse153 (+ .cse154 1)) (< .cse154 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse157 (select (store (store .cse158 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse155 (select .cse157 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse156 (select .cse157 .cse6))) (or (< .cse155 .cse3) (< .cse156 (+ .cse155 1)) (< c_~max2~0 .cse156)))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse164 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse161 (select .cse164 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse160 (select .cse161 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse160 .cse8) (= c_~max2~0 .cse160) (< .cse160 (select .cse161 .cse6)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse162 (select (store (store .cse164 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse163 (select .cse162 .cse6))) (or (< c_~max3~0 (select .cse162 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse163 .cse3) (< c_~max2~0 .cse163)))))))))) (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse169 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse168 (select .cse169 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse166 (select (store (store .cse169 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse167 (select .cse168 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse165 (select .cse168 .cse6))) (or (= .cse165 c_~max2~0) (< c_~max3~0 (select .cse166 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse166 .cse6)) (< .cse165 (+ .cse167 1)) (< .cse167 .cse8) (= .cse165 c_~max3~0)))))) (or (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse173 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse170 (select .cse173 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse171 (select (store (store .cse173 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse172 (select .cse170 .cse6))) (or (< c_~max1~0 (select .cse170 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse171 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse171 .cse6)) (= .cse172 c_~max3~0) (< .cse172 .cse8)))))) .cse142) (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse177 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse176 (select .cse177 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse174 (select (store (store .cse177 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse175 (select .cse176 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse174 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse175 c_~max3~0) (< c_~max3~0 (select .cse174 .cse6)) (< .cse175 .cse8) (= c_~max2~0 .cse175) (< .cse175 (select .cse176 .cse6))))))) (or .cse61 (and (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse181 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse178 (select .cse181 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse178 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max1~0 (select .cse178 .cse6)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse179 (select (store (store .cse181 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse180 (select .cse179 .cse6))) (or (< c_~max3~0 (select .cse179 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse180 .cse3) (< c_~max2~0 .cse180))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse185 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse182 (select .cse185 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse182 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse183 (select (store (store .cse185 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse184 (select .cse183 .cse6))) (or (< c_~max3~0 (select .cse183 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= c_~max1~0 .cse184) (< .cse184 .cse3))))) (< c_~max1~0 (select .cse182 .cse6)))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse189 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse191 (select .cse189 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse186 (select .cse191 .cse6)) (.cse190 (select .cse191 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse186 c_~max2~0) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse188 (select (store (store .cse189 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse187 (select .cse188 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse187 .cse3) (< c_~max2~0 .cse187) (< .cse187 (select .cse188 .cse6)))))) (< .cse186 (+ .cse190 1)) (< .cse190 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse195 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse192 (select .cse195 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse192 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse194 (select (store (store .cse195 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse193 (select .cse194 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse193 .cse3) (< .cse193 .cse12) (= c_~max1~0 .cse193) (< .cse193 (select .cse194 .cse6)))))) (< c_~max1~0 (select .cse192 .cse6)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse199 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse196 (select .cse199 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse196 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse197 (select (store (store .cse199 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse198 (select .cse197 .cse6))) (or (< c_~max3~0 (select .cse197 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse198 .cse12) (= c_~max1~0 .cse198) (< .cse198 .cse3))))) (< c_~max1~0 (select .cse196 .cse6)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse203 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse204 (select .cse203 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse201 (select .cse204 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse202 (select (store (store .cse203 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse200 (select .cse202 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse200 .cse3) (< .cse200 .cse12) (= .cse200 .cse201) (< .cse200 (select .cse202 .cse6)))))) (< .cse201 .cse8) (< .cse201 (select .cse204 .cse6))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse207 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse209 (select .cse207 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse208 (select .cse209 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse206 (select (store (store .cse207 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse205 (select .cse206 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse205 .cse3) (< c_~max2~0 .cse205) (< .cse205 (select .cse206 .cse6)))))) (< .cse208 .cse8) (= c_~max2~0 .cse208) (< .cse208 (select .cse209 .cse6))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse215 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse210 (select .cse215 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse213 (select .cse210 .cse6))) (or (< c_~max1~0 (select .cse210 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse214 (select (store (store .cse215 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse212 (select .cse214 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse211 (select .cse214 .cse6))) (or (< .cse211 .cse12) (< .cse212 .cse3) (< .cse211 (+ .cse212 1)) (= .cse213 .cse211))))) (< .cse213 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse220 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse221 (select .cse220 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse216 (select .cse221 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse216 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse219 (select (store (store .cse220 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse217 (select .cse219 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse218 (select .cse219 .cse6))) (or (< .cse217 .cse3) (< .cse218 (+ .cse217 1)) (< c_~max2~0 .cse218))))) (= c_~max2~0 .cse216) (< .cse216 (select .cse221 .cse6))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse226 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse223 (select .cse226 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse222 (select .cse223 .cse6))) (or (= .cse222 c_~max2~0) (< c_~max1~0 (select .cse223 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse224 (select (store (store .cse226 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse225 (select .cse224 .cse6))) (or (< c_~max3~0 (select .cse224 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< .cse225 .cse3) (< c_~max2~0 .cse225))))) (< .cse222 .cse8)))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse232 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse233 (select .cse232 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse228 (select .cse233 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse227 (select .cse233 .cse6))) (or (= .cse227 c_~max2~0) (< .cse227 (+ .cse228 1)) (< .cse228 .cse8) (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse231 (select (store (store .cse232 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse229 (select .cse231 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse230 (select .cse231 .cse6))) (or (< .cse229 .cse3) (< .cse230 (+ .cse229 1)) (= .cse227 .cse230)))))))))) (forall ((v_ArrVal_949 (Array Int Int))) (let ((.cse238 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_949))) (let ((.cse240 (select .cse238 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse236 (select .cse240 .cse6)) (.cse239 (select .cse240 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse237 (select (store (store .cse238 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse235 (select .cse237 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse234 (select .cse237 .cse6))) (or (< .cse234 .cse12) (< .cse235 .cse3) (< .cse234 (+ .cse235 1)) (= .cse236 .cse234))))) (< .cse236 (+ .cse239 1)) (< .cse239 .cse8))))))))) is different from false [2023-12-02 17:30:55,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,020 INFO L378 Elim1Store]: Elim1 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 226 treesize of output 130 [2023-12-02 17:30:55,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,038 INFO L378 Elim1Store]: Elim1 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 2581 treesize of output 2331 [2023-12-02 17:30:55,074 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 248 treesize of output 224 [2023-12-02 17:30:55,088 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 202 treesize of output 172 [2023-12-02 17:30:55,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,107 INFO L378 Elim1Store]: Elim1 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 234 treesize of output 186 [2023-12-02 17:30:55,424 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,424 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 1 [2023-12-02 17:30:55,430 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,431 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 17:30:55,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,438 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 98 [2023-12-02 17:30:55,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 145 treesize of output 113 [2023-12-02 17:30:55,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,473 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 49 [2023-12-02 17:30:55,499 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,499 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 1 [2023-12-02 17:30:55,508 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,508 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2023-12-02 17:30:55,517 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,517 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2023-12-02 17:30:55,525 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,525 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2023-12-02 17:30:55,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,534 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 127 [2023-12-02 17:30:55,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 136 treesize of output 106 [2023-12-02 17:30:55,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,576 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 38 [2023-12-02 17:30:55,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,610 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 124 [2023-12-02 17:30:55,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 161 treesize of output 125 [2023-12-02 17:30:55,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,669 INFO L378 Elim1Store]: Elim1 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 69 treesize of output 47 [2023-12-02 17:30:55,706 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,706 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 1 [2023-12-02 17:30:55,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,719 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 88 [2023-12-02 17:30:55,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 96 [2023-12-02 17:30:55,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,740 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 42 [2023-12-02 17:30:55,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,772 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 100 [2023-12-02 17:30:55,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 96 [2023-12-02 17:30:55,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,805 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 42 [2023-12-02 17:30:55,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,828 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 100 [2023-12-02 17:30:55,832 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 96 [2023-12-02 17:30:55,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,851 INFO L378 Elim1Store]: Elim1 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 60 treesize of output 44 [2023-12-02 17:30:55,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,903 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 119 [2023-12-02 17:30:55,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:55,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 98 [2023-12-02 17:30:55,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,931 INFO L378 Elim1Store]: Elim1 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 54 treesize of output 40 [2023-12-02 17:30:55,970 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,970 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 1 [2023-12-02 17:30:55,982 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:55,982 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 1 [2023-12-02 17:30:55,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:55,995 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 88 [2023-12-02 17:30:56,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:56,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:56,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:56,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 124 treesize of output 96 [2023-12-02 17:30:56,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:56,039 INFO L378 Elim1Store]: Elim1 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 58 treesize of output 42 [2023-12-02 17:30:56,076 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,076 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 1 [2023-12-02 17:30:56,088 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,088 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 1 [2023-12-02 17:30:56,099 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,099 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 1 [2023-12-02 17:30:56,109 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,109 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2023-12-02 17:30:56,120 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,120 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-12-02 17:30:56,130 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,131 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2023-12-02 17:30:56,142 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,143 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 1 [2023-12-02 17:30:56,156 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,156 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2023-12-02 17:30:56,170 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,170 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 1 [2023-12-02 17:30:56,181 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,181 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2023-12-02 17:30:56,195 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,195 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 1 [2023-12-02 17:30:56,207 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,207 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 1 [2023-12-02 17:30:56,220 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,220 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 1 [2023-12-02 17:30:56,232 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,232 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 1 [2023-12-02 17:30:56,243 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,244 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 1 [2023-12-02 17:30:56,256 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,256 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 1 [2023-12-02 17:30:56,273 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,273 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 1 [2023-12-02 17:30:56,284 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,285 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2023-12-02 17:30:56,297 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,298 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 1 [2023-12-02 17:30:56,311 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,311 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 1 [2023-12-02 17:30:56,323 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,323 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 1 [2023-12-02 17:30:56,335 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,335 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 1 [2023-12-02 17:30:56,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:56,355 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 69 [2023-12-02 17:30:56,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:56,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:30:56,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:56,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 93 treesize of output 73 [2023-12-02 17:30:56,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:56,386 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 37 [2023-12-02 17:30:56,418 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,418 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 1 [2023-12-02 17:30:56,431 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,431 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-12-02 17:30:56,442 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,443 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-12-02 17:30:56,454 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,455 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 1 [2023-12-02 17:30:56,468 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 17:30:56,468 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 1 [2023-12-02 17:30:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 17:30:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358076849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1643881452] [2023-12-02 17:30:56,678 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 17:30:56,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 51 [2023-12-02 17:30:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740819180] [2023-12-02 17:30:56,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:56,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 17:30:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 17:30:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2339, Unknown=23, NotChecked=98, Total=2652 [2023-12-02 17:30:56,680 INFO L87 Difference]: Start difference. First operand 1507 states and 5106 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 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) [2023-12-02 17:31:26,149 WARN L293 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 306 DAG size of output: 262 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:31:52,464 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 303 DAG size of output: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:32:43,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 17:32:43,628 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 17:32:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-02 17:32:43,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4909 ImplicationChecksByTransitivity, 97.1s TimeCoverageRelationStatistics Valid=1921, Invalid=14731, Unknown=122, NotChecked=256, Total=17030 [2023-12-02 17:32:43,631 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 738 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4722 mSolverCounterSat, 212 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 4722 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:43,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 8 Invalid, 5534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 4722 Invalid, 61 Unknown, 539 Unchecked, 19.6s Time] [2023-12-02 17:32:43,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-02 17:32:43,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 17:32:43,832 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2023-12-02 17:32:43,833 INFO L158 Benchmark]: Toolchain (without parser) took 817012.65ms. Allocated memory was 153.1MB in the beginning and 648.0MB in the end (delta: 494.9MB). Free memory was 113.2MB in the beginning and 387.9MB in the end (delta: -274.7MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,833 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:32:43,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 101.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.27ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,834 INFO L158 Benchmark]: Boogie Preprocessor took 27.13ms. Allocated memory is still 153.1MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,834 INFO L158 Benchmark]: RCFGBuilder took 625.58ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 55.1MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,834 INFO L158 Benchmark]: TraceAbstraction took 816059.39ms. Allocated memory was 153.1MB in the beginning and 648.0MB in the end (delta: 494.9MB). Free memory was 54.5MB in the beginning and 387.9MB in the end (delta: -333.4MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. [2023-12-02 17:32:43,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 101.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.27ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.13ms. Allocated memory is still 153.1MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.58ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 55.1MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 816059.39ms. Allocated memory was 153.1MB in the beginning and 648.0MB in the end (delta: 494.9MB). Free memory was 54.5MB in the beginning and 387.9MB in the end (delta: -333.4MB). Peak memory consumption was 163.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:32:45,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:32:45,596 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:32:45,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:32:45,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:32:45,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:32:45,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:32:45,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:32:45,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:32:45,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:32:45,633 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:32:45,633 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:32:45,634 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:32:45,634 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:32:45,635 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:32:45,636 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:32:45,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:32:45,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:32:45,637 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:32:45,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:32:45,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:32:45,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:32:45,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:32:45,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:32:45,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:32:45,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:32:45,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:32:45,642 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:32:45,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:32:45,642 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:32:45,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:32:45,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:32:45,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:32:45,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:32:45,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:32:45,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:32:45,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:32:45,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:32:45,645 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:32:45,645 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:32:45,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:32:45,646 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:32:45,646 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:32:45,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:32:45,647 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/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_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2023-12-02 17:32:45,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:32:45,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:32:45,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:32:45,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:32:45,959 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:32:45,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 17:32:48,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:32:49,019 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:32:49,019 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-12-02 17:32:49,027 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/59d84aea4/9deb31e7b5404b028de0165295399d70/FLAG74765e4c1 [2023-12-02 17:32:49,042 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/data/59d84aea4/9deb31e7b5404b028de0165295399d70 [2023-12-02 17:32:49,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:32:49,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:32:49,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:32:49,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:32:49,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:32:49,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69700583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49, skipping insertion in model container [2023-12-02 17:32:49,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:32:49,265 WARN L240 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 17:32:49,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:32:49,291 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 17:32:49,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:32:49,309 WARN L240 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 17:32:49,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:32:49,318 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:32:49,343 WARN L240 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_96e68feb-0591-4fc6-9a4a-470a2eba08be/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-02 17:32:49,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:32:49,357 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:32:49,357 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:32:49,365 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:32:49,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49 WrapperNode [2023-12-02 17:32:49,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:32:49,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:32:49,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:32:49,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:32:49,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,409 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-12-02 17:32:49,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:32:49,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:32:49,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:32:49,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:32:49,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:32:49,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:32:49,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:32:49,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:32:49,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (1/1) ... [2023-12-02 17:32:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:32:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:49,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:32:49,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:32:49,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:32:49,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:32:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:32:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 17:32:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:32:49,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:32:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:32:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:32:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 17:32:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 17:32:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 17:32:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 17:32:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:32:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:32:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:32:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:32:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 17:32:49,530 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:32:49,648 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:32:49,651 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:32:50,011 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:32:50,265 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:32:50,265 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 17:32:50,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:32:50 BoogieIcfgContainer [2023-12-02 17:32:50,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:32:50,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:32:50,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:32:50,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:32:50,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:32:49" (1/3) ... [2023-12-02 17:32:50,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352c727e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:32:50, skipping insertion in model container [2023-12-02 17:32:50,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:49" (2/3) ... [2023-12-02 17:32:50,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352c727e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:32:50, skipping insertion in model container [2023-12-02 17:32:50,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:32:50" (3/3) ... [2023-12-02 17:32:50,275 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-12-02 17:32:50,284 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:32:50,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:32:50,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:32:50,294 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:32:50,350 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 17:32:50,379 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2023-12-02 17:32:50,431 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 17:32:50,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:32:50,456 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62554b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:32:50,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 17:32:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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) [2023-12-02 17:32:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:32:50,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:50,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:50,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:50,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1040849167, now seen corresponding path program 1 times [2023-12-02 17:32:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985474179] [2023-12-02 17:32:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:50,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:50,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:50,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:50,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 17:32:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:50,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 17:32:50,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:32:50,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:32:50,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:32:50,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985474179] [2023-12-02 17:32:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985474179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:32:50,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:32:50,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:32:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957549598] [2023-12-02 17:32:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:32:50,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:32:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:32:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:32:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:32:50,939 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 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, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2023-12-02 17:32:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:51,130 INFO L93 Difference]: Finished difference Result 579 states and 1878 transitions. [2023-12-02 17:32:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:32:51,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2023-12-02 17:32:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:51,153 INFO L225 Difference]: With dead ends: 579 [2023-12-02 17:32:51,153 INFO L226 Difference]: Without dead ends: 572 [2023-12-02 17:32:51,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:32:51,159 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 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 [2023-12-02 17:32:51,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:32:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2023-12-02 17:32:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 466. [2023-12-02 17:32:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.2451612903225806) internal successors, (1509), 465 states have internal predecessors, (1509), 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) [2023-12-02 17:32:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1509 transitions. [2023-12-02 17:32:51,248 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1509 transitions. Word has length 21 [2023-12-02 17:32:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:51,249 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1509 transitions. [2023-12-02 17:32:51,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2023-12-02 17:32:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1509 transitions. [2023-12-02 17:32:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 17:32:51,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:51,254 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:32:51,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:32:51,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:51,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:51,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash -956802313, now seen corresponding path program 1 times [2023-12-02 17:32:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740390750] [2023-12-02 17:32:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:51,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:51,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 17:32:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:51,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:32:51,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:32:51,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:32:51,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:32:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740390750] [2023-12-02 17:32:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740390750] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:32:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:32:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:32:51,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087632277] [2023-12-02 17:32:51,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:32:51,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:32:51,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:32:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:32:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:32:51,701 INFO L87 Difference]: Start difference. First operand 466 states and 1509 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 17:32:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:51,880 INFO L93 Difference]: Finished difference Result 602 states and 1985 transitions. [2023-12-02 17:32:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:32:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-12-02 17:32:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:51,886 INFO L225 Difference]: With dead ends: 602 [2023-12-02 17:32:51,887 INFO L226 Difference]: Without dead ends: 602 [2023-12-02 17:32:51,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:32:51,888 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:51,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:32:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-12-02 17:32:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 438. [2023-12-02 17:32:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.274599542334096) internal successors, (1431), 437 states have internal predecessors, (1431), 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) [2023-12-02 17:32:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1431 transitions. [2023-12-02 17:32:51,915 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1431 transitions. Word has length 24 [2023-12-02 17:32:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:51,915 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1431 transitions. [2023-12-02 17:32:51,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 17:32:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1431 transitions. [2023-12-02 17:32:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 17:32:51,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:51,918 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:32:51,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 17:32:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:52,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:52,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash -528168276, now seen corresponding path program 1 times [2023-12-02 17:32:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:52,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600191690] [2023-12-02 17:32:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:52,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:52,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 17:32:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:52,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:52,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:32:52,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:32:52,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:32:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600191690] [2023-12-02 17:32:52,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600191690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:32:52,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:32:52,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:32:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324313394] [2023-12-02 17:32:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:32:52,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:32:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:32:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:32:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:32:52,415 INFO L87 Difference]: Start difference. First operand 438 states and 1431 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-12-02 17:32:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:52,768 INFO L93 Difference]: Finished difference Result 652 states and 2164 transitions. [2023-12-02 17:32:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:32:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2023-12-02 17:32:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:52,775 INFO L225 Difference]: With dead ends: 652 [2023-12-02 17:32:52,775 INFO L226 Difference]: Without dead ends: 652 [2023-12-02 17:32:52,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:32:52,777 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:52,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:32:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-12-02 17:32:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 512. [2023-12-02 17:32:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.275929549902153) internal successors, (1674), 511 states have internal predecessors, (1674), 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) [2023-12-02 17:32:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1674 transitions. [2023-12-02 17:32:52,797 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1674 transitions. Word has length 24 [2023-12-02 17:32:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:52,798 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1674 transitions. [2023-12-02 17:32:52,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-12-02 17:32:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1674 transitions. [2023-12-02 17:32:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 17:32:52,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:52,800 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:32:52,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 17:32:53,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:53,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:53,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:53,001 INFO L85 PathProgramCache]: Analyzing trace with hash -411629160, now seen corresponding path program 2 times [2023-12-02 17:32:53,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773051710] [2023-12-02 17:32:53,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:32:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:53,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:53,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 17:32:53,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 17:32:53,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:32:53,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:32:53,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:32:53,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:32:53,148 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:32:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773051710] [2023-12-02 17:32:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773051710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:32:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:32:53,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:32:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822203563] [2023-12-02 17:32:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:32:53,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:32:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:32:53,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:32:53,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:32:53,151 INFO L87 Difference]: Start difference. First operand 512 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2023-12-02 17:32:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:53,273 INFO L93 Difference]: Finished difference Result 513 states and 1675 transitions. [2023-12-02 17:32:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:32:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2023-12-02 17:32:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:53,279 INFO L225 Difference]: With dead ends: 513 [2023-12-02 17:32:53,279 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 17:32:53,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:32:53,281 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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 [2023-12-02 17:32:53,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:32:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 17:32:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-12-02 17:32:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.271484375) internal successors, (1675), 512 states have internal predecessors, (1675), 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) [2023-12-02 17:32:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1675 transitions. [2023-12-02 17:32:53,314 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1675 transitions. Word has length 24 [2023-12-02 17:32:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:53,314 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1675 transitions. [2023-12-02 17:32:53,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2023-12-02 17:32:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1675 transitions. [2023-12-02 17:32:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:32:53,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:53,317 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:32:53,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-02 17:32:53,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:53,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:53,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 155005931, now seen corresponding path program 1 times [2023-12-02 17:32:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900266088] [2023-12-02 17:32:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:53,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:53,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:53,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:53,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 17:32:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:53,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:53,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:32:53,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:32:53,854 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:32:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900266088] [2023-12-02 17:32:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900266088] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:32:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 17:32:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868865752] [2023-12-02 17:32:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:32:53,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:32:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:32:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:32:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:32:53,856 INFO L87 Difference]: Start difference. First operand 513 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 17:32:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:54,070 INFO L93 Difference]: Finished difference Result 585 states and 1919 transitions. [2023-12-02 17:32:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:32:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-12-02 17:32:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:54,075 INFO L225 Difference]: With dead ends: 585 [2023-12-02 17:32:54,075 INFO L226 Difference]: Without dead ends: 585 [2023-12-02 17:32:54,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:32:54,076 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:54,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:32:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-02 17:32:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 511. [2023-12-02 17:32:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2862745098039214) internal successors, (1676), 510 states have internal predecessors, (1676), 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) [2023-12-02 17:32:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1676 transitions. [2023-12-02 17:32:54,092 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1676 transitions. Word has length 25 [2023-12-02 17:32:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:54,093 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1676 transitions. [2023-12-02 17:32:54,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 17:32:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1676 transitions. [2023-12-02 17:32:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 17:32:54,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:54,095 INFO L195 NwaCegarLoop]: 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] [2023-12-02 17:32:54,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 17:32:54,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:54,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:32:54,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1785322554, now seen corresponding path program 1 times [2023-12-02 17:32:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:32:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132677881] [2023-12-02 17:32:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:32:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:32:54,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:32:54,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_96e68feb-0591-4fc6-9a4a-470a2eba08be/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 17:32:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:54,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 17:32:54,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:55,819 INFO L349 Elim1Store]: treesize reduction 480, result has 14.4 percent of original size [2023-12-02 17:32:55,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 219 treesize of output 161 [2023-12-02 17:32:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:32:56,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:57,458 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-12-02 17:32:57,458 INFO L378 Elim1Store]: Elim1 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 350 treesize of output 153