./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/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_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:52:59,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:52:59,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 16:52:59,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:52:59,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:52:59,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:52:59,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:52:59,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:52:59,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:52:59,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:52:59,097 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:52:59,098 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:52:59,098 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:52:59,099 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:52:59,099 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:52:59,100 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:52:59,100 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:52:59,101 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:52:59,101 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:52:59,102 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:52:59,102 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:52:59,104 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:52:59,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:52:59,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:52:59,106 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:52:59,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:52:59,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:52:59,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:52:59,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:52:59,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:52:59,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:52:59,108 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 16:52:59,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:52:59,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:52:59,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:52:59,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:52:59,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:52:59,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:52:59,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:52:59,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:52:59,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:52:59,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:52:59,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:52:59,110 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:52:59,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:52:59,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:52:59,111 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:52:59,111 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:52:59,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:52:59,111 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_d06d2829-7021-40ed-92e4-142a1ecbca6c/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_d06d2829-7021-40ed-92e4-142a1ecbca6c/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 ! overflow) ) 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2023-12-02 16:52:59,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:52:59,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:52:59,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:52:59,341 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:52:59,342 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:52:59,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2023-12-02 16:53:02,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:53:02,266 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:53:02,267 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2023-12-02 16:53:02,276 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/data/226f3897b/80ab3c4735cc430898aeb95be385ded3/FLAGaa7eae5ab [2023-12-02 16:53:02,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/data/226f3897b/80ab3c4735cc430898aeb95be385ded3 [2023-12-02 16:53:02,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:53:02,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:53:02,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:53:02,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:53:02,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:53:02,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1536141b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02, skipping insertion in model container [2023-12-02 16:53:02,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:53:02,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:53:02,532 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:53:02,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:53:02,575 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 16:53:02,575 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 16:53:02,583 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:53:02,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02 WrapperNode [2023-12-02 16:53:02,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:53:02,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:53:02,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:53:02,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:53:02,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,638 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 294 [2023-12-02 16:53:02,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:53:02,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:53:02,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:53:02,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:53:02,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:53:02,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:53:02,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:53:02,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:53:02,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (1/1) ... [2023-12-02 16:53:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:53:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:02,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:53:02,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:53:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:53:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:53:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 16:53:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 16:53:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 16:53:02,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 16:53:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 16:53:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 16:53:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 16:53:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 16:53:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:53:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 16:53:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 16:53:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 16:53:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:53:02,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:53:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:53:02,758 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 16:53:02,864 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:53:02,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:53:03,363 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:53:03,738 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:53:03,738 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 16:53:03,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:53:03 BoogieIcfgContainer [2023-12-02 16:53:03,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:53:03,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:53:03,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:53:03,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:53:03,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:53:02" (1/3) ... [2023-12-02 16:53:03,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388ceeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:53:03, skipping insertion in model container [2023-12-02 16:53:03,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:53:02" (2/3) ... [2023-12-02 16:53:03,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388ceeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:53:03, skipping insertion in model container [2023-12-02 16:53:03,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:53:03" (3/3) ... [2023-12-02 16:53:03,748 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2023-12-02 16:53:03,757 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 16:53:03,767 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:53:03,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-12-02 16:53:03,768 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 16:53:03,865 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 16:53:03,895 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 107 transitions, 235 flow [2023-12-02 16:53:04,082 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3590 states, 3474 states have (on average 3.5523891767415083) internal successors, (12341), 3589 states have internal predecessors, (12341), 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 16:53:04,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:53:04,106 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;@70f768b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:53:04,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-12-02 16:53:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 3590 states, 3474 states have (on average 3.5523891767415083) internal successors, (12341), 3589 states have internal predecessors, (12341), 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 16:53:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 16:53:04,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:04,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 16:53:04,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:04,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1038702, now seen corresponding path program 1 times [2023-12-02 16:53:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:04,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737260787] [2023-12-02 16:53:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:04,417 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 16:53:04,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737260787] [2023-12-02 16:53:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737260787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:53:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65162980] [2023-12-02 16:53:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:04,493 INFO L87 Difference]: Start difference. First operand has 3590 states, 3474 states have (on average 3.5523891767415083) internal successors, (12341), 3589 states have internal predecessors, (12341), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 16:53:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:04,798 INFO L93 Difference]: Finished difference Result 3187 states and 10917 transitions. [2023-12-02 16:53:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-12-02 16:53:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:04,856 INFO L225 Difference]: With dead ends: 3187 [2023-12-02 16:53:04,856 INFO L226 Difference]: Without dead ends: 3187 [2023-12-02 16:53:04,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 16:53:04,862 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:04,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 144 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2023-12-02 16:53:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2023-12-02 16:53:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 3089 states have (on average 3.534153447717708) internal successors, (10917), 3186 states have internal predecessors, (10917), 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 16:53:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 10917 transitions. [2023-12-02 16:53:05,083 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 10917 transitions. Word has length 3 [2023-12-02 16:53:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:05,083 INFO L495 AbstractCegarLoop]: Abstraction has 3187 states and 10917 transitions. [2023-12-02 16:53:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 16:53:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 10917 transitions. [2023-12-02 16:53:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 16:53:05,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:05,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-12-02 16:53:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:53:05,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:05,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 880253327, now seen corresponding path program 1 times [2023-12-02 16:53:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714749385] [2023-12-02 16:53:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:53:05,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714749385] [2023-12-02 16:53:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714749385] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259086895] [2023-12-02 16:53:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:05,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:05,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:53:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:05,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:53:05,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:53:05,424 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:53:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259086895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:05,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:53:05,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 16:53:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921336746] [2023-12-02 16:53:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:05,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:53:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:53:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:53:05,428 INFO L87 Difference]: Start difference. First operand 3187 states and 10917 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 16:53:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:05,713 INFO L93 Difference]: Finished difference Result 3184 states and 10914 transitions. [2023-12-02 16:53:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:53:05,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-12-02 16:53:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:05,750 INFO L225 Difference]: With dead ends: 3184 [2023-12-02 16:53:05,750 INFO L226 Difference]: Without dead ends: 3184 [2023-12-02 16:53:05,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:53:05,752 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:05,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 215 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2023-12-02 16:53:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3184. [2023-12-02 16:53:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3089 states have (on average 3.5331822596309483) internal successors, (10914), 3183 states have internal predecessors, (10914), 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 16:53:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 10914 transitions. [2023-12-02 16:53:05,889 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 10914 transitions. Word has length 6 [2023-12-02 16:53:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:05,890 INFO L495 AbstractCegarLoop]: Abstraction has 3184 states and 10914 transitions. [2023-12-02 16:53:05,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 16:53:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 10914 transitions. [2023-12-02 16:53:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 16:53:05,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:05,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 16:53:05,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:53:06,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:06,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:06,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 881187563, now seen corresponding path program 1 times [2023-12-02 16:53:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:06,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138709119] [2023-12-02 16:53:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:06,197 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 16:53:06,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138709119] [2023-12-02 16:53:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138709119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:53:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963371610] [2023-12-02 16:53:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:06,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:06,200 INFO L87 Difference]: Start difference. First operand 3184 states and 10914 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 16:53:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:06,435 INFO L93 Difference]: Finished difference Result 3200 states and 10931 transitions. [2023-12-02 16:53:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:06,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-12-02 16:53:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:06,462 INFO L225 Difference]: With dead ends: 3200 [2023-12-02 16:53:06,462 INFO L226 Difference]: Without dead ends: 3200 [2023-12-02 16:53:06,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:06,464 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:06,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 97 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2023-12-02 16:53:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 3190. [2023-12-02 16:53:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 3097 states have (on average 3.5266386825960607) internal successors, (10922), 3189 states have internal predecessors, (10922), 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 16:53:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 10922 transitions. [2023-12-02 16:53:06,567 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 10922 transitions. Word has length 6 [2023-12-02 16:53:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:06,567 INFO L495 AbstractCegarLoop]: Abstraction has 3190 states and 10922 transitions. [2023-12-02 16:53:06,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 16:53:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 10922 transitions. [2023-12-02 16:53:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:53:06,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:06,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2023-12-02 16:53:06,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 16:53:06,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:06,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1518050420, now seen corresponding path program 1 times [2023-12-02 16:53:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:06,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796023191] [2023-12-02 16:53:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:06,657 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 16:53:06,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796023191] [2023-12-02 16:53:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796023191] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370331516] [2023-12-02 16:53:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:06,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:06,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:06,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:53:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:06,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:53:06,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:06,779 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 16:53:06,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:06,822 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 16:53:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370331516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845509475] [2023-12-02 16:53:06,830 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:06,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-12-02 16:53:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159831694] [2023-12-02 16:53:06,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 16:53:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 16:53:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:53:06,835 INFO L87 Difference]: Start difference. First operand 3190 states and 10922 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 16:53:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:07,163 INFO L93 Difference]: Finished difference Result 3217 states and 10958 transitions. [2023-12-02 16:53:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:53:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 7 [2023-12-02 16:53:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:07,198 INFO L225 Difference]: With dead ends: 3217 [2023-12-02 16:53:07,198 INFO L226 Difference]: Without dead ends: 3217 [2023-12-02 16:53:07,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-12-02 16:53:07,200 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:07,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 217 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2023-12-02 16:53:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2023-12-02 16:53:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3124 states have (on average 3.5076824583866837) internal successors, (10958), 3216 states have internal predecessors, (10958), 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 16:53:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 10958 transitions. [2023-12-02 16:53:07,368 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 10958 transitions. Word has length 7 [2023-12-02 16:53:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:07,369 INFO L495 AbstractCegarLoop]: Abstraction has 3217 states and 10958 transitions. [2023-12-02 16:53:07,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 16:53:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 10958 transitions. [2023-12-02 16:53:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 16:53:07,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:07,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:07,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:53:07,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:07,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:07,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1547011762, now seen corresponding path program 1 times [2023-12-02 16:53:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177143409] [2023-12-02 16:53:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:07,657 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 16:53:07,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177143409] [2023-12-02 16:53:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177143409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:07,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:07,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:53:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398448233] [2023-12-02 16:53:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:07,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:53:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:53:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:53:07,660 INFO L87 Difference]: Start difference. First operand 3217 states and 10958 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 16:53:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:07,780 INFO L93 Difference]: Finished difference Result 3217 states and 10957 transitions. [2023-12-02 16:53:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:53:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-12-02 16:53:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:07,807 INFO L225 Difference]: With dead ends: 3217 [2023-12-02 16:53:07,814 INFO L226 Difference]: Without dead ends: 3217 [2023-12-02 16:53:07,815 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 16:53:07,816 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:53:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2023-12-02 16:53:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2023-12-02 16:53:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3124 states have (on average 3.507362355953905) internal successors, (10957), 3216 states have internal predecessors, (10957), 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 16:53:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 10957 transitions. [2023-12-02 16:53:07,901 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 10957 transitions. Word has length 7 [2023-12-02 16:53:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:07,902 INFO L495 AbstractCegarLoop]: Abstraction has 3217 states and 10957 transitions. [2023-12-02 16:53:07,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 16:53:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 10957 transitions. [2023-12-02 16:53:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:53:07,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:07,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:07,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:53:07,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:07,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:07,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1735504301, now seen corresponding path program 1 times [2023-12-02 16:53:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:07,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277638143] [2023-12-02 16:53:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:08,003 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 16:53:08,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:08,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277638143] [2023-12-02 16:53:08,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277638143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:08,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:53:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159699700] [2023-12-02 16:53:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:08,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:08,006 INFO L87 Difference]: Start difference. First operand 3217 states and 10957 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 16:53:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:08,131 INFO L93 Difference]: Finished difference Result 3217 states and 10955 transitions. [2023-12-02 16:53:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:08,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-12-02 16:53:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:08,151 INFO L225 Difference]: With dead ends: 3217 [2023-12-02 16:53:08,151 INFO L226 Difference]: Without dead ends: 3217 [2023-12-02 16:53:08,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:53:08,152 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:08,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:53:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2023-12-02 16:53:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2023-12-02 16:53:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3124 states have (on average 3.5067221510883484) internal successors, (10955), 3216 states have internal predecessors, (10955), 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 16:53:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 10955 transitions. [2023-12-02 16:53:08,263 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 10955 transitions. Word has length 10 [2023-12-02 16:53:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:08,263 INFO L495 AbstractCegarLoop]: Abstraction has 3217 states and 10955 transitions. [2023-12-02 16:53:08,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 16:53:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 10955 transitions. [2023-12-02 16:53:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 16:53:08,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:08,265 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2023-12-02 16:53:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 16:53:08,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 225327029, now seen corresponding path program 2 times [2023-12-02 16:53:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989836742] [2023-12-02 16:53:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:53:08,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989836742] [2023-12-02 16:53:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989836742] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444189400] [2023-12-02 16:53:08,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:53:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:08,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:08,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:53:08,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 16:53:08,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:53:08,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:53:08,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 16:53:08,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 16:53:08,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444189400] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470118446] [2023-12-02 16:53:08,651 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:08,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 2, 2] total 12 [2023-12-02 16:53:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698439056] [2023-12-02 16:53:08,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:08,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 16:53:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:08,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 16:53:08,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 16:53:08,653 INFO L87 Difference]: Start difference. First operand 3217 states and 10955 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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 16:53:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:09,131 INFO L93 Difference]: Finished difference Result 3225 states and 10966 transitions. [2023-12-02 16:53:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 16:53:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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 16 [2023-12-02 16:53:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:09,149 INFO L225 Difference]: With dead ends: 3225 [2023-12-02 16:53:09,149 INFO L226 Difference]: Without dead ends: 3225 [2023-12-02 16:53:09,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2023-12-02 16:53:09,150 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:09,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 338 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:53:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2023-12-02 16:53:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3211. [2023-12-02 16:53:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 3119 states have (on average 3.5100993908303946) internal successors, (10948), 3210 states have internal predecessors, (10948), 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 16:53:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 10948 transitions. [2023-12-02 16:53:09,257 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 10948 transitions. Word has length 16 [2023-12-02 16:53:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:09,257 INFO L495 AbstractCegarLoop]: Abstraction has 3211 states and 10948 transitions. [2023-12-02 16:53:09,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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 16:53:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 10948 transitions. [2023-12-02 16:53:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 16:53:09,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:09,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:09,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:53:09,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:09,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:09,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1684921452, now seen corresponding path program 1 times [2023-12-02 16:53:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324513910] [2023-12-02 16:53:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:09,826 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 16:53:09,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324513910] [2023-12-02 16:53:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324513910] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:09,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665796418] [2023-12-02 16:53:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:09,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:09,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:09,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:09,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:53:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:09,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 16:53:09,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:10,010 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 15 treesize of output 1 [2023-12-02 16:53:10,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:10,071 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 11 treesize of output 11 [2023-12-02 16:53:10,101 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 18 treesize of output 13 [2023-12-02 16:53:10,131 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 17 treesize of output 9 [2023-12-02 16:53:10,137 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 16:53:10,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:10,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:10,279 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 24 treesize of output 25 [2023-12-02 16:53:10,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:10,290 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 39 treesize of output 35 [2023-12-02 16:53:10,297 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 11 treesize of output 9 [2023-12-02 16:53:10,347 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 16:53:10,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665796418] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353588704] [2023-12-02 16:53:10,349 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:10,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 16:53:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666830805] [2023-12-02 16:53:10,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:53:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:53:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=164, Unknown=3, NotChecked=0, Total=210 [2023-12-02 16:53:10,351 INFO L87 Difference]: Start difference. First operand 3211 states and 10948 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 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 16:53:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:10,907 INFO L93 Difference]: Finished difference Result 3223 states and 10957 transitions. [2023-12-02 16:53:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:53:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 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 16 [2023-12-02 16:53:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:10,927 INFO L225 Difference]: With dead ends: 3223 [2023-12-02 16:53:10,928 INFO L226 Difference]: Without dead ends: 3223 [2023-12-02 16:53:10,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=283, Unknown=3, NotChecked=0, Total=380 [2023-12-02 16:53:10,929 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 113 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:10,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 328 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:53:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2023-12-02 16:53:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3210. [2023-12-02 16:53:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3119 states have (on average 3.5097787752484773) internal successors, (10947), 3209 states have internal predecessors, (10947), 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 16:53:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 10947 transitions. [2023-12-02 16:53:11,044 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 10947 transitions. Word has length 16 [2023-12-02 16:53:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:11,044 INFO L495 AbstractCegarLoop]: Abstraction has 3210 states and 10947 transitions. [2023-12-02 16:53:11,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 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 16:53:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 10947 transitions. [2023-12-02 16:53:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 16:53:11,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:11,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:11,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 16:53:11,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:11,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:11,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 692893235, now seen corresponding path program 1 times [2023-12-02 16:53:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:11,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131429850] [2023-12-02 16:53:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:11,515 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 16:53:11,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131429850] [2023-12-02 16:53:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131429850] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678497880] [2023-12-02 16:53:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:11,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:11,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:11,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 16:53:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:11,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 16:53:11,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:11,665 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 15 treesize of output 1 [2023-12-02 16:53:11,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:11,737 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 11 treesize of output 11 [2023-12-02 16:53:11,758 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 16 treesize of output 11 [2023-12-02 16:53:11,786 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 15 treesize of output 7 [2023-12-02 16:53:11,800 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 16:53:11,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:11,829 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_211) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2023-12-02 16:53:11,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:11,878 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 22 treesize of output 23 [2023-12-02 16:53:11,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:11,889 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 33 treesize of output 29 [2023-12-02 16:53:11,895 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 9 treesize of output 7 [2023-12-02 16:53:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 16:53:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678497880] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882786563] [2023-12-02 16:53:11,942 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:11,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 16:53:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69266504] [2023-12-02 16:53:11,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:11,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:53:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:53:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2023-12-02 16:53:11,945 INFO L87 Difference]: Start difference. First operand 3210 states and 10947 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 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 16:53:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:12,308 INFO L93 Difference]: Finished difference Result 3216 states and 10952 transitions. [2023-12-02 16:53:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:53:12,309 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 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 17 [2023-12-02 16:53:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:12,325 INFO L225 Difference]: With dead ends: 3216 [2023-12-02 16:53:12,325 INFO L226 Difference]: Without dead ends: 3216 [2023-12-02 16:53:12,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=256, Unknown=1, NotChecked=34, Total=380 [2023-12-02 16:53:12,326 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:12,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 227 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 344 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2023-12-02 16:53:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-12-02 16:53:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3209. [2023-12-02 16:53:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3119 states have (on average 3.50945815966656) internal successors, (10946), 3208 states have internal predecessors, (10946), 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 16:53:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 10946 transitions. [2023-12-02 16:53:12,431 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 10946 transitions. Word has length 17 [2023-12-02 16:53:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:12,432 INFO L495 AbstractCegarLoop]: Abstraction has 3209 states and 10946 transitions. [2023-12-02 16:53:12,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 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 16:53:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 10946 transitions. [2023-12-02 16:53:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 16:53:12,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:12,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:12,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 16:53:12,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:12,634 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:12,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash 4854916, now seen corresponding path program 1 times [2023-12-02 16:53:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89753388] [2023-12-02 16:53:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:12,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89753388] [2023-12-02 16:53:12,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89753388] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:12,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:12,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:53:12,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570822753] [2023-12-02 16:53:12,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:12,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:12,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:12,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:12,702 INFO L87 Difference]: Start difference. First operand 3209 states and 10946 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 16:53:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:12,828 INFO L93 Difference]: Finished difference Result 3219 states and 10953 transitions. [2023-12-02 16:53:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:12,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2023-12-02 16:53:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:12,845 INFO L225 Difference]: With dead ends: 3219 [2023-12-02 16:53:12,845 INFO L226 Difference]: Without dead ends: 3219 [2023-12-02 16:53:12,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:12,846 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:12,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:53:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2023-12-02 16:53:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 3209. [2023-12-02 16:53:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3119 states have (on average 3.5088169285027253) internal successors, (10944), 3208 states have internal predecessors, (10944), 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 16:53:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 10944 transitions. [2023-12-02 16:53:12,948 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 10944 transitions. Word has length 18 [2023-12-02 16:53:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:12,948 INFO L495 AbstractCegarLoop]: Abstraction has 3209 states and 10944 transitions. [2023-12-02 16:53:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 16:53:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 10944 transitions. [2023-12-02 16:53:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 16:53:12,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:12,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:12,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 16:53:12,949 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:12,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 4853757, now seen corresponding path program 1 times [2023-12-02 16:53:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940279171] [2023-12-02 16:53:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:13,306 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 16:53:13,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940279171] [2023-12-02 16:53:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940279171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965246467] [2023-12-02 16:53:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:13,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:13,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 16:53:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:13,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 16:53:13,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:13,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:53:13,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:53:13,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:13,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:13,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:13,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:13,663 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 15 treesize of output 1 [2023-12-02 16:53:13,719 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 16:53:13,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 16:53:13,750 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 18 treesize of output 13 [2023-12-02 16:53:13,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:13,794 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 11 treesize of output 11 [2023-12-02 16:53:13,821 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 18 treesize of output 13 [2023-12-02 16:53:13,864 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 17 treesize of output 9 [2023-12-02 16:53:13,918 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 16:53:13,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:14,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:14,141 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 27 treesize of output 28 [2023-12-02 16:53:14,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:14,153 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 143 treesize of output 135 [2023-12-02 16:53:14,162 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 27 treesize of output 25 [2023-12-02 16:53:14,174 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 28 treesize of output 24 [2023-12-02 16:53:14,286 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 16:53:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965246467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604343274] [2023-12-02 16:53:14,287 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:14,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-12-02 16:53:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120379398] [2023-12-02 16:53:14,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:14,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 16:53:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:14,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 16:53:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=419, Unknown=4, NotChecked=0, Total=506 [2023-12-02 16:53:14,291 INFO L87 Difference]: Start difference. First operand 3209 states and 10944 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 16:53:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:15,047 INFO L93 Difference]: Finished difference Result 3216 states and 10951 transitions. [2023-12-02 16:53:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 16:53:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 18 [2023-12-02 16:53:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:15,061 INFO L225 Difference]: With dead ends: 3216 [2023-12-02 16:53:15,062 INFO L226 Difference]: Without dead ends: 3216 [2023-12-02 16:53:15,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=788, Unknown=4, NotChecked=0, Total=992 [2023-12-02 16:53:15,063 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 177 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:15,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 331 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:53:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-12-02 16:53:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3210. [2023-12-02 16:53:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 3121 states have (on average 3.506888817686639) internal successors, (10945), 3209 states have internal predecessors, (10945), 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 16:53:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 10945 transitions. [2023-12-02 16:53:15,147 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 10945 transitions. Word has length 18 [2023-12-02 16:53:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:15,147 INFO L495 AbstractCegarLoop]: Abstraction has 3210 states and 10945 transitions. [2023-12-02 16:53:15,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 16:53:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 10945 transitions. [2023-12-02 16:53:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 16:53:15,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:15,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:15,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 16:53:15,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:15,351 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:15,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 150467532, now seen corresponding path program 1 times [2023-12-02 16:53:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676529147] [2023-12-02 16:53:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:15,822 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 16:53:15,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676529147] [2023-12-02 16:53:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676529147] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548494252] [2023-12-02 16:53:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:15,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:15,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:15,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:15,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 16:53:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:15,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 16:53:15,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:15,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:53:15,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:15,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:15,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:15,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:15,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:15,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:16,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:53:16,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:16,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:16,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:16,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 16:53:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:16,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:16,132 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 15 treesize of output 1 [2023-12-02 16:53:16,170 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 16:53:16,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 16:53:16,200 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 16 treesize of output 11 [2023-12-02 16:53:16,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53: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 11 treesize of output 11 [2023-12-02 16:53:16,260 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 16 treesize of output 11 [2023-12-02 16:53:16,289 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 15 treesize of output 7 [2023-12-02 16:53:16,352 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 16:53:16,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:16,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:16,614 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 56 [2023-12-02 16:53:16,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:16,624 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 66 treesize of output 62 [2023-12-02 16:53:16,631 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 50 treesize of output 48 [2023-12-02 16:53:16,710 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 16:53:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548494252] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:16,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [800454110] [2023-12-02 16:53:16,711 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:16,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-12-02 16:53:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636563930] [2023-12-02 16:53:16,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 16:53:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 16:53:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-12-02 16:53:16,713 INFO L87 Difference]: Start difference. First operand 3210 states and 10945 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 16:53:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:17,268 INFO L93 Difference]: Finished difference Result 3217 states and 10952 transitions. [2023-12-02 16:53:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:53:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 19 [2023-12-02 16:53:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:17,277 INFO L225 Difference]: With dead ends: 3217 [2023-12-02 16:53:17,277 INFO L226 Difference]: Without dead ends: 3216 [2023-12-02 16:53:17,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2023-12-02 16:53:17,278 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 117 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:17,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 293 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:53:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-12-02 16:53:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3211. [2023-12-02 16:53:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 3123 states have (on average 3.504963176432917) internal successors, (10946), 3210 states have internal predecessors, (10946), 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 16:53:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 10946 transitions. [2023-12-02 16:53:17,360 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 10946 transitions. Word has length 19 [2023-12-02 16:53:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:17,360 INFO L495 AbstractCegarLoop]: Abstraction has 3211 states and 10946 transitions. [2023-12-02 16:53:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 16:53:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 10946 transitions. [2023-12-02 16:53:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 16:53:17,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:17,362 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] [2023-12-02 16:53:17,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 16:53:17,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 16:53:17,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:17,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1979652480, now seen corresponding path program 1 times [2023-12-02 16:53:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:17,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403208252] [2023-12-02 16:53:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:17,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403208252] [2023-12-02 16:53:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403208252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:53:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547420149] [2023-12-02 16:53:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:17,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:53:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:53:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:53:17,665 INFO L87 Difference]: Start difference. First operand 3211 states and 10946 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 16:53:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:17,823 INFO L93 Difference]: Finished difference Result 3211 states and 10945 transitions. [2023-12-02 16:53:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:53:17,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2023-12-02 16:53:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:17,840 INFO L225 Difference]: With dead ends: 3211 [2023-12-02 16:53:17,840 INFO L226 Difference]: Without dead ends: 3211 [2023-12-02 16:53:17,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:53:17,841 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:17,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 88 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:53:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2023-12-02 16:53:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 3205. [2023-12-02 16:53:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3119 states have (on average 3.507534466175056) internal successors, (10940), 3204 states have internal predecessors, (10940), 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 16:53:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 10940 transitions. [2023-12-02 16:53:17,925 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 10940 transitions. Word has length 20 [2023-12-02 16:53:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:17,925 INFO L495 AbstractCegarLoop]: Abstraction has 3205 states and 10940 transitions. [2023-12-02 16:53:17,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 16:53:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 10940 transitions. [2023-12-02 16:53:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 16:53:17,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:17,926 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:17,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 16:53:17,926 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:17,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash -876037248, now seen corresponding path program 1 times [2023-12-02 16:53:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769677709] [2023-12-02 16:53:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 16:53:18,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769677709] [2023-12-02 16:53:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769677709] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730797273] [2023-12-02 16:53:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:18,095 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:18,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 16:53:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:18,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 16:53:18,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 16:53:18,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 16:53:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730797273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [553266796] [2023-12-02 16:53:18,383 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:18,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:18,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-12-02 16:53:18,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510958557] [2023-12-02 16:53:18,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:18,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 16:53:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:18,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 16:53:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-02 16:53:18,385 INFO L87 Difference]: Start difference. First operand 3205 states and 10940 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:18,861 INFO L93 Difference]: Finished difference Result 6380 states and 21840 transitions. [2023-12-02 16:53:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:53:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 16:53:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:18,883 INFO L225 Difference]: With dead ends: 6380 [2023-12-02 16:53:18,883 INFO L226 Difference]: Without dead ends: 6380 [2023-12-02 16:53:18,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2023-12-02 16:53:18,884 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 273 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:18,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 384 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:53:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6380 states. [2023-12-02 16:53:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6380 to 3216. [2023-12-02 16:53:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3130 states have (on average 3.499041533546326) internal successors, (10952), 3215 states have internal predecessors, (10952), 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 16:53:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 10952 transitions. [2023-12-02 16:53:18,969 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 10952 transitions. Word has length 23 [2023-12-02 16:53:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:18,970 INFO L495 AbstractCegarLoop]: Abstraction has 3216 states and 10952 transitions. [2023-12-02 16:53:18,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 10952 transitions. [2023-12-02 16:53:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 16:53:18,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:18,970 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] [2023-12-02 16:53:18,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 16:53:19,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 16:53:19,171 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:19,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 589766568, now seen corresponding path program 1 times [2023-12-02 16:53:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896262058] [2023-12-02 16:53:19,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:19,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896262058] [2023-12-02 16:53:19,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896262058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:19,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:19,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:53:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811778531] [2023-12-02 16:53:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:19,237 INFO L87 Difference]: Start difference. First operand 3216 states and 10952 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 16:53:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:19,436 INFO L93 Difference]: Finished difference Result 4392 states and 15496 transitions. [2023-12-02 16:53:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:19,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-12-02 16:53:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:19,451 INFO L225 Difference]: With dead ends: 4392 [2023-12-02 16:53:19,451 INFO L226 Difference]: Without dead ends: 4392 [2023-12-02 16:53:19,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:53:19,452 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:19,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 158 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2023-12-02 16:53:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4392. [2023-12-02 16:53:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 4306 states have (on average 3.5986994890849977) internal successors, (15496), 4391 states have internal predecessors, (15496), 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 16:53:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 15496 transitions. [2023-12-02 16:53:19,600 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 15496 transitions. Word has length 23 [2023-12-02 16:53:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:19,601 INFO L495 AbstractCegarLoop]: Abstraction has 4392 states and 15496 transitions. [2023-12-02 16:53:19,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 16:53:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 15496 transitions. [2023-12-02 16:53:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 16:53:19,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:19,602 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 16:53:19,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 16:53:19,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:19,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -264885914, now seen corresponding path program 1 times [2023-12-02 16:53:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915155032] [2023-12-02 16:53:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:19,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915155032] [2023-12-02 16:53:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915155032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:53:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490445725] [2023-12-02 16:53:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:19,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:53:19,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:53:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:53:19,663 INFO L87 Difference]: Start difference. First operand 4392 states and 15496 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 16:53:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:19,829 INFO L93 Difference]: Finished difference Result 7516 states and 27000 transitions. [2023-12-02 16:53:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:53:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 16:53:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:19,860 INFO L225 Difference]: With dead ends: 7516 [2023-12-02 16:53:19,860 INFO L226 Difference]: Without dead ends: 7516 [2023-12-02 16:53:19,860 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 16:53:19,861 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:19,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:53:19,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2023-12-02 16:53:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 4960. [2023-12-02 16:53:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4960 states, 4874 states have (on average 3.8892080426754205) internal successors, (18956), 4959 states have internal predecessors, (18956), 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 16:53:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4960 states to 4960 states and 18956 transitions. [2023-12-02 16:53:19,986 INFO L78 Accepts]: Start accepts. Automaton has 4960 states and 18956 transitions. Word has length 25 [2023-12-02 16:53:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:19,986 INFO L495 AbstractCegarLoop]: Abstraction has 4960 states and 18956 transitions. [2023-12-02 16:53:19,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 16:53:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4960 states and 18956 transitions. [2023-12-02 16:53:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 16:53:19,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:19,987 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 16:53:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 16:53:19,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:19,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash -264885919, now seen corresponding path program 1 times [2023-12-02 16:53:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127266522] [2023-12-02 16:53:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:20,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127266522] [2023-12-02 16:53:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127266522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893875236] [2023-12-02 16:53:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:20,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:20,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 16:53:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:20,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:53:20,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:20,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893875236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2053845428] [2023-12-02 16:53:20,384 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 16:53:20,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 16:53:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391653391] [2023-12-02 16:53:20,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:20,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:53:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:20,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:53:20,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:53:20,386 INFO L87 Difference]: Start difference. First operand 4960 states and 18956 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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 16:53:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:20,790 INFO L93 Difference]: Finished difference Result 5892 states and 21864 transitions. [2023-12-02 16:53:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:53:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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 16:53:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:20,807 INFO L225 Difference]: With dead ends: 5892 [2023-12-02 16:53:20,807 INFO L226 Difference]: Without dead ends: 5892 [2023-12-02 16:53:20,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-12-02 16:53:20,808 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:20,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 380 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:53:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2023-12-02 16:53:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5561. [2023-12-02 16:53:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5561 states, 5475 states have (on average 3.845296803652968) internal successors, (21053), 5560 states have internal predecessors, (21053), 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 16:53:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 21053 transitions. [2023-12-02 16:53:20,924 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 21053 transitions. Word has length 25 [2023-12-02 16:53:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:20,925 INFO L495 AbstractCegarLoop]: Abstraction has 5561 states and 21053 transitions. [2023-12-02 16:53:20,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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 16:53:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 21053 transitions. [2023-12-02 16:53:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:53:20,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:20,925 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 2, 2, 2, 1, 1, 1] [2023-12-02 16:53:20,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 16:53:21,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 16:53:21,126 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:21,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 512237857, now seen corresponding path program 2 times [2023-12-02 16:53:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046303050] [2023-12-02 16:53:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:53:21,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046303050] [2023-12-02 16:53:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046303050] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671458423] [2023-12-02 16:53:21,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:53:21,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:21,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:21,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:21,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 16:53:21,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 16:53:21,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:53:21,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 16:53:21,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 16:53:21,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 16:53:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671458423] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845913760] [2023-12-02 16:53:21,668 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 16:53:21,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 3, 3] total 20 [2023-12-02 16:53:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735868360] [2023-12-02 16:53:21,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:21,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 16:53:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 16:53:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-12-02 16:53:21,670 INFO L87 Difference]: Start difference. First operand 5561 states and 21053 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:22,305 INFO L93 Difference]: Finished difference Result 5578 states and 21073 transitions. [2023-12-02 16:53:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 16:53:22,305 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 16:53:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:22,321 INFO L225 Difference]: With dead ends: 5578 [2023-12-02 16:53:22,321 INFO L226 Difference]: Without dead ends: 5578 [2023-12-02 16:53:22,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=1072, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 16:53:22,322 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 241 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:22,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 495 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:53:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2023-12-02 16:53:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 5557. [2023-12-02 16:53:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5557 states, 5473 states have (on average 3.8456057007125892) internal successors, (21047), 5556 states have internal predecessors, (21047), 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 16:53:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 21047 transitions. [2023-12-02 16:53:22,480 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 21047 transitions. Word has length 26 [2023-12-02 16:53:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:22,480 INFO L495 AbstractCegarLoop]: Abstraction has 5557 states and 21047 transitions. [2023-12-02 16:53:22,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 21047 transitions. [2023-12-02 16:53:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 16:53:22,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:22,481 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] [2023-12-02 16:53:22,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 16:53:22,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 16:53:22,682 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:22,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -974248754, now seen corresponding path program 1 times [2023-12-02 16:53:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318005392] [2023-12-02 16:53:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:22,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318005392] [2023-12-02 16:53:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318005392] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828428084] [2023-12-02 16:53:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:22,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:22,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 16:53:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:22,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:53:22,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:22,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828428084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771275179] [2023-12-02 16:53:23,067 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 16:53:23,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 16:53:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068591421] [2023-12-02 16:53:23,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:23,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:53:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:53:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:53:23,071 INFO L87 Difference]: Start difference. First operand 5557 states and 21047 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 16:53:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:23,487 INFO L93 Difference]: Finished difference Result 5328 states and 19920 transitions. [2023-12-02 16:53:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:53:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 26 [2023-12-02 16:53:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:23,503 INFO L225 Difference]: With dead ends: 5328 [2023-12-02 16:53:23,503 INFO L226 Difference]: Without dead ends: 5328 [2023-12-02 16:53:23,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-12-02 16:53:23,504 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 151 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:23,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 393 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:53:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2023-12-02 16:53:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 5231. [2023-12-02 16:53:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5147 states have (on average 3.8381581503788613) internal successors, (19755), 5230 states have internal predecessors, (19755), 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 16:53:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 19755 transitions. [2023-12-02 16:53:23,650 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 19755 transitions. Word has length 26 [2023-12-02 16:53:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 5231 states and 19755 transitions. [2023-12-02 16:53:23,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 16:53:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 19755 transitions. [2023-12-02 16:53:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 16:53:23,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:23,651 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 16:53:23,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 16:53:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:23,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:23,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash 752959078, now seen corresponding path program 1 times [2023-12-02 16:53:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503256656] [2023-12-02 16:53:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:53:23,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503256656] [2023-12-02 16:53:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503256656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:53:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:53:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261678946] [2023-12-02 16:53:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:53:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:53:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:53:23,923 INFO L87 Difference]: Start difference. First operand 5231 states and 19755 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:24,149 INFO L93 Difference]: Finished difference Result 8816 states and 33674 transitions. [2023-12-02 16:53:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 16:53:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:24,175 INFO L225 Difference]: With dead ends: 8816 [2023-12-02 16:53:24,175 INFO L226 Difference]: Without dead ends: 8816 [2023-12-02 16:53:24,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:53:24,176 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 77 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:24,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 125 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8816 states. [2023-12-02 16:53:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8816 to 8399. [2023-12-02 16:53:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8315 states have (on average 3.9142513529765486) internal successors, (32547), 8398 states have internal predecessors, (32547), 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 16:53:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 32547 transitions. [2023-12-02 16:53:24,445 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 32547 transitions. Word has length 31 [2023-12-02 16:53:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:24,446 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 32547 transitions. [2023-12-02 16:53:24,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 32547 transitions. [2023-12-02 16:53:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:53:24,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:24,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:24,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 16:53:24,448 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:24,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1825733477, now seen corresponding path program 2 times [2023-12-02 16:53:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164982770] [2023-12-02 16:53:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:53:25,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164982770] [2023-12-02 16:53:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164982770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650336227] [2023-12-02 16:53:25,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:53:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:25,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:25,483 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:25,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 16:53:25,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 16:53:25,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:53:25,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 16:53:25,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:25,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:25,810 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 15 treesize of output 1 [2023-12-02 16:53:25,887 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:25,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 11 treesize of output 11 [2023-12-02 16:53:25,936 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 18 treesize of output 13 [2023-12-02 16:53:26,040 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 18 treesize of output 13 [2023-12-02 16:53:26,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:26,135 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 18 treesize of output 13 [2023-12-02 16:53:26,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:26,179 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 18 treesize of output 13 [2023-12-02 16:53:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 16:53:26,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:26,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:26,529 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 32 treesize of output 33 [2023-12-02 16:53:26,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:26,542 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 1235 treesize of output 1187 [2023-12-02 16:53:26,556 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 67 treesize of output 63 [2023-12-02 16:53:26,565 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 63 treesize of output 55 [2023-12-02 16:53:26,574 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 70 treesize of output 54 [2023-12-02 16:53:26,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:26,866 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 29 treesize of output 34 [2023-12-02 16:53:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650336227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1025140091] [2023-12-02 16:53:26,944 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 16:53:26,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 34 [2023-12-02 16:53:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489711134] [2023-12-02 16:53:26,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 16:53:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 16:53:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1091, Unknown=15, NotChecked=0, Total=1260 [2023-12-02 16:53:26,946 INFO L87 Difference]: Start difference. First operand 8399 states and 32547 transitions. Second operand has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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 16:53:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:29,213 INFO L93 Difference]: Finished difference Result 13016 states and 47131 transitions. [2023-12-02 16:53:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 16:53:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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 34 [2023-12-02 16:53:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:29,255 INFO L225 Difference]: With dead ends: 13016 [2023-12-02 16:53:29,255 INFO L226 Difference]: Without dead ends: 13016 [2023-12-02 16:53:29,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=543, Invalid=2748, Unknown=15, NotChecked=0, Total=3306 [2023-12-02 16:53:29,256 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 415 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:29,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1046 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 16:53:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13016 states. [2023-12-02 16:53:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13016 to 8399. [2023-12-02 16:53:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8315 states have (on average 3.9130487071557427) internal successors, (32537), 8398 states have internal predecessors, (32537), 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 16:53:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 32537 transitions. [2023-12-02 16:53:29,510 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 32537 transitions. Word has length 34 [2023-12-02 16:53:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:29,511 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 32537 transitions. [2023-12-02 16:53:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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 16:53:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 32537 transitions. [2023-12-02 16:53:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:53:29,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:29,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:29,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 16:53:29,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:29,713 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:29,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1825733476, now seen corresponding path program 1 times [2023-12-02 16:53:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306458760] [2023-12-02 16:53:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:30,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306458760] [2023-12-02 16:53:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306458760] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627575293] [2023-12-02 16:53:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:30,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:30,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:30,527 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:30,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 16:53:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:30,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 16:53:30,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:30,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:30,879 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 15 treesize of output 1 [2023-12-02 16:53:30,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:30,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 11 treesize of output 11 [2023-12-02 16:53:30,997 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 16 treesize of output 11 [2023-12-02 16:53:31,033 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 16 treesize of output 11 [2023-12-02 16:53:31,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:31,136 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 16 treesize of output 11 [2023-12-02 16:53:31,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:31,170 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 16 treesize of output 11 [2023-12-02 16:53:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:31,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:31,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:31,465 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 30 treesize of output 31 [2023-12-02 16:53:31,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:31,473 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 277 treesize of output 265 [2023-12-02 16:53:31,482 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 122 treesize of output 114 [2023-12-02 16:53:31,488 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 58 treesize of output 54 [2023-12-02 16:53:31,492 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 110 treesize of output 94 [2023-12-02 16:53:31,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:31,743 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 29 treesize of output 34 [2023-12-02 16:53:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627575293] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1777745151] [2023-12-02 16:53:31,800 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 16:53:31,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 29 [2023-12-02 16:53:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735839229] [2023-12-02 16:53:31,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 16:53:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 16:53:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=791, Unknown=23, NotChecked=0, Total=930 [2023-12-02 16:53:31,802 INFO L87 Difference]: Start difference. First operand 8399 states and 32537 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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 16:53:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:33,222 INFO L93 Difference]: Finished difference Result 12999 states and 47092 transitions. [2023-12-02 16:53:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 16:53:33,223 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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 34 [2023-12-02 16:53:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:33,266 INFO L225 Difference]: With dead ends: 12999 [2023-12-02 16:53:33,267 INFO L226 Difference]: Without dead ends: 12999 [2023-12-02 16:53:33,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=1629, Unknown=24, NotChecked=0, Total=1980 [2023-12-02 16:53:33,268 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 535 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:33,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 907 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 16:53:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12999 states. [2023-12-02 16:53:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12999 to 8399. [2023-12-02 16:53:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8315 states have (on average 3.911846061334937) internal successors, (32527), 8398 states have internal predecessors, (32527), 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 16:53:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 32527 transitions. [2023-12-02 16:53:33,488 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 32527 transitions. Word has length 34 [2023-12-02 16:53:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:33,488 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 32527 transitions. [2023-12-02 16:53:33,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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 16:53:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 32527 transitions. [2023-12-02 16:53:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:53:33,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:33,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:33,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 16:53:33,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:33,691 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:33,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1825733474, now seen corresponding path program 1 times [2023-12-02 16:53:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786181289] [2023-12-02 16:53:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:34,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786181289] [2023-12-02 16:53:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786181289] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:34,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812167009] [2023-12-02 16:53:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:34,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:34,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:34,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 16:53:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:34,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 16:53:34,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:34,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,604 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-12-02 16:53:34,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 16:53:34,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,629 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2023-12-02 16:53:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2023-12-02 16:53:34,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:34,659 INFO L349 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2023-12-02 16:53:34,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2023-12-02 16:53:34,860 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 15 treesize of output 1 [2023-12-02 16:53:34,987 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-12-02 16:53:34,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 56 [2023-12-02 16:53:35,062 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 18 treesize of output 13 [2023-12-02 16:53:35,155 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 18 treesize of output 13 [2023-12-02 16:53:35,405 INFO L349 Elim1Store]: treesize reduction 12, result has 85.2 percent of original size [2023-12-02 16:53:35,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 111 [2023-12-02 16:53:35,798 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 18 treesize of output 13 [2023-12-02 16:53:35,862 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 18 treesize of output 13 [2023-12-02 16:53:35,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:35,945 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 18 treesize of output 13 [2023-12-02 16:53:35,959 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 18 treesize of output 13 [2023-12-02 16:53:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:35,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:36,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:36,380 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 35 treesize of output 36 [2023-12-02 16:53:36,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:36,392 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 2451 treesize of output 2403 [2023-12-02 16:53:36,412 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 290 treesize of output 282 [2023-12-02 16:53:36,425 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 142 treesize of output 138 [2023-12-02 16:53:36,434 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 278 treesize of output 262 [2023-12-02 16:53:36,445 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 262 treesize of output 230 [2023-12-02 16:53:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812167009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [578123872] [2023-12-02 16:53:36,943 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 16:53:36,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2023-12-02 16:53:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138224005] [2023-12-02 16:53:36,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:36,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 16:53:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 16:53:36,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=774, Unknown=18, NotChecked=0, Total=930 [2023-12-02 16:53:36,945 INFO L87 Difference]: Start difference. First operand 8399 states and 32527 transitions. Second operand has 31 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:38,299 INFO L93 Difference]: Finished difference Result 8941 states and 33950 transitions. [2023-12-02 16:53:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 16:53:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 16:53:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:38,331 INFO L225 Difference]: With dead ends: 8941 [2023-12-02 16:53:38,331 INFO L226 Difference]: Without dead ends: 8941 [2023-12-02 16:53:38,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=992, Unknown=18, NotChecked=0, Total=1190 [2023-12-02 16:53:38,332 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 144 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:38,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 816 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 16:53:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8941 states. [2023-12-02 16:53:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8941 to 8399. [2023-12-02 16:53:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8315 states have (on average 3.910643415514131) internal successors, (32517), 8398 states have internal predecessors, (32517), 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 16:53:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 32517 transitions. [2023-12-02 16:53:38,532 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 32517 transitions. Word has length 34 [2023-12-02 16:53:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:38,532 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 32517 transitions. [2023-12-02 16:53:38,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:53:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 32517 transitions. [2023-12-02 16:53:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 16:53:38,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:38,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:38,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 16:53:38,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:38,734 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:38,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1825733473, now seen corresponding path program 1 times [2023-12-02 16:53:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256212967] [2023-12-02 16:53:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:53:39,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:39,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256212967] [2023-12-02 16:53:39,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256212967] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:39,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598960547] [2023-12-02 16:53:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:39,833 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:39,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 16:53:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:39,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 16:53:39,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:39,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:39,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:53:40,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:53:40,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:40,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:40,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:53:40,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:40,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:53:40,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:53:40,174 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 15 treesize of output 1 [2023-12-02 16:53:40,265 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:53:40,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 16:53:40,321 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 16 treesize of output 11 [2023-12-02 16:53:40,375 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 16 treesize of output 11 [2023-12-02 16:53:40,465 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 16:53:40,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 16:53:40,510 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 16 treesize of output 11 [2023-12-02 16:53:40,537 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 16 treesize of output 11 [2023-12-02 16:53:40,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,616 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 16 treesize of output 11 [2023-12-02 16:53:40,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:40,647 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 16 treesize of output 11 [2023-12-02 16:53:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:40,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:40,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_850) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648)) is different from false [2023-12-02 16:53:41,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:41,075 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 33 treesize of output 34 [2023-12-02 16:53:41,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:41,089 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 17537 treesize of output 17153 [2023-12-02 16:53:41,115 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 127 treesize of output 123 [2023-12-02 16:53:41,122 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 254 treesize of output 238 [2023-12-02 16:53:41,130 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 238 treesize of output 206 [2023-12-02 16:53:41,139 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 106 treesize of output 98 [2023-12-02 16:53:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598960547] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081890246] [2023-12-02 16:53:41,617 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 16:53:41,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2023-12-02 16:53:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173907328] [2023-12-02 16:53:41,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:41,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 16:53:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 16:53:41,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1009, Unknown=13, NotChecked=66, Total=1260 [2023-12-02 16:53:41,619 INFO L87 Difference]: Start difference. First operand 8399 states and 32517 transitions. Second operand has 36 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 16:53:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:43,327 INFO L93 Difference]: Finished difference Result 8933 states and 33921 transitions. [2023-12-02 16:53:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:53:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 34 [2023-12-02 16:53:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:43,353 INFO L225 Difference]: With dead ends: 8933 [2023-12-02 16:53:43,353 INFO L226 Difference]: Without dead ends: 8933 [2023-12-02 16:53:43,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1567, Unknown=13, NotChecked=84, Total=1980 [2023-12-02 16:53:43,354 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 171 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:43,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1140 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1817 Invalid, 0 Unknown, 165 Unchecked, 1.3s Time] [2023-12-02 16:53:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8933 states. [2023-12-02 16:53:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8933 to 8399. [2023-12-02 16:53:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8315 states have (on average 3.909440769693325) internal successors, (32507), 8398 states have internal predecessors, (32507), 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 16:53:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 32507 transitions. [2023-12-02 16:53:43,549 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 32507 transitions. Word has length 34 [2023-12-02 16:53:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:43,549 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 32507 transitions. [2023-12-02 16:53:43,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 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 16:53:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 32507 transitions. [2023-12-02 16:53:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 16:53:43,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:43,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:43,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 16:53:43,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 16:53:43,751 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:43,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2115882796, now seen corresponding path program 2 times [2023-12-02 16:53:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302263797] [2023-12-02 16:53:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:53:43,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302263797] [2023-12-02 16:53:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302263797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516638689] [2023-12-02 16:53:43,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:53:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:43,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:43,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 16:53:44,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 16:53:44,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:53:44,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:53:44,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:53:44,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:53:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516638689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:53:44,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:53:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 16:53:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709627775] [2023-12-02 16:53:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:53:44,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:53:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:44,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:53:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:53:44,053 INFO L87 Difference]: Start difference. First operand 8399 states and 32507 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 16:53:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:44,263 INFO L93 Difference]: Finished difference Result 7683 states and 29713 transitions. [2023-12-02 16:53:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:53:44,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 16:53:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:44,287 INFO L225 Difference]: With dead ends: 7683 [2023-12-02 16:53:44,287 INFO L226 Difference]: Without dead ends: 7683 [2023-12-02 16:53:44,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:53:44,288 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 105 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:44,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 147 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:53:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7683 states. [2023-12-02 16:53:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7683 to 7683. [2023-12-02 16:53:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7626 states have (on average 3.8962758982428536) internal successors, (29713), 7682 states have internal predecessors, (29713), 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 16:53:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 29713 transitions. [2023-12-02 16:53:44,445 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 29713 transitions. Word has length 35 [2023-12-02 16:53:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:44,445 INFO L495 AbstractCegarLoop]: Abstraction has 7683 states and 29713 transitions. [2023-12-02 16:53:44,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 16:53:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 29713 transitions. [2023-12-02 16:53:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 16:53:44,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:44,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:44,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 16:53:44,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 16:53:44,647 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:44,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -763164273, now seen corresponding path program 1 times [2023-12-02 16:53:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444131106] [2023-12-02 16:53:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 16:53:45,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444131106] [2023-12-02 16:53:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444131106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123858392] [2023-12-02 16:53:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:45,779 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:45,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 16:53:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:45,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 16:53:45,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:46,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:46,186 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 15 treesize of output 1 [2023-12-02 16:53:46,262 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:46,262 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 11 treesize of output 11 [2023-12-02 16:53:46,306 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 18 treesize of output 13 [2023-12-02 16:53:46,337 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 18 treesize of output 13 [2023-12-02 16:53:46,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:46,460 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 18 treesize of output 13 [2023-12-02 16:53:46,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:46,513 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 18 treesize of output 13 [2023-12-02 16:53:46,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:46,593 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 18 treesize of output 13 [2023-12-02 16:53:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:46,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:46,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_970 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_970) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:53:46,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_970 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_970) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:53:46,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_970) c_~B~0.base) (+ 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:53:46,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:46,910 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 35 treesize of output 36 [2023-12-02 16:53:46,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:46,928 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 39171 treesize of output 38403 [2023-12-02 16:53:46,972 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 143 treesize of output 139 [2023-12-02 16:53:46,981 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 139 treesize of output 123 [2023-12-02 16:53:46,989 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 123 treesize of output 115 [2023-12-02 16:53:46,998 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 146 treesize of output 114 [2023-12-02 16:53:47,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:47,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-12-02 16:53:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2023-12-02 16:53:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123858392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [398563191] [2023-12-02 16:53:47,462 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 16:53:47,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2023-12-02 16:53:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776034306] [2023-12-02 16:53:47,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:47,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 16:53:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 16:53:47,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1194, Unknown=19, NotChecked=216, Total=1560 [2023-12-02 16:53:47,464 INFO L87 Difference]: Start difference. First operand 7683 states and 29713 transitions. Second operand has 40 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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 16:53:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:49,953 INFO L93 Difference]: Finished difference Result 11587 states and 41879 transitions. [2023-12-02 16:53:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 16:53:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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 16:53:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:49,991 INFO L225 Difference]: With dead ends: 11587 [2023-12-02 16:53:49,991 INFO L226 Difference]: Without dead ends: 11587 [2023-12-02 16:53:49,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=467, Invalid=2606, Unknown=19, NotChecked=330, Total=3422 [2023-12-02 16:53:49,993 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 834 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:49,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1290 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2012 Invalid, 0 Unknown, 705 Unchecked, 1.3s Time] [2023-12-02 16:53:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11587 states. [2023-12-02 16:53:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11587 to 7683. [2023-12-02 16:53:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7626 states have (on average 3.8426435877262) internal successors, (29304), 7682 states have internal predecessors, (29304), 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 16:53:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 29304 transitions. [2023-12-02 16:53:50,236 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 29304 transitions. Word has length 35 [2023-12-02 16:53:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:50,236 INFO L495 AbstractCegarLoop]: Abstraction has 7683 states and 29304 transitions. [2023-12-02 16:53:50,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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 16:53:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 29304 transitions. [2023-12-02 16:53:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 16:53:50,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:50,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:50,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-02 16:53:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 16:53:50,438 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:50,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -763164272, now seen corresponding path program 1 times [2023-12-02 16:53:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532561258] [2023-12-02 16:53:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:51,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:51,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532561258] [2023-12-02 16:53:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532561258] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:51,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378272011] [2023-12-02 16:53:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:51,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:51,197 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:51,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 16:53:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:51,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 16:53:51,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:51,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:53:51,559 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 15 treesize of output 1 [2023-12-02 16:53:51,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:53:51,627 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 11 treesize of output 11 [2023-12-02 16:53:51,667 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 16 treesize of output 11 [2023-12-02 16:53:51,709 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 16 treesize of output 11 [2023-12-02 16:53:51,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:51,821 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 16 treesize of output 11 [2023-12-02 16:53:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:51,860 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 16 treesize of output 11 [2023-12-02 16:53:51,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:53:51,928 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 16 treesize of output 11 [2023-12-02 16:53:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:51,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:51,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1038) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 16:53:52,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:52,254 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 33 treesize of output 34 [2023-12-02 16:53:52,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:52,265 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 2193 treesize of output 2145 [2023-12-02 16:53:52,284 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 127 treesize of output 123 [2023-12-02 16:53:52,293 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 123 treesize of output 107 [2023-12-02 16:53:52,302 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 107 treesize of output 99 [2023-12-02 16:53:52,312 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 130 treesize of output 98 [2023-12-02 16:53:52,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:52,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-12-02 16:53:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 16:53:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378272011] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:52,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1396620804] [2023-12-02 16:53:52,770 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 16:53:52,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 33 [2023-12-02 16:53:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293694380] [2023-12-02 16:53:52,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:52,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 16:53:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 16:53:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=973, Unknown=16, NotChecked=64, Total=1190 [2023-12-02 16:53:52,772 INFO L87 Difference]: Start difference. First operand 7683 states and 29304 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 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 16:53:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:54,308 INFO L93 Difference]: Finished difference Result 11171 states and 40363 transitions. [2023-12-02 16:53:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:53:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 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 16:53:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:54,335 INFO L225 Difference]: With dead ends: 11171 [2023-12-02 16:53:54,335 INFO L226 Difference]: Without dead ends: 11171 [2023-12-02 16:53:54,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=1799, Unknown=16, NotChecked=90, Total=2256 [2023-12-02 16:53:54,336 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 756 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:54,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 993 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1471 Invalid, 0 Unknown, 223 Unchecked, 1.0s Time] [2023-12-02 16:53:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2023-12-02 16:53:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 7683. [2023-12-02 16:53:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7626 states have (on average 3.7890112772095463) internal successors, (28895), 7682 states have internal predecessors, (28895), 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 16:53:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 28895 transitions. [2023-12-02 16:53:54,497 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 28895 transitions. Word has length 35 [2023-12-02 16:53:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:53:54,497 INFO L495 AbstractCegarLoop]: Abstraction has 7683 states and 28895 transitions. [2023-12-02 16:53:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 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 16:53:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 28895 transitions. [2023-12-02 16:53:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 16:53:54,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:53:54,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:53:54,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 16:53:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 16:53:54,699 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:53:54,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:53:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash -763164270, now seen corresponding path program 1 times [2023-12-02 16:53:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:53:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92124636] [2023-12-02 16:53:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:53:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:55,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:53:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92124636] [2023-12-02 16:53:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92124636] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:53:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738942319] [2023-12-02 16:53:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:53:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:53:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:53:55,514 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:53:55,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 16:53:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:53:55,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 16:53:55,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:53:55,703 INFO L349 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2023-12-02 16:53:55,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 36 [2023-12-02 16:53:55,861 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 16:53:55,982 INFO L349 Elim1Store]: treesize reduction 96, result has 27.8 percent of original size [2023-12-02 16:53:55,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 57 [2023-12-02 16:53:56,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:53:56,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:53:56,381 INFO L349 Elim1Store]: treesize reduction 44, result has 32.3 percent of original size [2023-12-02 16:53:56,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 39 [2023-12-02 16:53:56,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:53:56,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:53:56,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:53:56,597 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 18 treesize of output 13 [2023-12-02 16:53:56,625 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 18 treesize of output 13 [2023-12-02 16:53:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:53:56,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:53:56,787 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1111) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2023-12-02 16:53:57,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:57,122 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 38 treesize of output 39 [2023-12-02 16:53:57,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:53:57,139 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 9763 treesize of output 9667 [2023-12-02 16:53:57,200 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 295 treesize of output 263 [2023-12-02 16:53:57,214 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 263 treesize of output 255 [2023-12-02 16:53:57,228 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 255 treesize of output 239 [2023-12-02 16:53:57,245 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 239 treesize of output 235 [2023-12-02 16:53:57,260 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 298 treesize of output 234 [2023-12-02 16:53:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-02 16:53:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738942319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:53:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1310136925] [2023-12-02 16:53:57,879 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 16:53:57,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:53:57,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2023-12-02 16:53:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329619250] [2023-12-02 16:53:57,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:53:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 16:53:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:53:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 16:53:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=836, Unknown=21, NotChecked=60, Total=1056 [2023-12-02 16:53:57,880 INFO L87 Difference]: Start difference. First operand 7683 states and 28895 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 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 16:53:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:53:59,908 INFO L93 Difference]: Finished difference Result 10772 states and 38865 transitions. [2023-12-02 16:53:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:53:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 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 16:53:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:53:59,938 INFO L225 Difference]: With dead ends: 10772 [2023-12-02 16:53:59,938 INFO L226 Difference]: Without dead ends: 10772 [2023-12-02 16:53:59,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=307, Invalid=1398, Unknown=21, NotChecked=80, Total=1806 [2023-12-02 16:53:59,939 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 233 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:53:59,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1151 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 190 Unchecked, 1.4s Time] [2023-12-02 16:53:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2023-12-02 16:54:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 7683. [2023-12-02 16:54:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7626 states have (on average 3.7353789666928927) internal successors, (28486), 7682 states have internal predecessors, (28486), 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 16:54:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 28486 transitions. [2023-12-02 16:54:00,104 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 28486 transitions. Word has length 35 [2023-12-02 16:54:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:00,104 INFO L495 AbstractCegarLoop]: Abstraction has 7683 states and 28486 transitions. [2023-12-02 16:54:00,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 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 16:54:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 28486 transitions. [2023-12-02 16:54:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 16:54:00,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:00,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:00,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 16:54:00,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 16:54:00,306 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:00,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash -763164269, now seen corresponding path program 1 times [2023-12-02 16:54:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:00,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810909156] [2023-12-02 16:54:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:00,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:54:00,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810909156] [2023-12-02 16:54:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810909156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147618315] [2023-12-02 16:54:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:00,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:00,981 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:00,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 16:54:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:01,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 16:54:01,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:01,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-12-02 16:54:01,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:54:01,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:54:01,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:54:01,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:54:01,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:54:01,355 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 15 treesize of output 1 [2023-12-02 16:54:01,436 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:54:01,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 16:54:01,486 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 16 treesize of output 11 [2023-12-02 16:54:01,544 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 16 treesize of output 11 [2023-12-02 16:54:01,658 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 16:54:01,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 16:54:01,692 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 16 treesize of output 11 [2023-12-02 16:54:01,726 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 16 treesize of output 11 [2023-12-02 16:54:01,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,835 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 16 treesize of output 11 [2023-12-02 16:54:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,876 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 16 treesize of output 11 [2023-12-02 16:54:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:01,947 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 16 treesize of output 11 [2023-12-02 16:54:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 16:54:01,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:02,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1184) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648)) is different from false [2023-12-02 16:54:02,060 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1182) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1184) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648)) is different from false [2023-12-02 16:54:02,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:54:02,428 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 36 treesize of output 37 [2023-12-02 16:54:02,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:54:02,438 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 547 treesize of output 541 [2023-12-02 16:54:02,472 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 530 treesize of output 466 [2023-12-02 16:54:02,484 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 466 treesize of output 434 [2023-12-02 16:54:02,497 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 434 treesize of output 426 [2023-12-02 16:54:02,510 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 426 treesize of output 410 [2023-12-02 16:54:02,524 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 206 treesize of output 202 [2023-12-02 16:54:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-12-02 16:54:03,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147618315] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934281095] [2023-12-02 16:54:03,297 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 16:54:03,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-12-02 16:54:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338623595] [2023-12-02 16:54:03,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 16:54:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 16:54:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1021, Unknown=15, NotChecked=134, Total=1332 [2023-12-02 16:54:03,300 INFO L87 Difference]: Start difference. First operand 7683 states and 28486 transitions. Second operand has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 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 16:54:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:04,900 INFO L93 Difference]: Finished difference Result 10355 states and 37349 transitions. [2023-12-02 16:54:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 16:54:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 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 16:54:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:04,937 INFO L225 Difference]: With dead ends: 10355 [2023-12-02 16:54:04,937 INFO L226 Difference]: Without dead ends: 10355 [2023-12-02 16:54:04,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1265, Unknown=15, NotChecked=150, Total=1640 [2023-12-02 16:54:04,938 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 331 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:04,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1314 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1751 Invalid, 0 Unknown, 357 Unchecked, 1.3s Time] [2023-12-02 16:54:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10355 states. [2023-12-02 16:54:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10355 to 7683. [2023-12-02 16:54:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7626 states have (on average 3.681746656176239) internal successors, (28077), 7682 states have internal predecessors, (28077), 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 16:54:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 28077 transitions. [2023-12-02 16:54:05,099 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 28077 transitions. Word has length 35 [2023-12-02 16:54:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:05,100 INFO L495 AbstractCegarLoop]: Abstraction has 7683 states and 28077 transitions. [2023-12-02 16:54:05,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 36 states have internal predecessors, (104), 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 16:54:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 28077 transitions. [2023-12-02 16:54:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 16:54:05,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:05,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:05,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 16:54:05,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 16:54:05,302 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:05,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1167856096, now seen corresponding path program 1 times [2023-12-02 16:54:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139400506] [2023-12-02 16:54:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:05,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139400506] [2023-12-02 16:54:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139400506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893473915] [2023-12-02 16:54:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:05,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:05,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:05,366 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:05,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 16:54:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:05,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:54:05,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:05,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893473915] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118476915] [2023-12-02 16:54:05,579 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 16:54:05,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 16:54:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302271518] [2023-12-02 16:54:05,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:05,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 16:54:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 16:54:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:54:05,581 INFO L87 Difference]: Start difference. First operand 7683 states and 28077 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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 16:54:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:06,074 INFO L93 Difference]: Finished difference Result 14127 states and 53895 transitions. [2023-12-02 16:54:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 16:54:06,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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 36 [2023-12-02 16:54:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:06,113 INFO L225 Difference]: With dead ends: 14127 [2023-12-02 16:54:06,113 INFO L226 Difference]: Without dead ends: 14127 [2023-12-02 16:54:06,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2023-12-02 16:54:06,114 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 509 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:06,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 361 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:54:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14127 states. [2023-12-02 16:54:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14127 to 14127. [2023-12-02 16:54:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14127 states, 14070 states have (on average 3.8304904051172706) internal successors, (53895), 14126 states have internal predecessors, (53895), 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 16:54:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14127 states to 14127 states and 53895 transitions. [2023-12-02 16:54:06,430 INFO L78 Accepts]: Start accepts. Automaton has 14127 states and 53895 transitions. Word has length 36 [2023-12-02 16:54:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:06,430 INFO L495 AbstractCegarLoop]: Abstraction has 14127 states and 53895 transitions. [2023-12-02 16:54:06,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 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 16:54:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14127 states and 53895 transitions. [2023-12-02 16:54:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 16:54:06,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:06,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:06,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 16:54:06,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:06,632 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:06,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2111795331, now seen corresponding path program 1 times [2023-12-02 16:54:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654866016] [2023-12-02 16:54:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:06,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:06,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654866016] [2023-12-02 16:54:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654866016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:06,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:54:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692550986] [2023-12-02 16:54:06,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:06,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:54:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:06,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:54:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:54:06,685 INFO L87 Difference]: Start difference. First operand 14127 states and 53895 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:54:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:06,918 INFO L93 Difference]: Finished difference Result 16515 states and 62985 transitions. [2023-12-02 16:54:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:54:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 36 [2023-12-02 16:54:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:06,976 INFO L225 Difference]: With dead ends: 16515 [2023-12-02 16:54:06,976 INFO L226 Difference]: Without dead ends: 16515 [2023-12-02 16:54:06,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:54:06,977 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:06,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:54:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16515 states. [2023-12-02 16:54:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16515 to 16515. [2023-12-02 16:54:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16515 states, 16458 states have (on average 3.8270142180094786) internal successors, (62985), 16514 states have internal predecessors, (62985), 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 16:54:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16515 states to 16515 states and 62985 transitions. [2023-12-02 16:54:07,316 INFO L78 Accepts]: Start accepts. Automaton has 16515 states and 62985 transitions. Word has length 36 [2023-12-02 16:54:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:07,317 INFO L495 AbstractCegarLoop]: Abstraction has 16515 states and 62985 transitions. [2023-12-02 16:54:07,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 16:54:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16515 states and 62985 transitions. [2023-12-02 16:54:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:54:07,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:07,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:07,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-02 16:54:07,320 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:07,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash -185097557, now seen corresponding path program 1 times [2023-12-02 16:54:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966795448] [2023-12-02 16:54:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:07,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966795448] [2023-12-02 16:54:07,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966795448] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475028807] [2023-12-02 16:54:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:07,405 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:07,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 16:54:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:07,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:54:07,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:07,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:54:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475028807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:07,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:54:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 16:54:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789424168] [2023-12-02 16:54:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:07,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:54:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:07,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:54:07,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:54:07,602 INFO L87 Difference]: Start difference. First operand 16515 states and 62985 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:54:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:07,855 INFO L93 Difference]: Finished difference Result 14923 states and 56925 transitions. [2023-12-02 16:54:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:54:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 16:54:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:07,917 INFO L225 Difference]: With dead ends: 14923 [2023-12-02 16:54:07,917 INFO L226 Difference]: Without dead ends: 14923 [2023-12-02 16:54:07,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:54:07,918 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 90 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:07,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 184 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2023-12-02 16:54:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14923. [2023-12-02 16:54:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14923 states, 14878 states have (on average 3.8261191020298426) internal successors, (56925), 14922 states have internal predecessors, (56925), 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 16:54:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14923 states to 14923 states and 56925 transitions. [2023-12-02 16:54:08,304 INFO L78 Accepts]: Start accepts. Automaton has 14923 states and 56925 transitions. Word has length 39 [2023-12-02 16:54:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:08,305 INFO L495 AbstractCegarLoop]: Abstraction has 14923 states and 56925 transitions. [2023-12-02 16:54:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:54:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14923 states and 56925 transitions. [2023-12-02 16:54:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:54:08,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:08,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:08,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 16:54:08,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 16:54:08,508 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:08,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash -185097556, now seen corresponding path program 1 times [2023-12-02 16:54:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879072658] [2023-12-02 16:54:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:08,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879072658] [2023-12-02 16:54:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879072658] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199569885] [2023-12-02 16:54:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:08,568 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:08,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 16:54:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:08,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:54:08,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:08,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:54:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199569885] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:08,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656325233] [2023-12-02 16:54:08,763 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 16:54:08,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-02 16:54:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378419633] [2023-12-02 16:54:08,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:08,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 16:54:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 16:54:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:54:08,765 INFO L87 Difference]: Start difference. First operand 14923 states and 56925 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 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 16:54:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:09,199 INFO L93 Difference]: Finished difference Result 26863 states and 103967 transitions. [2023-12-02 16:54:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:54:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 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 39 [2023-12-02 16:54:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:09,296 INFO L225 Difference]: With dead ends: 26863 [2023-12-02 16:54:09,296 INFO L226 Difference]: Without dead ends: 26863 [2023-12-02 16:54:09,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-02 16:54:09,297 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 219 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:09,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 327 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:54:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26863 states. [2023-12-02 16:54:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26863 to 20495. [2023-12-02 16:54:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20495 states, 20450 states have (on average 4.210024449877751) internal successors, (86095), 20494 states have internal predecessors, (86095), 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 16:54:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20495 states to 20495 states and 86095 transitions. [2023-12-02 16:54:09,960 INFO L78 Accepts]: Start accepts. Automaton has 20495 states and 86095 transitions. Word has length 39 [2023-12-02 16:54:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:09,961 INFO L495 AbstractCegarLoop]: Abstraction has 20495 states and 86095 transitions. [2023-12-02 16:54:09,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 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 16:54:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 20495 states and 86095 transitions. [2023-12-02 16:54:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:54:09,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:09,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:09,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-02 16:54:10,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 16:54:10,173 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:10,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash -185097562, now seen corresponding path program 1 times [2023-12-02 16:54:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249414265] [2023-12-02 16:54:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:54:10,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249414265] [2023-12-02 16:54:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249414265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223344228] [2023-12-02 16:54:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:10,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:10,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:10,416 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:10,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 16:54:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:10,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 16:54:10,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:54:10,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:54:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223344228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477472938] [2023-12-02 16:54:10,832 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 16:54:10,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-12-02 16:54:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981485198] [2023-12-02 16:54:10,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 16:54:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 16:54:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2023-12-02 16:54:10,834 INFO L87 Difference]: Start difference. First operand 20495 states and 86095 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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 16:54:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:11,633 INFO L93 Difference]: Finished difference Result 26982 states and 110549 transitions. [2023-12-02 16:54:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 16:54:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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 39 [2023-12-02 16:54:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:11,797 INFO L225 Difference]: With dead ends: 26982 [2023-12-02 16:54:11,798 INFO L226 Difference]: Without dead ends: 26982 [2023-12-02 16:54:11,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 16:54:11,799 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 376 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:11,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 568 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 16:54:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26982 states. [2023-12-02 16:54:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26982 to 26037. [2023-12-02 16:54:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26037 states, 25992 states have (on average 4.153739612188366) internal successors, (107964), 26036 states have internal predecessors, (107964), 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 16:54:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26037 states to 26037 states and 107964 transitions. [2023-12-02 16:54:12,589 INFO L78 Accepts]: Start accepts. Automaton has 26037 states and 107964 transitions. Word has length 39 [2023-12-02 16:54:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:12,589 INFO L495 AbstractCegarLoop]: Abstraction has 26037 states and 107964 transitions. [2023-12-02 16:54:12,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 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 16:54:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 26037 states and 107964 transitions. [2023-12-02 16:54:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 16:54:12,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:12,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:12,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 16:54:12,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 16:54:12,792 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:12,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash -592618297, now seen corresponding path program 1 times [2023-12-02 16:54:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146119272] [2023-12-02 16:54:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:12,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 16:54:12,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146119272] [2023-12-02 16:54:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146119272] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160520453] [2023-12-02 16:54:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:12,882 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:12,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 16:54:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:13,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:54:13,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 16:54:13,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 16:54:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160520453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971499767] [2023-12-02 16:54:13,166 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 16:54:13,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 16:54:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146161746] [2023-12-02 16:54:13,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 16:54:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 16:54:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:54:13,168 INFO L87 Difference]: Start difference. First operand 26037 states and 107964 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 16:54:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:13,748 INFO L93 Difference]: Finished difference Result 25820 states and 107152 transitions. [2023-12-02 16:54:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 16:54:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 39 [2023-12-02 16:54:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:13,858 INFO L225 Difference]: With dead ends: 25820 [2023-12-02 16:54:13,859 INFO L226 Difference]: Without dead ends: 25820 [2023-12-02 16:54:13,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-12-02 16:54:13,859 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 118 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:13,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 390 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 16:54:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25820 states. [2023-12-02 16:54:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25820 to 25789. [2023-12-02 16:54:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25789 states, 25744 states have (on average 4.1608530142945925) internal successors, (107117), 25788 states have internal predecessors, (107117), 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 16:54:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25789 states to 25789 states and 107117 transitions. [2023-12-02 16:54:14,648 INFO L78 Accepts]: Start accepts. Automaton has 25789 states and 107117 transitions. Word has length 39 [2023-12-02 16:54:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:14,649 INFO L495 AbstractCegarLoop]: Abstraction has 25789 states and 107117 transitions. [2023-12-02 16:54:14,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 16:54:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25789 states and 107117 transitions. [2023-12-02 16:54:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 16:54:14,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:14,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:14,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 16:54:14,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-02 16:54:14,851 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:14,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -129463642, now seen corresponding path program 1 times [2023-12-02 16:54:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:14,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097925392] [2023-12-02 16:54:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:15,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097925392] [2023-12-02 16:54:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097925392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:15,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:54:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559722976] [2023-12-02 16:54:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:54:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:54:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:15,028 INFO L87 Difference]: Start difference. First operand 25789 states and 107117 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 16:54:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:15,392 INFO L93 Difference]: Finished difference Result 31267 states and 128093 transitions. [2023-12-02 16:54:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:54:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2023-12-02 16:54:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:15,497 INFO L225 Difference]: With dead ends: 31267 [2023-12-02 16:54:15,497 INFO L226 Difference]: Without dead ends: 31267 [2023-12-02 16:54:15,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:15,498 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:15,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 84 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31267 states. [2023-12-02 16:54:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31267 to 29845. [2023-12-02 16:54:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29845 states, 29800 states have (on average 4.171543624161074) internal successors, (124312), 29844 states have internal predecessors, (124312), 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 16:54:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29845 states to 29845 states and 124312 transitions. [2023-12-02 16:54:16,592 INFO L78 Accepts]: Start accepts. Automaton has 29845 states and 124312 transitions. Word has length 40 [2023-12-02 16:54:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:16,593 INFO L495 AbstractCegarLoop]: Abstraction has 29845 states and 124312 transitions. [2023-12-02 16:54:16,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 16:54:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29845 states and 124312 transitions. [2023-12-02 16:54:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 16:54:16,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:16,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:16,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-02 16:54:16,596 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:16,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 281570547, now seen corresponding path program 1 times [2023-12-02 16:54:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691197987] [2023-12-02 16:54:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:16,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691197987] [2023-12-02 16:54:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691197987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:16,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:54:16,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249919528] [2023-12-02 16:54:16,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:16,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:54:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:54:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:54:16,692 INFO L87 Difference]: Start difference. First operand 29845 states and 124312 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 16:54:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:17,418 INFO L93 Difference]: Finished difference Result 57514 states and 238521 transitions. [2023-12-02 16:54:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:54:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 41 [2023-12-02 16:54:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:17,768 INFO L225 Difference]: With dead ends: 57514 [2023-12-02 16:54:17,768 INFO L226 Difference]: Without dead ends: 57514 [2023-12-02 16:54:17,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:54:17,769 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 120 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:17,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 87 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57514 states. [2023-12-02 16:54:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57514 to 49756. [2023-12-02 16:54:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49756 states, 49711 states have (on average 4.325783025889642) internal successors, (215039), 49755 states have internal predecessors, (215039), 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 16:54:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49756 states to 49756 states and 215039 transitions. [2023-12-02 16:54:19,392 INFO L78 Accepts]: Start accepts. Automaton has 49756 states and 215039 transitions. Word has length 41 [2023-12-02 16:54:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:19,392 INFO L495 AbstractCegarLoop]: Abstraction has 49756 states and 215039 transitions. [2023-12-02 16:54:19,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 16:54:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 49756 states and 215039 transitions. [2023-12-02 16:54:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 16:54:19,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:19,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:19,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-02 16:54:19,398 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:19,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 138751329, now seen corresponding path program 1 times [2023-12-02 16:54:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:19,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033159654] [2023-12-02 16:54:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:19,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:19,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:19,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033159654] [2023-12-02 16:54:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033159654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:54:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10002814] [2023-12-02 16:54:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:19,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 16:54:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 16:54:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:54:19,707 INFO L87 Difference]: Start difference. First operand 49756 states and 215039 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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 16:54:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:20,451 INFO L93 Difference]: Finished difference Result 53154 states and 226024 transitions. [2023-12-02 16:54:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 16:54:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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 42 [2023-12-02 16:54:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:20,693 INFO L225 Difference]: With dead ends: 53154 [2023-12-02 16:54:20,693 INFO L226 Difference]: Without dead ends: 53150 [2023-12-02 16:54:20,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2023-12-02 16:54:20,694 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 130 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:20,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 82 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53150 states. [2023-12-02 16:54:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53150 to 51722. [2023-12-02 16:54:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51722 states, 51677 states have (on average 4.3004237862105) internal successors, (222233), 51721 states have internal predecessors, (222233), 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 16:54:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51722 states to 51722 states and 222233 transitions. [2023-12-02 16:54:22,677 INFO L78 Accepts]: Start accepts. Automaton has 51722 states and 222233 transitions. Word has length 42 [2023-12-02 16:54:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:22,678 INFO L495 AbstractCegarLoop]: Abstraction has 51722 states and 222233 transitions. [2023-12-02 16:54:22,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 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 16:54:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 51722 states and 222233 transitions. [2023-12-02 16:54:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 16:54:22,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:22,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:22,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-02 16:54:22,683 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:22,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1013938082, now seen corresponding path program 1 times [2023-12-02 16:54:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:22,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162089930] [2023-12-02 16:54:22,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:22,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162089930] [2023-12-02 16:54:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162089930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:54:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194350707] [2023-12-02 16:54:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:22,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:54:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:54:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:22,771 INFO L87 Difference]: Start difference. First operand 51722 states and 222233 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 16:54:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:23,529 INFO L93 Difference]: Finished difference Result 53155 states and 226027 transitions. [2023-12-02 16:54:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:54:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 42 [2023-12-02 16:54:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:23,737 INFO L225 Difference]: With dead ends: 53155 [2023-12-02 16:54:23,737 INFO L226 Difference]: Without dead ends: 53155 [2023-12-02 16:54:23,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:23,738 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 99 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:23,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 136 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53155 states. [2023-12-02 16:54:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53155 to 47668. [2023-12-02 16:54:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47668 states, 47623 states have (on average 4.3054826449404695) internal successors, (205040), 47667 states have internal predecessors, (205040), 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 16:54:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47668 states to 47668 states and 205040 transitions. [2023-12-02 16:54:25,498 INFO L78 Accepts]: Start accepts. Automaton has 47668 states and 205040 transitions. Word has length 42 [2023-12-02 16:54:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:25,498 INFO L495 AbstractCegarLoop]: Abstraction has 47668 states and 205040 transitions. [2023-12-02 16:54:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 16:54:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47668 states and 205040 transitions. [2023-12-02 16:54:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 16:54:25,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:25,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:25,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 16:54:25,503 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:25,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash 850010112, now seen corresponding path program 1 times [2023-12-02 16:54:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667491608] [2023-12-02 16:54:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:25,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667491608] [2023-12-02 16:54:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667491608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:25,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:54:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139535793] [2023-12-02 16:54:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:25,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:54:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:25,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:54:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:25,586 INFO L87 Difference]: Start difference. First operand 47668 states and 205040 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 16:54:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:26,362 INFO L93 Difference]: Finished difference Result 55428 states and 228524 transitions. [2023-12-02 16:54:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:54:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2023-12-02 16:54:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:26,621 INFO L225 Difference]: With dead ends: 55428 [2023-12-02 16:54:26,621 INFO L226 Difference]: Without dead ends: 55428 [2023-12-02 16:54:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:26,622 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 141 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55428 states. [2023-12-02 16:54:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55428 to 31810. [2023-12-02 16:54:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31810 states, 31766 states have (on average 4.139803563558521) internal successors, (131505), 31809 states have internal predecessors, (131505), 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 16:54:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31810 states to 31810 states and 131505 transitions. [2023-12-02 16:54:27,708 INFO L78 Accepts]: Start accepts. Automaton has 31810 states and 131505 transitions. Word has length 43 [2023-12-02 16:54:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:27,709 INFO L495 AbstractCegarLoop]: Abstraction has 31810 states and 131505 transitions. [2023-12-02 16:54:27,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 16:54:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 31810 states and 131505 transitions. [2023-12-02 16:54:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 16:54:27,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:27,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:27,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-02 16:54:27,713 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:27,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 6324991, now seen corresponding path program 1 times [2023-12-02 16:54:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590693430] [2023-12-02 16:54:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:27,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590693430] [2023-12-02 16:54:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590693430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:27,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 16:54:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898061255] [2023-12-02 16:54:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:27,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:54:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:54:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:54:27,847 INFO L87 Difference]: Start difference. First operand 31810 states and 131505 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 16:54:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:28,774 INFO L93 Difference]: Finished difference Result 59494 states and 245727 transitions. [2023-12-02 16:54:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 16:54:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2023-12-02 16:54:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:29,078 INFO L225 Difference]: With dead ends: 59494 [2023-12-02 16:54:29,078 INFO L226 Difference]: Without dead ends: 59350 [2023-12-02 16:54:29,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-12-02 16:54:29,079 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 110 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:29,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 118 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59350 states. [2023-12-02 16:54:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59350 to 51590. [2023-12-02 16:54:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51590 states, 51546 states have (on average 4.303689908043301) internal successors, (221838), 51589 states have internal predecessors, (221838), 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 16:54:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51590 states to 51590 states and 221838 transitions. [2023-12-02 16:54:30,971 INFO L78 Accepts]: Start accepts. Automaton has 51590 states and 221838 transitions. Word has length 43 [2023-12-02 16:54:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:30,971 INFO L495 AbstractCegarLoop]: Abstraction has 51590 states and 221838 transitions. [2023-12-02 16:54:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 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 16:54:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 51590 states and 221838 transitions. [2023-12-02 16:54:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 16:54:30,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:30,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:30,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-02 16:54:30,979 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:30,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 580508660, now seen corresponding path program 1 times [2023-12-02 16:54:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361040496] [2023-12-02 16:54:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:31,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361040496] [2023-12-02 16:54:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361040496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 16:54:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224447242] [2023-12-02 16:54:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 16:54:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 16:54:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:54:31,134 INFO L87 Difference]: Start difference. First operand 51590 states and 221838 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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 16:54:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:31,669 INFO L93 Difference]: Finished difference Result 53011 states and 225618 transitions. [2023-12-02 16:54:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:54:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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 44 [2023-12-02 16:54:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:31,905 INFO L225 Difference]: With dead ends: 53011 [2023-12-02 16:54:31,905 INFO L226 Difference]: Without dead ends: 53011 [2023-12-02 16:54:31,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-02 16:54:31,905 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:31,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53011 states. [2023-12-02 16:54:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53011 to 51592. [2023-12-02 16:54:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51592 states, 51548 states have (on average 4.303561728874059) internal successors, (221840), 51591 states have internal predecessors, (221840), 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 16:54:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51592 states to 51592 states and 221840 transitions. [2023-12-02 16:54:33,759 INFO L78 Accepts]: Start accepts. Automaton has 51592 states and 221840 transitions. Word has length 44 [2023-12-02 16:54:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:33,759 INFO L495 AbstractCegarLoop]: Abstraction has 51592 states and 221840 transitions. [2023-12-02 16:54:33,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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 16:54:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 51592 states and 221840 transitions. [2023-12-02 16:54:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 16:54:33,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:33,769 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-02 16:54:33,769 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:33,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 813238738, now seen corresponding path program 2 times [2023-12-02 16:54:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184880840] [2023-12-02 16:54:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 16:54:33,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184880840] [2023-12-02 16:54:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184880840] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72430312] [2023-12-02 16:54:33,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:54:33,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:33,942 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:33,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 16:54:34,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 16:54:34,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:54:34,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:54:34,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-02 16:54:34,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-02 16:54:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72430312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [510996693] [2023-12-02 16:54:34,207 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 16:54:34,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 2, 2] total 9 [2023-12-02 16:54:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910374182] [2023-12-02 16:54:34,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:34,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 16:54:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 16:54:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-02 16:54:34,209 INFO L87 Difference]: Start difference. First operand 51592 states and 221840 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 16:54:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:35,316 INFO L93 Difference]: Finished difference Result 52196 states and 220731 transitions. [2023-12-02 16:54:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:54:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 45 [2023-12-02 16:54:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:35,530 INFO L225 Difference]: With dead ends: 52196 [2023-12-02 16:54:35,531 INFO L226 Difference]: Without dead ends: 52196 [2023-12-02 16:54:35,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-12-02 16:54:35,531 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 276 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:35,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 229 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 16:54:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52196 states. [2023-12-02 16:54:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52196 to 24148. [2023-12-02 16:54:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24148 states, 24125 states have (on average 4.134466321243523) internal successors, (99744), 24147 states have internal predecessors, (99744), 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 16:54:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24148 states to 24148 states and 99744 transitions. [2023-12-02 16:54:36,581 INFO L78 Accepts]: Start accepts. Automaton has 24148 states and 99744 transitions. Word has length 45 [2023-12-02 16:54:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:36,582 INFO L495 AbstractCegarLoop]: Abstraction has 24148 states and 99744 transitions. [2023-12-02 16:54:36,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 16:54:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24148 states and 99744 transitions. [2023-12-02 16:54:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 16:54:36,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:36,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:36,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 16:54:36,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-02 16:54:36,789 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:36,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash -298539901, now seen corresponding path program 1 times [2023-12-02 16:54:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388438321] [2023-12-02 16:54:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:36,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388438321] [2023-12-02 16:54:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388438321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 16:54:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671389926] [2023-12-02 16:54:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:36,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:54:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:36,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:54:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:36,924 INFO L87 Difference]: Start difference. First operand 24148 states and 99744 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 16:54:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:37,258 INFO L93 Difference]: Finished difference Result 26272 states and 105496 transitions. [2023-12-02 16:54:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:54:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2023-12-02 16:54:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:37,342 INFO L225 Difference]: With dead ends: 26272 [2023-12-02 16:54:37,342 INFO L226 Difference]: Without dead ends: 26272 [2023-12-02 16:54:37,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:54:37,343 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:37,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 138 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26272 states. [2023-12-02 16:54:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26272 to 24144. [2023-12-02 16:54:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24144 states, 24121 states have (on average 4.134820281082874) internal successors, (99736), 24143 states have internal predecessors, (99736), 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 16:54:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24144 states to 24144 states and 99736 transitions. [2023-12-02 16:54:38,101 INFO L78 Accepts]: Start accepts. Automaton has 24144 states and 99736 transitions. Word has length 45 [2023-12-02 16:54:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:38,101 INFO L495 AbstractCegarLoop]: Abstraction has 24144 states and 99736 transitions. [2023-12-02 16:54:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 16:54:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24144 states and 99736 transitions. [2023-12-02 16:54:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 16:54:38,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:38,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:38,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-02 16:54:38,108 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:38,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash -474892106, now seen corresponding path program 1 times [2023-12-02 16:54:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994398362] [2023-12-02 16:54:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:38,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994398362] [2023-12-02 16:54:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994398362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:54:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020878317] [2023-12-02 16:54:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:54:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:54:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:38,235 INFO L87 Difference]: Start difference. First operand 24144 states and 99736 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 16:54:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:38,551 INFO L93 Difference]: Finished difference Result 25212 states and 102527 transitions. [2023-12-02 16:54:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:54:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2023-12-02 16:54:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:38,641 INFO L225 Difference]: With dead ends: 25212 [2023-12-02 16:54:38,641 INFO L226 Difference]: Without dead ends: 25070 [2023-12-02 16:54:38,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:38,642 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:38,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 114 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:54:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25070 states. [2023-12-02 16:54:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25070 to 20084. [2023-12-02 16:54:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20061 states have (on average 4.114301380788595) internal successors, (82537), 20083 states have internal predecessors, (82537), 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 16:54:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 82537 transitions. [2023-12-02 16:54:39,366 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 82537 transitions. Word has length 46 [2023-12-02 16:54:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:39,367 INFO L495 AbstractCegarLoop]: Abstraction has 20084 states and 82537 transitions. [2023-12-02 16:54:39,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 16:54:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 82537 transitions. [2023-12-02 16:54:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 16:54:39,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:39,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:39,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-02 16:54:39,376 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:39,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1843562034, now seen corresponding path program 1 times [2023-12-02 16:54:39,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:39,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647054906] [2023-12-02 16:54:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 16:54:39,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647054906] [2023-12-02 16:54:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647054906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:54:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:54:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 16:54:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376702260] [2023-12-02 16:54:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:54:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 16:54:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 16:54:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:54:39,546 INFO L87 Difference]: Start difference. First operand 20084 states and 82537 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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 16:54:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:54:39,809 INFO L93 Difference]: Finished difference Result 20083 states and 82536 transitions. [2023-12-02 16:54:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 16:54:39,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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 47 [2023-12-02 16:54:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:54:39,886 INFO L225 Difference]: With dead ends: 20083 [2023-12-02 16:54:39,886 INFO L226 Difference]: Without dead ends: 19931 [2023-12-02 16:54:39,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:54:39,886 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:54:39,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 67 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:54:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19931 states. [2023-12-02 16:54:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19931 to 17999. [2023-12-02 16:54:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17999 states, 17977 states have (on average 4.175835790176336) internal successors, (75069), 17998 states have internal predecessors, (75069), 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 16:54:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17999 states to 17999 states and 75069 transitions. [2023-12-02 16:54:40,426 INFO L78 Accepts]: Start accepts. Automaton has 17999 states and 75069 transitions. Word has length 47 [2023-12-02 16:54:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:54:40,426 INFO L495 AbstractCegarLoop]: Abstraction has 17999 states and 75069 transitions. [2023-12-02 16:54:40,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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 16:54:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17999 states and 75069 transitions. [2023-12-02 16:54:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:54:40,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:54:40,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:54:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-02 16:54:40,435 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:54:40,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:54:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 826488288, now seen corresponding path program 2 times [2023-12-02 16:54:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:54:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742885728] [2023-12-02 16:54:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:54:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:54:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:54:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:54:41,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:54:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742885728] [2023-12-02 16:54:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742885728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:54:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411808337] [2023-12-02 16:54:41,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:54:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:54:41,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:54:41,923 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:54:41,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 16:54:42,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 16:54:42,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:54:42,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 16:54:42,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:54:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:54:42,730 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 23 treesize of output 1 [2023-12-02 16:54:42,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:54:42,934 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 11 treesize of output 11 [2023-12-02 16:54:43,001 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 23 treesize of output 18 [2023-12-02 16:54:43,033 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 23 treesize of output 18 [2023-12-02 16:54:43,071 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 23 treesize of output 18 [2023-12-02 16:54:43,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:43,228 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 23 treesize of output 18 [2023-12-02 16:54:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:54:43,379 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 23 treesize of output 18 [2023-12-02 16:54:43,503 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 23 treesize of output 18 [2023-12-02 16:54:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:54:43,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:54:44,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:54:44,873 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 35 treesize of output 36 [2023-12-02 16:54:44,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:54:44,883 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 174 treesize of output 167 [2023-12-02 16:54:44,894 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 152 treesize of output 128 [2023-12-02 16:54:44,902 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 66 treesize of output 60 [2023-12-02 16:54:44,908 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 122 treesize of output 110 [2023-12-02 16:54:45,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:54:45,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 67 [2023-12-02 16:54:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:54:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411808337] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:54:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224282154] [2023-12-02 16:54:46,111 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 16:54:46,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:54:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 60 [2023-12-02 16:54:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875322280] [2023-12-02 16:54:46,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:54:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-02 16:54:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:54:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-02 16:54:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3511, Unknown=13, NotChecked=0, Total=3782 [2023-12-02 16:54:46,115 INFO L87 Difference]: Start difference. First operand 17999 states and 75069 transitions. Second operand has 62 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 61 states have internal predecessors, (120), 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 16:55:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:02,736 INFO L93 Difference]: Finished difference Result 71275 states and 291665 transitions. [2023-12-02 16:55:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-02 16:55:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 61 states have internal predecessors, (120), 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 48 [2023-12-02 16:55:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:03,041 INFO L225 Difference]: With dead ends: 71275 [2023-12-02 16:55:03,041 INFO L226 Difference]: Without dead ends: 71275 [2023-12-02 16:55:03,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3117 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2180, Invalid=13049, Unknown=23, NotChecked=0, Total=15252 [2023-12-02 16:55:03,045 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1971 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 5299 mSolverCounterSat, 431 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 5814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 5299 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:03,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 2502 Invalid, 5814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 5299 Invalid, 84 Unknown, 0 Unchecked, 6.7s Time] [2023-12-02 16:55:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71275 states. [2023-12-02 16:55:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71275 to 28107. [2023-12-02 16:55:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28107 states, 28085 states have (on average 4.560655153996795) internal successors, (128086), 28106 states have internal predecessors, (128086), 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 16:55:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28107 states to 28107 states and 128086 transitions. [2023-12-02 16:55:04,235 INFO L78 Accepts]: Start accepts. Automaton has 28107 states and 128086 transitions. Word has length 48 [2023-12-02 16:55:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:04,235 INFO L495 AbstractCegarLoop]: Abstraction has 28107 states and 128086 transitions. [2023-12-02 16:55:04,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 61 states have internal predecessors, (120), 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 16:55:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28107 states and 128086 transitions. [2023-12-02 16:55:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:55:04,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:04,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:04,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 16:55:04,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-12-02 16:55:04,443 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:04,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 826488289, now seen corresponding path program 1 times [2023-12-02 16:55:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:04,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149296735] [2023-12-02 16:55:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:55:05,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149296735] [2023-12-02 16:55:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149296735] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946528763] [2023-12-02 16:55:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:05,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:05,511 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:05,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 16:55:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:05,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 16:55:05,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:05,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:55:06,117 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 15 treesize of output 1 [2023-12-02 16:55:06,211 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:55:06,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 11 treesize of output 11 [2023-12-02 16:55:06,265 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 16 treesize of output 11 [2023-12-02 16:55:06,301 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 16 treesize of output 11 [2023-12-02 16:55:06,332 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 16 treesize of output 11 [2023-12-02 16:55:06,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:06,465 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 16 treesize of output 11 [2023-12-02 16:55:06,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:06,521 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 16 treesize of output 11 [2023-12-02 16:55:06,548 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 16 treesize of output 11 [2023-12-02 16:55:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 16:55:06,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:07,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:07,173 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 30 treesize of output 31 [2023-12-02 16:55:07,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:07,183 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 1105 treesize of output 1057 [2023-12-02 16:55:07,197 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 59 treesize of output 55 [2023-12-02 16:55:07,204 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 55 treesize of output 47 [2023-12-02 16:55:07,211 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 62 treesize of output 46 [2023-12-02 16:55:07,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:07,679 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 29 treesize of output 34 [2023-12-02 16:55:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:55:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946528763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:55:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877347921] [2023-12-02 16:55:07,774 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 16:55:07,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 50 [2023-12-02 16:55:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159797842] [2023-12-02 16:55:07,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 16:55:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 16:55:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2425, Unknown=45, NotChecked=0, Total=2652 [2023-12-02 16:55:07,776 INFO L87 Difference]: Start difference. First operand 28107 states and 128086 transitions. Second operand has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 states have internal predecessors, (114), 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 16:55:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:11,424 INFO L93 Difference]: Finished difference Result 40524 states and 173398 transitions. [2023-12-02 16:55:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 16:55:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 states have internal predecessors, (114), 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 48 [2023-12-02 16:55:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:11,582 INFO L225 Difference]: With dead ends: 40524 [2023-12-02 16:55:11,582 INFO L226 Difference]: Without dead ends: 40524 [2023-12-02 16:55:11,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=519, Invalid=4984, Unknown=47, NotChecked=0, Total=5550 [2023-12-02 16:55:11,583 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 431 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 4248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:11,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1818 Invalid, 4248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4183 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 16:55:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40524 states. [2023-12-02 16:55:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40524 to 28107. [2023-12-02 16:55:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28107 states, 28085 states have (on average 4.559729392914367) internal successors, (128060), 28106 states have internal predecessors, (128060), 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 16:55:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28107 states to 28107 states and 128060 transitions. [2023-12-02 16:55:12,525 INFO L78 Accepts]: Start accepts. Automaton has 28107 states and 128060 transitions. Word has length 48 [2023-12-02 16:55:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:12,525 INFO L495 AbstractCegarLoop]: Abstraction has 28107 states and 128060 transitions. [2023-12-02 16:55:12,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 states have internal predecessors, (114), 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 16:55:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28107 states and 128060 transitions. [2023-12-02 16:55:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:55:12,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:12,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:12,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 16:55:12,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:12,735 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:12,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash 826488291, now seen corresponding path program 1 times [2023-12-02 16:55:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921225202] [2023-12-02 16:55:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:55:14,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921225202] [2023-12-02 16:55:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921225202] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771927185] [2023-12-02 16:55:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:14,417 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:14,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 16:55:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:14,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 16:55:14,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:14,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,660 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:55:14,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 16:55:14,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,694 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-02 16:55:14,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 16:55:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:14,732 INFO L349 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2023-12-02 16:55:14,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2023-12-02 16:55:15,174 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 15 treesize of output 1 [2023-12-02 16:55:15,339 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-12-02 16:55:15,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 56 [2023-12-02 16:55:15,493 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 18 treesize of output 13 [2023-12-02 16:55:15,618 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 18 treesize of output 13 [2023-12-02 16:55:15,727 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 18 treesize of output 13 [2023-12-02 16:55:16,009 INFO L349 Elim1Store]: treesize reduction 12, result has 85.2 percent of original size [2023-12-02 16:55:16,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 111 [2023-12-02 16:55:16,500 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 18 treesize of output 13 [2023-12-02 16:55:16,569 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 18 treesize of output 13 [2023-12-02 16:55:16,617 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 18 treesize of output 13 [2023-12-02 16:55:16,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:16,832 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 18 treesize of output 13 [2023-12-02 16:55:16,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:16,903 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 18 treesize of output 13 [2023-12-02 16:55:17,006 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 18 treesize of output 13 [2023-12-02 16:55:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:55:17,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:17,247 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2042 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_2042) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))))) is different from false [2023-12-02 16:55:17,254 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2042 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_2042) c_~A~0.base) (+ c_~A~0.offset 8))))) is different from false [2023-12-02 16:55:17,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:17,862 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 35 treesize of output 36 [2023-12-02 16:55:17,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:17,873 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 2451 treesize of output 2403 [2023-12-02 16:55:17,895 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 143 treesize of output 139 [2023-12-02 16:55:17,907 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 286 treesize of output 254 [2023-12-02 16:55:17,918 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 254 treesize of output 238 [2023-12-02 16:55:17,932 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 122 treesize of output 114 [2023-12-02 16:55:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2023-12-02 16:55:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771927185] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:55:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282857335] [2023-12-02 16:55:18,889 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 16:55:18,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:18,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 50 [2023-12-02 16:55:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681236490] [2023-12-02 16:55:18,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:18,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 16:55:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 16:55:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2276, Unknown=35, NotChecked=194, Total=2652 [2023-12-02 16:55:18,891 INFO L87 Difference]: Start difference. First operand 28107 states and 128060 transitions. Second operand has 52 states, 51 states have (on average 2.2941176470588234) internal successors, (117), 51 states have internal predecessors, (117), 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 16:55:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:24,576 INFO L93 Difference]: Finished difference Result 28697 states and 129532 transitions. [2023-12-02 16:55:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 16:55:24,577 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.2941176470588234) internal successors, (117), 51 states have internal predecessors, (117), 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 48 [2023-12-02 16:55:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:24,708 INFO L225 Difference]: With dead ends: 28697 [2023-12-02 16:55:24,708 INFO L226 Difference]: Without dead ends: 28697 [2023-12-02 16:55:24,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=417, Invalid=4668, Unknown=35, NotChecked=282, Total=5402 [2023-12-02 16:55:24,709 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 482 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 4042 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 4678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:24,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1674 Invalid, 4678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4042 Invalid, 0 Unknown, 556 Unchecked, 3.3s Time] [2023-12-02 16:55:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28697 states. [2023-12-02 16:55:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28697 to 28107. [2023-12-02 16:55:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28107 states, 28085 states have (on average 4.558803631831939) internal successors, (128034), 28106 states have internal predecessors, (128034), 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 16:55:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28107 states to 28107 states and 128034 transitions. [2023-12-02 16:55:25,634 INFO L78 Accepts]: Start accepts. Automaton has 28107 states and 128034 transitions. Word has length 48 [2023-12-02 16:55:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:25,634 INFO L495 AbstractCegarLoop]: Abstraction has 28107 states and 128034 transitions. [2023-12-02 16:55:25,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.2941176470588234) internal successors, (117), 51 states have internal predecessors, (117), 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 16:55:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28107 states and 128034 transitions. [2023-12-02 16:55:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:55:25,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:25,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:25,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 16:55:25,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:25,843 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:25,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 826488292, now seen corresponding path program 1 times [2023-12-02 16:55:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172042693] [2023-12-02 16:55:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:55:27,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172042693] [2023-12-02 16:55:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172042693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660859960] [2023-12-02 16:55:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:27,304 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:27,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 16:55:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:27,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 16:55:27,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:27,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:55:27,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:55:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:55:27,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:55:27,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:55:27,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:55:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:55:27,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:27,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:55:27,816 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 15 treesize of output 1 [2023-12-02 16:55:27,903 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:55:27,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 16:55:27,975 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 16 treesize of output 11 [2023-12-02 16:55:28,022 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 16 treesize of output 11 [2023-12-02 16:55:28,067 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 16 treesize of output 11 [2023-12-02 16:55:28,131 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 16:55:28,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 16:55:28,174 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 16 treesize of output 11 [2023-12-02 16:55:28,204 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 16 treesize of output 11 [2023-12-02 16:55:28,229 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 16 treesize of output 11 [2023-12-02 16:55:28,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:28,359 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 16 treesize of output 11 [2023-12-02 16:55:28,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:28,410 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 16 treesize of output 11 [2023-12-02 16:55:28,493 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 16 treesize of output 11 [2023-12-02 16:55:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:55:28,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:28,694 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 (Array Int Int))) (< (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_2130) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) 2147483648)) is different from false [2023-12-02 16:55:28,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2129) c_~C~0.base v_ArrVal_2130) c_~A~0.base) (+ c_~A~0.offset 8)) 2147483648)) is different from false [2023-12-02 16:55:28,839 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2129 (Array Int Int)) (v_ArrVal_2128 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_2130) c_~A~0.base) (+ c_~A~0.offset 8)) 2147483648)) is different from false [2023-12-02 16:55:29,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:29,130 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 33 treesize of output 34 [2023-12-02 16:55:29,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:29,139 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 1097 treesize of output 1073 [2023-12-02 16:55:29,153 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 258 treesize of output 226 [2023-12-02 16:55:29,162 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 111 treesize of output 107 [2023-12-02 16:55:29,169 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 222 treesize of output 206 [2023-12-02 16:55:29,178 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 106 treesize of output 98 [2023-12-02 16:55:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 12 refuted. 7 times theorem prover too weak. 17 trivial. 2 not checked. [2023-12-02 16:55:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660859960] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:55:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874977438] [2023-12-02 16:55:30,043 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 16:55:30,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 48 [2023-12-02 16:55:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766108773] [2023-12-02 16:55:30,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:30,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 16:55:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 16:55:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2004, Unknown=28, NotChecked=276, Total=2450 [2023-12-02 16:55:30,045 INFO L87 Difference]: Start difference. First operand 28107 states and 128034 transitions. Second operand has 50 states, 49 states have (on average 2.306122448979592) internal successors, (113), 49 states have internal predecessors, (113), 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 16:55:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:34,994 INFO L93 Difference]: Finished difference Result 28700 states and 129513 transitions. [2023-12-02 16:55:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 16:55:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.306122448979592) internal successors, (113), 49 states have internal predecessors, (113), 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 48 [2023-12-02 16:55:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:35,125 INFO L225 Difference]: With dead ends: 28700 [2023-12-02 16:55:35,125 INFO L226 Difference]: Without dead ends: 28700 [2023-12-02 16:55:35,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=429, Invalid=4385, Unknown=28, NotChecked=414, Total=5256 [2023-12-02 16:55:35,127 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 519 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 4430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 833 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:35,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1475 Invalid, 4430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3522 Invalid, 0 Unknown, 833 Unchecked, 2.8s Time] [2023-12-02 16:55:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28700 states. [2023-12-02 16:55:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28700 to 28107. [2023-12-02 16:55:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28107 states, 28085 states have (on average 4.55787787074951) internal successors, (128008), 28106 states have internal predecessors, (128008), 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 16:55:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28107 states to 28107 states and 128008 transitions. [2023-12-02 16:55:36,258 INFO L78 Accepts]: Start accepts. Automaton has 28107 states and 128008 transitions. Word has length 48 [2023-12-02 16:55:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:36,258 INFO L495 AbstractCegarLoop]: Abstraction has 28107 states and 128008 transitions. [2023-12-02 16:55:36,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.306122448979592) internal successors, (113), 49 states have internal predecessors, (113), 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 16:55:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28107 states and 128008 transitions. [2023-12-02 16:55:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 16:55:36,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:36,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:36,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 16:55:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:36,469 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:36,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash -572552575, now seen corresponding path program 2 times [2023-12-02 16:55:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:36,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506411496] [2023-12-02 16:55:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:55:36,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506411496] [2023-12-02 16:55:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506411496] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60189728] [2023-12-02 16:55:36,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:55:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:36,560 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:36,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 16:55:36,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 16:55:36,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:55:36,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 16:55:36,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:55:36,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:55:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60189728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:55:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:55:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 16:55:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283788011] [2023-12-02 16:55:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:55:36,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:55:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:55:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 16:55:36,807 INFO L87 Difference]: Start difference. First operand 28107 states and 128008 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 16:55:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:37,298 INFO L93 Difference]: Finished difference Result 28931 states and 129460 transitions. [2023-12-02 16:55:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:55:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 48 [2023-12-02 16:55:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:37,429 INFO L225 Difference]: With dead ends: 28931 [2023-12-02 16:55:37,429 INFO L226 Difference]: Without dead ends: 28931 [2023-12-02 16:55:37,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 16:55:37,430 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:37,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 160 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 16:55:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28931 states. [2023-12-02 16:55:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28931 to 27529. [2023-12-02 16:55:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27514 states have (on average 4.5335465581158685) internal successors, (124736), 27528 states have internal predecessors, (124736), 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 16:55:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 124736 transitions. [2023-12-02 16:55:38,496 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 124736 transitions. Word has length 48 [2023-12-02 16:55:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:38,497 INFO L495 AbstractCegarLoop]: Abstraction has 27529 states and 124736 transitions. [2023-12-02 16:55:38,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 16:55:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 124736 transitions. [2023-12-02 16:55:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:55:38,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:38,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:38,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 16:55:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:38,705 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:38,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash -148668182, now seen corresponding path program 1 times [2023-12-02 16:55:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694936163] [2023-12-02 16:55:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:55:40,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694936163] [2023-12-02 16:55:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694936163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172103462] [2023-12-02 16:55:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:40,140 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:40,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 16:55:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:40,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 16:55:40,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:40,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 16:55:40,371 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:55:40,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 13 [2023-12-02 16:55:40,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,394 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 16:55:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-02 16:55:40,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,419 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:55:40,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-12-02 16:55:40,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:55:40,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,445 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 16:55:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 1 [2023-12-02 16:55:40,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:55:40,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,472 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-02 16:55:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 43 treesize of output 30 [2023-12-02 16:55:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:40,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:55:40,775 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:55:40,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-12-02 16:55:41,181 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 16:55:41,310 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-12-02 16:55:41,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2023-12-02 16:55:41,387 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 18 treesize of output 13 [2023-12-02 16:55:41,449 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 18 treesize of output 13 [2023-12-02 16:55:41,500 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 18 treesize of output 13 [2023-12-02 16:55:41,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:41,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:55:41,776 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 18 treesize of output 13 [2023-12-02 16:55:41,891 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 18 treesize of output 13 [2023-12-02 16:55:42,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:42,047 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 18 treesize of output 13 [2023-12-02 16:55:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 16:55:42,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:42,121 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2279 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2279) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:55:42,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2279 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2279) c_~B~0.base) (+ 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:55:42,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:42,795 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 35 treesize of output 36 [2023-12-02 16:55:42,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:42,804 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 1227 treesize of output 1203 [2023-12-02 16:55:42,817 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 290 treesize of output 258 [2023-12-02 16:55:42,825 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 127 treesize of output 123 [2023-12-02 16:55:42,833 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 123 treesize of output 115 [2023-12-02 16:55:42,841 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 130 treesize of output 114 [2023-12-02 16:55:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2023-12-02 16:55:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172103462] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:55:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [654739183] [2023-12-02 16:55:43,928 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 16:55:43,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 16] total 57 [2023-12-02 16:55:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852025404] [2023-12-02 16:55:43,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:43,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-12-02 16:55:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-12-02 16:55:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2943, Unknown=53, NotChecked=222, Total=3422 [2023-12-02 16:55:43,930 INFO L87 Difference]: Start difference. First operand 27529 states and 124736 transitions. Second operand has 59 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 58 states have internal predecessors, (123), 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 16:55:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:55:48,501 INFO L93 Difference]: Finished difference Result 35072 states and 149901 transitions. [2023-12-02 16:55:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 16:55:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 58 states have internal predecessors, (123), 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 49 [2023-12-02 16:55:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:55:48,630 INFO L225 Difference]: With dead ends: 35072 [2023-12-02 16:55:48,630 INFO L226 Difference]: Without dead ends: 35072 [2023-12-02 16:55:48,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=546, Invalid=5570, Unknown=54, NotChecked=310, Total=6480 [2023-12-02 16:55:48,631 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 948 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 4848 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 5655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 4848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:55:48,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 2611 Invalid, 5655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 4848 Invalid, 0 Unknown, 689 Unchecked, 2.9s Time] [2023-12-02 16:55:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35072 states. [2023-12-02 16:55:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35072 to 27529. [2023-12-02 16:55:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27514 states have (on average 4.489387221051102) internal successors, (123521), 27528 states have internal predecessors, (123521), 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 16:55:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 123521 transitions. [2023-12-02 16:55:49,594 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 123521 transitions. Word has length 49 [2023-12-02 16:55:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:55:49,594 INFO L495 AbstractCegarLoop]: Abstraction has 27529 states and 123521 transitions. [2023-12-02 16:55:49,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 58 states have internal predecessors, (123), 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 16:55:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 123521 transitions. [2023-12-02 16:55:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:55:49,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:55:49,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:55:49,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 16:55:49,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:49,801 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:55:49,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:55:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -148668181, now seen corresponding path program 1 times [2023-12-02 16:55:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:55:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349463453] [2023-12-02 16:55:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:55:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:55:51,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:55:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349463453] [2023-12-02 16:55:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349463453] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:55:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812081555] [2023-12-02 16:55:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:55:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:55:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:55:51,418 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:55:51,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-12-02 16:55:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:55:51,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 16:55:51,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:55:51,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 16:55:52,156 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 15 treesize of output 1 [2023-12-02 16:55:52,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:55:52,253 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 11 treesize of output 11 [2023-12-02 16:55:52,316 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 16 treesize of output 11 [2023-12-02 16:55:52,352 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 16 treesize of output 11 [2023-12-02 16:55:52,383 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 16 treesize of output 11 [2023-12-02 16:55:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:52,538 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 16 treesize of output 11 [2023-12-02 16:55:52,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:52,610 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 16 treesize of output 11 [2023-12-02 16:55:52,740 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 16 treesize of output 11 [2023-12-02 16:55:52,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:55:52,921 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 16 treesize of output 11 [2023-12-02 16:55:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 16:55:52,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:55:53,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2365 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2365) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 16:55:53,028 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2365 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2365) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 4 c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 16:55:53,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:53,830 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 33 treesize of output 34 [2023-12-02 16:55:53,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:53,838 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 275 treesize of output 269 [2023-12-02 16:55:53,850 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 258 treesize of output 250 [2023-12-02 16:55:53,856 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 250 treesize of output 218 [2023-12-02 16:55:53,865 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 110 treesize of output 106 [2023-12-02 16:55:53,872 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 214 treesize of output 198 [2023-12-02 16:55:54,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:55:54,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-12-02 16:55:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2023-12-02 16:55:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812081555] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:55:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082214134] [2023-12-02 16:55:54,969 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 16:55:54,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:55:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 16] total 59 [2023-12-02 16:55:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299656155] [2023-12-02 16:55:54,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:55:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-12-02 16:55:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:55:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-12-02 16:55:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3183, Unknown=60, NotChecked=230, Total=3660 [2023-12-02 16:55:54,972 INFO L87 Difference]: Start difference. First operand 27529 states and 123521 transitions. Second operand has 61 states, 60 states have (on average 2.05) internal successors, (123), 60 states have internal predecessors, (123), 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 16:56:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:07,366 INFO L93 Difference]: Finished difference Result 49312 states and 206763 transitions. [2023-12-02 16:56:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-02 16:56:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.05) internal successors, (123), 60 states have internal predecessors, (123), 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 49 [2023-12-02 16:56:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:07,556 INFO L225 Difference]: With dead ends: 49312 [2023-12-02 16:56:07,556 INFO L226 Difference]: Without dead ends: 49312 [2023-12-02 16:56:07,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3505 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1464, Invalid=14485, Unknown=61, NotChecked=502, Total=16512 [2023-12-02 16:56:07,558 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2366 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 8327 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 10431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 8327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1711 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:07,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 4020 Invalid, 10431 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 8327 Invalid, 0 Unknown, 1711 Unchecked, 5.5s Time] [2023-12-02 16:56:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49312 states. [2023-12-02 16:56:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49312 to 27529. [2023-12-02 16:56:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27514 states have (on average 4.445700370720361) internal successors, (122319), 27528 states have internal predecessors, (122319), 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 16:56:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 122319 transitions. [2023-12-02 16:56:08,625 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 122319 transitions. Word has length 49 [2023-12-02 16:56:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:08,625 INFO L495 AbstractCegarLoop]: Abstraction has 27529 states and 122319 transitions. [2023-12-02 16:56:08,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.05) internal successors, (123), 60 states have internal predecessors, (123), 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 16:56:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 122319 transitions. [2023-12-02 16:56:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:56:08,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:08,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:08,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-12-02 16:56:08,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:08,833 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:08,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -148668179, now seen corresponding path program 1 times [2023-12-02 16:56:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083047304] [2023-12-02 16:56:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:56:10,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083047304] [2023-12-02 16:56:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083047304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802195688] [2023-12-02 16:56:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:10,310 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:10,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 16:56:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:10,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 16:56:10,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:10,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,571 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 16:56:10,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 16:56:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,612 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-12-02 16:56:10,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 16:56:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:10,645 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-02 16:56:10,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 18 [2023-12-02 16:56:11,065 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 15 treesize of output 1 [2023-12-02 16:56:11,224 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-12-02 16:56:11,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 54 [2023-12-02 16:56:11,352 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 18 treesize of output 13 [2023-12-02 16:56:11,472 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 18 treesize of output 13 [2023-12-02 16:56:11,587 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 18 treesize of output 13 [2023-12-02 16:56:11,857 INFO L349 Elim1Store]: treesize reduction 12, result has 85.2 percent of original size [2023-12-02 16:56:11,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 109 [2023-12-02 16:56:12,380 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 18 treesize of output 13 [2023-12-02 16:56:12,449 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 18 treesize of output 13 [2023-12-02 16:56:12,505 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 18 treesize of output 13 [2023-12-02 16:56:12,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:12,709 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 18 treesize of output 13 [2023-12-02 16:56:12,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:12,787 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 18 treesize of output 13 [2023-12-02 16:56:12,896 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 18 treesize of output 13 [2023-12-02 16:56:13,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:13,049 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 18 treesize of output 13 [2023-12-02 16:56:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:56:13,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:13,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2457 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2457) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 4))))) is different from false [2023-12-02 16:56:13,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2457 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2457) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4)))))) is different from false [2023-12-02 16:56:16,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:56:16,171 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 38 treesize of output 39 [2023-12-02 16:56:16,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:56:16,185 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 9763 treesize of output 9667 [2023-12-02 16:56:16,229 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 295 treesize of output 279 [2023-12-02 16:56:16,243 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 279 treesize of output 271 [2023-12-02 16:56:16,255 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 570 treesize of output 506 [2023-12-02 16:56:16,269 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 239 treesize of output 235 [2023-12-02 16:56:16,291 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 266 treesize of output 234 [2023-12-02 16:56:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:56:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802195688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:56:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852262283] [2023-12-02 16:56:17,621 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 16:56:17,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:56:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 53 [2023-12-02 16:56:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733275099] [2023-12-02 16:56:17,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:56:17,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-02 16:56:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-02 16:56:17,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2552, Unknown=47, NotChecked=206, Total=2970 [2023-12-02 16:56:17,623 INFO L87 Difference]: Start difference. First operand 27529 states and 122319 transitions. Second operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 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 16:56:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:26,404 INFO L93 Difference]: Finished difference Result 54241 states and 223158 transitions. [2023-12-02 16:56:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 16:56:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 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 49 [2023-12-02 16:56:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:26,622 INFO L225 Difference]: With dead ends: 54241 [2023-12-02 16:56:26,622 INFO L226 Difference]: Without dead ends: 54241 [2023-12-02 16:56:26,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=566, Invalid=5715, Unknown=47, NotChecked=314, Total=6642 [2023-12-02 16:56:26,624 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1796 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 6894 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 8350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 6894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1278 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:26,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 3622 Invalid, 8350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 6894 Invalid, 0 Unknown, 1278 Unchecked, 5.7s Time] [2023-12-02 16:56:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54241 states. [2023-12-02 16:56:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54241 to 27529. [2023-12-02 16:56:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27514 states have (on average 4.40201352038962) internal successors, (121117), 27528 states have internal predecessors, (121117), 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 16:56:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 121117 transitions. [2023-12-02 16:56:27,978 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 121117 transitions. Word has length 49 [2023-12-02 16:56:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:27,978 INFO L495 AbstractCegarLoop]: Abstraction has 27529 states and 121117 transitions. [2023-12-02 16:56:27,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 states have internal predecessors, (120), 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 16:56:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 121117 transitions. [2023-12-02 16:56:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:56:27,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:27,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:27,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 16:56:28,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-12-02 16:56:28,190 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:28,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -148668178, now seen corresponding path program 1 times [2023-12-02 16:56:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974783867] [2023-12-02 16:56:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 16:56:29,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974783867] [2023-12-02 16:56:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974783867] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:29,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722263319] [2023-12-02 16:56:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:29,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:29,524 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:29,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 16:56:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:29,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 16:56:29,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:29,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-12-02 16:56:29,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:56:29,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:56:29,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:56:29,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:56:29,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:56:30,228 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 15 treesize of output 1 [2023-12-02 16:56:30,324 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 16:56:30,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 16:56:30,400 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 16 treesize of output 11 [2023-12-02 16:56:30,449 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 16 treesize of output 11 [2023-12-02 16:56:30,517 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 16 treesize of output 11 [2023-12-02 16:56:30,590 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 16:56:30,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 16:56:30,651 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 16 treesize of output 11 [2023-12-02 16:56:30,689 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 16 treesize of output 11 [2023-12-02 16:56:30,734 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 16 treesize of output 11 [2023-12-02 16:56:30,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:30,899 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 16 treesize of output 11 [2023-12-02 16:56:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:30,967 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 16 treesize of output 11 [2023-12-02 16:56:31,082 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 16 treesize of output 11 [2023-12-02 16:56:31,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:31,226 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 16 treesize of output 11 [2023-12-02 16:56:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:56:31,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:31,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2549) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) 2147483648)) is different from false [2023-12-02 16:56:31,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2549) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 4)) 2147483648)) is different from false [2023-12-02 16:56:31,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2548 (Array Int Int))) (< (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_2548) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2549) c_~A~0.base) (+ c_~A~0.offset 8)) 2147483648)) is different from false [2023-12-02 16:56:32,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:56:32,150 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 36 treesize of output 37 [2023-12-02 16:56:32,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:56:32,175 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 34945 treesize of output 34561 [2023-12-02 16:56:32,232 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 263 treesize of output 259 [2023-12-02 16:56:32,250 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 526 treesize of output 510 [2023-12-02 16:56:32,262 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 510 treesize of output 446 [2023-12-02 16:56:32,274 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 446 treesize of output 414 [2023-12-02 16:56:32,288 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 210 treesize of output 202 [2023-12-02 16:56:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 13 refuted. 7 times theorem prover too weak. 17 trivial. 1 not checked. [2023-12-02 16:56:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722263319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:56:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255379321] [2023-12-02 16:56:33,491 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 16:56:33,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:56:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17] total 51 [2023-12-02 16:56:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107010646] [2023-12-02 16:56:33,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:56:33,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 16:56:33,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 16:56:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2272, Unknown=40, NotChecked=294, Total=2756 [2023-12-02 16:56:33,493 INFO L87 Difference]: Start difference. First operand 27529 states and 121117 transitions. Second operand has 53 states, 52 states have (on average 2.230769230769231) internal successors, (116), 52 states have internal predecessors, (116), 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 16:56:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:42,011 INFO L93 Difference]: Finished difference Result 52475 states and 216801 transitions. [2023-12-02 16:56:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 16:56:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.230769230769231) internal successors, (116), 52 states have internal predecessors, (116), 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 49 [2023-12-02 16:56:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:42,213 INFO L225 Difference]: With dead ends: 52475 [2023-12-02 16:56:42,213 INFO L226 Difference]: Without dead ends: 52475 [2023-12-02 16:56:42,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=470, Invalid=5041, Unknown=51, NotChecked=444, Total=6006 [2023-12-02 16:56:42,213 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1086 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 5566 mSolverCounterSat, 100 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 7464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 5566 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 1758 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:42,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 2754 Invalid, 7464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 5566 Invalid, 40 Unknown, 1758 Unchecked, 6.1s Time] [2023-12-02 16:56:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52475 states. [2023-12-02 16:56:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52475 to 27529. [2023-12-02 16:56:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27514 states have (on average 4.358326670058879) internal successors, (119915), 27528 states have internal predecessors, (119915), 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 16:56:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 119915 transitions. [2023-12-02 16:56:43,413 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 119915 transitions. Word has length 49 [2023-12-02 16:56:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:43,413 INFO L495 AbstractCegarLoop]: Abstraction has 27529 states and 119915 transitions. [2023-12-02 16:56:43,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.230769230769231) internal successors, (116), 52 states have internal predecessors, (116), 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 16:56:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 119915 transitions. [2023-12-02 16:56:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 16:56:43,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:43,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:43,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 16:56:43,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:43,620 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:43,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -569259471, now seen corresponding path program 1 times [2023-12-02 16:56:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523300757] [2023-12-02 16:56:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 16:56:43,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523300757] [2023-12-02 16:56:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523300757] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524271993] [2023-12-02 16:56:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:43,692 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:43,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-12-02 16:56:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:43,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 16:56:43,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:56:44,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 16:56:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524271993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:56:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185007293] [2023-12-02 16:56:44,165 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 16:56:44,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:56:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2023-12-02 16:56:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305504072] [2023-12-02 16:56:44,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:56:44,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 16:56:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 16:56:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-12-02 16:56:44,166 INFO L87 Difference]: Start difference. First operand 27529 states and 119915 transitions. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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 16:56:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:45,550 INFO L93 Difference]: Finished difference Result 38791 states and 167711 transitions. [2023-12-02 16:56:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 16:56:45,551 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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 49 [2023-12-02 16:56:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:45,695 INFO L225 Difference]: With dead ends: 38791 [2023-12-02 16:56:45,695 INFO L226 Difference]: Without dead ends: 38399 [2023-12-02 16:56:45,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=1072, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 16:56:45,696 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 867 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:45,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 632 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 16:56:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38399 states. [2023-12-02 16:56:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38399 to 35737. [2023-12-02 16:56:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35737 states, 35722 states have (on average 4.416801970774313) internal successors, (157777), 35736 states have internal predecessors, (157777), 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 16:56:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35737 states to 35737 states and 157777 transitions. [2023-12-02 16:56:47,172 INFO L78 Accepts]: Start accepts. Automaton has 35737 states and 157777 transitions. Word has length 49 [2023-12-02 16:56:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:47,172 INFO L495 AbstractCegarLoop]: Abstraction has 35737 states and 157777 transitions. [2023-12-02 16:56:47,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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 16:56:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35737 states and 157777 transitions. [2023-12-02 16:56:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 16:56:47,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:47,180 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:47,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-12-02 16:56:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:47,380 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:47,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 292602, now seen corresponding path program 1 times [2023-12-02 16:56:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:47,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638447804] [2023-12-02 16:56:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 16:56:47,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638447804] [2023-12-02 16:56:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638447804] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195506936] [2023-12-02 16:56:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:47,488 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:47,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 16:56:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:47,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:56:47,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 16:56:47,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 16:56:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195506936] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:56:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2023-12-02 16:56:47,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714317936] [2023-12-02 16:56:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:56:47,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:56:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:56:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:56:47,851 INFO L87 Difference]: Start difference. First operand 35737 states and 157777 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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 16:56:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:48,186 INFO L93 Difference]: Finished difference Result 35737 states and 156538 transitions. [2023-12-02 16:56:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:56:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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 52 [2023-12-02 16:56:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:48,295 INFO L225 Difference]: With dead ends: 35737 [2023-12-02 16:56:48,296 INFO L226 Difference]: Without dead ends: 35737 [2023-12-02 16:56:48,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-02 16:56:48,296 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 242 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:48,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:56:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35737 states. [2023-12-02 16:56:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35737 to 35737. [2023-12-02 16:56:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35737 states, 35722 states have (on average 4.382117462628073) internal successors, (156538), 35736 states have internal predecessors, (156538), 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 16:56:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35737 states to 35737 states and 156538 transitions. [2023-12-02 16:56:49,371 INFO L78 Accepts]: Start accepts. Automaton has 35737 states and 156538 transitions. Word has length 52 [2023-12-02 16:56:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:49,371 INFO L495 AbstractCegarLoop]: Abstraction has 35737 states and 156538 transitions. [2023-12-02 16:56:49,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 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 16:56:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35737 states and 156538 transitions. [2023-12-02 16:56:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 16:56:49,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:49,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:49,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 16:56:49,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:49,579 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:49,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1535571074, now seen corresponding path program 2 times [2023-12-02 16:56:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70823204] [2023-12-02 16:56:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:56:49,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70823204] [2023-12-02 16:56:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70823204] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877195543] [2023-12-02 16:56:49,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:56:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:49,795 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:49,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 16:56:50,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 16:56:50,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:56:50,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 16:56:50,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:56:50,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 16:56:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877195543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:56:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278839178] [2023-12-02 16:56:50,490 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 16:56:50,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:56:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2023-12-02 16:56:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511893618] [2023-12-02 16:56:50,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:56:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 16:56:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:50,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 16:56:50,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 16:56:50,492 INFO L87 Difference]: Start difference. First operand 35737 states and 156538 transitions. Second operand has 36 states, 36 states have (on average 2.25) internal successors, (81), 35 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 16:56:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:52,140 INFO L93 Difference]: Finished difference Result 39502 states and 151748 transitions. [2023-12-02 16:56:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 16:56:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.25) internal successors, (81), 35 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 53 [2023-12-02 16:56:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:52,300 INFO L225 Difference]: With dead ends: 39502 [2023-12-02 16:56:52,300 INFO L226 Difference]: Without dead ends: 39426 [2023-12-02 16:56:52,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=2030, Unknown=0, NotChecked=0, Total=2550 [2023-12-02 16:56:52,301 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 535 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:52,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 992 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 16:56:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39426 states. [2023-12-02 16:56:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39426 to 32049. [2023-12-02 16:56:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32049 states, 32034 states have (on average 3.9022288818130737) internal successors, (125004), 32048 states have internal predecessors, (125004), 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 16:56:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32049 states to 32049 states and 125004 transitions. [2023-12-02 16:56:53,407 INFO L78 Accepts]: Start accepts. Automaton has 32049 states and 125004 transitions. Word has length 53 [2023-12-02 16:56:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:53,407 INFO L495 AbstractCegarLoop]: Abstraction has 32049 states and 125004 transitions. [2023-12-02 16:56:53,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.25) internal successors, (81), 35 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 16:56:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 32049 states and 125004 transitions. [2023-12-02 16:56:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 16:56:53,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:53,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:53,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 16:56:53,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2023-12-02 16:56:53,619 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:53,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash 640032401, now seen corresponding path program 1 times [2023-12-02 16:56:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008777155] [2023-12-02 16:56:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:56:53,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008777155] [2023-12-02 16:56:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008777155] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:53,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897889675] [2023-12-02 16:56:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:53,740 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:53,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-12-02 16:56:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:53,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 16:56:53,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:56:54,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:56:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 16:56:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897889675] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 16:56:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2023-12-02 16:56:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593496256] [2023-12-02 16:56:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:56:54,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 16:56:54,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:56:54,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 16:56:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-02 16:56:54,162 INFO L87 Difference]: Start difference. First operand 32049 states and 125004 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 16:56:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:56:54,486 INFO L93 Difference]: Finished difference Result 36329 states and 139932 transitions. [2023-12-02 16:56:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 16:56:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 57 [2023-12-02 16:56:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:56:54,606 INFO L225 Difference]: With dead ends: 36329 [2023-12-02 16:56:54,606 INFO L226 Difference]: Without dead ends: 36329 [2023-12-02 16:56:54,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-02 16:56:54,607 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:56:54,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:56:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36329 states. [2023-12-02 16:56:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36329 to 36113. [2023-12-02 16:56:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36113 states, 36098 states have (on average 3.860158457532273) internal successors, (139344), 36112 states have internal predecessors, (139344), 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 16:56:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36113 states to 36113 states and 139344 transitions. [2023-12-02 16:56:55,678 INFO L78 Accepts]: Start accepts. Automaton has 36113 states and 139344 transitions. Word has length 57 [2023-12-02 16:56:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:56:55,678 INFO L495 AbstractCegarLoop]: Abstraction has 36113 states and 139344 transitions. [2023-12-02 16:56:55,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 16:56:55,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36113 states and 139344 transitions. [2023-12-02 16:56:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 16:56:55,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:56:55,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:56:55,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-12-02 16:56:55,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:55,895 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:56:55,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:56:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403781, now seen corresponding path program 3 times [2023-12-02 16:56:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:56:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252324616] [2023-12-02 16:56:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:56:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:56:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:56:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 16:56:57,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:56:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252324616] [2023-12-02 16:56:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252324616] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:56:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240824315] [2023-12-02 16:56:57,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 16:56:57,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:56:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:56:57,770 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:56:57,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 16:56:58,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 16:56:58,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:56:58,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 82 conjunts are in the unsatisfiable core [2023-12-02 16:56:58,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:56:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:56:58,078 INFO L349 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2023-12-02 16:56:58,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 30 [2023-12-02 16:56:58,113 INFO L349 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-12-02 16:56:58,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 1 [2023-12-02 16:56:58,935 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 16:56:58,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 52 [2023-12-02 16:56:59,932 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 16:57:00,170 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2023-12-02 16:57:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 62 [2023-12-02 16:57:00,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:00,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:00,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:00,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:01,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 16:57:01,293 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 18 treesize of output 13 [2023-12-02 16:57:01,320 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 18 treesize of output 13 [2023-12-02 16:57:01,436 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 18 treesize of output 13 [2023-12-02 16:57:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 16:57:01,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:01,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2912 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_2912) c_~B~0.base) (+ 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:57:01,944 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2912 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_2912) c_~B~0.base) (+ 8 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 16:57:02,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:02,679 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 32 treesize of output 33 [2023-12-02 16:57:02,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:02,689 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 311 treesize of output 299 [2023-12-02 16:57:02,697 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 138 treesize of output 122 [2023-12-02 16:57:02,704 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 59 treesize of output 55 [2023-12-02 16:57:02,711 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 62 treesize of output 54 [2023-12-02 16:57:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 44 trivial. 7 not checked. [2023-12-02 16:57:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240824315] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:57:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [945323622] [2023-12-02 16:57:03,861 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 16:57:03,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:57:03,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 19] total 68 [2023-12-02 16:57:03,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416963680] [2023-12-02 16:57:03,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:57:03,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-02 16:57:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:57:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-02 16:57:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4286, Unknown=52, NotChecked=266, Total=4830 [2023-12-02 16:57:03,863 INFO L87 Difference]: Start difference. First operand 36113 states and 139344 transitions. Second operand has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 16:57:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:16,803 INFO L93 Difference]: Finished difference Result 54137 states and 202716 transitions. [2023-12-02 16:57:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-02 16:57:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 62 [2023-12-02 16:57:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:16,998 INFO L225 Difference]: With dead ends: 54137 [2023-12-02 16:57:16,998 INFO L226 Difference]: Without dead ends: 54137 [2023-12-02 16:57:16,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3753 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1323, Invalid=16723, Unknown=52, NotChecked=534, Total=18632 [2023-12-02 16:57:16,999 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 763 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 6769 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 7727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 6769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:16,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1948 Invalid, 7727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 6769 Invalid, 0 Unknown, 709 Unchecked, 4.9s Time] [2023-12-02 16:57:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54137 states. [2023-12-02 16:57:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54137 to 36113. [2023-12-02 16:57:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36113 states, 36098 states have (on average 3.8597983267771068) internal successors, (139331), 36112 states have internal predecessors, (139331), 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 16:57:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36113 states to 36113 states and 139331 transitions. [2023-12-02 16:57:18,099 INFO L78 Accepts]: Start accepts. Automaton has 36113 states and 139331 transitions. Word has length 62 [2023-12-02 16:57:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:18,099 INFO L495 AbstractCegarLoop]: Abstraction has 36113 states and 139331 transitions. [2023-12-02 16:57:18,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 16:57:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36113 states and 139331 transitions. [2023-12-02 16:57:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 16:57:18,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:18,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:57:18,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 16:57:18,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-12-02 16:57:18,322 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:57:18,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403780, now seen corresponding path program 3 times [2023-12-02 16:57:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:57:18,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346346238] [2023-12-02 16:57:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:57:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 16:57:19,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:57:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346346238] [2023-12-02 16:57:19,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346346238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534108079] [2023-12-02 16:57:19,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 16:57:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:57:19,866 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:57:19,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-12-02 16:57:20,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 16:57:20,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:57:20,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 81 conjunts are in the unsatisfiable core [2023-12-02 16:57:20,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:20,154 INFO L349 Elim1Store]: treesize reduction 75, result has 20.2 percent of original size [2023-12-02 16:57:20,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 24 [2023-12-02 16:57:20,208 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-02 16:57:20,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2023-12-02 16:57:21,422 INFO L349 Elim1Store]: treesize reduction 146, result has 32.4 percent of original size [2023-12-02 16:57:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 78 treesize of output 128 [2023-12-02 16:57:23,461 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 16:57:23,931 INFO L349 Elim1Store]: treesize reduction 4, result has 97.4 percent of original size [2023-12-02 16:57:23,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 215 [2023-12-02 16:57:29,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:57:29,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:57:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:57:29,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:57:30,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 16:57:30,173 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 16 treesize of output 11 [2023-12-02 16:57:30,197 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 16 treesize of output 11 [2023-12-02 16:57:30,291 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 16 treesize of output 11 [2023-12-02 16:57:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 16:57:30,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:30,944 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3014 (Array Int Int))) (< (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_3014) c_~B~0.base) (+ 8 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 16:57:30,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3014 (Array Int Int))) (< (select (select (store |c_#memory_int| c_~C~0.base v_ArrVal_3014) c_~B~0.base) (+ 12 c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 16:57:31,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:31,550 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 30 treesize of output 31 [2023-12-02 16:57:31,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:31,562 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 1105 treesize of output 1057 [2023-12-02 16:57:31,575 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 59 treesize of output 55 [2023-12-02 16:57:31,582 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 55 treesize of output 47 [2023-12-02 16:57:31,589 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 62 treesize of output 46 [2023-12-02 16:57:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 44 trivial. 5 not checked. [2023-12-02 16:57:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534108079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:57:32,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [785195807] [2023-12-02 16:57:32,704 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 16:57:32,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:57:32,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 19] total 67 [2023-12-02 16:57:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314546141] [2023-12-02 16:57:32,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:57:32,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-12-02 16:57:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:57:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-12-02 16:57:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=4153, Unknown=50, NotChecked=262, Total=4692 [2023-12-02 16:57:32,706 INFO L87 Difference]: Start difference. First operand 36113 states and 139331 transitions. Second operand has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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 16:57:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:57:44,360 INFO L93 Difference]: Finished difference Result 54047 states and 202590 transitions. [2023-12-02 16:57:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 16:57:44,361 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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 62 [2023-12-02 16:57:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:57:44,544 INFO L225 Difference]: With dead ends: 54047 [2023-12-02 16:57:44,544 INFO L226 Difference]: Without dead ends: 54047 [2023-12-02 16:57:44,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=666, Invalid=8411, Unknown=51, NotChecked=378, Total=9506 [2023-12-02 16:57:44,545 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 383 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 7519 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 8151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 7519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 16:57:44,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2357 Invalid, 8151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 7519 Invalid, 0 Unknown, 539 Unchecked, 6.7s Time] [2023-12-02 16:57:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54047 states. [2023-12-02 16:57:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54047 to 36113. [2023-12-02 16:57:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36113 states, 36098 states have (on average 3.8594381960219404) internal successors, (139318), 36112 states have internal predecessors, (139318), 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 16:57:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36113 states to 36113 states and 139318 transitions. [2023-12-02 16:57:45,537 INFO L78 Accepts]: Start accepts. Automaton has 36113 states and 139318 transitions. Word has length 62 [2023-12-02 16:57:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:57:45,537 INFO L495 AbstractCegarLoop]: Abstraction has 36113 states and 139318 transitions. [2023-12-02 16:57:45,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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 16:57:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 36113 states and 139318 transitions. [2023-12-02 16:57:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 16:57:45,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:57:45,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:57:45,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2023-12-02 16:57:45,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:45,754 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:57:45,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:57:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403778, now seen corresponding path program 2 times [2023-12-02 16:57:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:57:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143635866] [2023-12-02 16:57:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:57:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:57:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:57:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 16:57:47,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:57:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143635866] [2023-12-02 16:57:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143635866] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:57:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432327791] [2023-12-02 16:57:47,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:57:47,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:57:47,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:57:47,077 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:57:47,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-12-02 16:57:47,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 16:57:47,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:57:47,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-02 16:57:47,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:57:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:57:47,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:57:47,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:57:47,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:57:47,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:57:47,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:57:47,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:57:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:47,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:57:47,733 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 23 treesize of output 1 [2023-12-02 16:57:47,930 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 16:57:47,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 16:57:47,994 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 23 treesize of output 18 [2023-12-02 16:57:48,154 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 23 treesize of output 18 [2023-12-02 16:57:48,302 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 23 treesize of output 18 [2023-12-02 16:57:48,454 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 23 treesize of output 18 [2023-12-02 16:57:48,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:57:48,626 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 11 treesize of output 11 [2023-12-02 16:57:48,686 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 23 treesize of output 18 [2023-12-02 16:57:48,724 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 23 treesize of output 18 [2023-12-02 16:57:48,753 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 23 treesize of output 18 [2023-12-02 16:57:48,782 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 23 treesize of output 18 [2023-12-02 16:57:48,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:48,927 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 23 treesize of output 18 [2023-12-02 16:57:48,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:57:48,995 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 23 treesize of output 18 [2023-12-02 16:57:49,114 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 23 treesize of output 18 [2023-12-02 16:57:49,247 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 23 treesize of output 18 [2023-12-02 16:57:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 16:57:49,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:57:52,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:52,658 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 37 treesize of output 38 [2023-12-02 16:57:52,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:57:52,670 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 341 treesize of output 333 [2023-12-02 16:57:52,688 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 320 treesize of output 308 [2023-12-02 16:57:52,698 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 308 treesize of output 260 [2023-12-02 16:57:52,709 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 260 treesize of output 236 [2023-12-02 16:57:52,722 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 120 treesize of output 114 [2023-12-02 16:57:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 16:57:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432327791] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:57:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1300897237] [2023-12-02 16:57:55,697 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 16:57:55,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:57:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 25] total 68 [2023-12-02 16:57:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8763160] [2023-12-02 16:57:55,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:57:55,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-02 16:57:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:57:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-02 16:57:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4548, Unknown=21, NotChecked=0, Total=4830 [2023-12-02 16:57:55,698 INFO L87 Difference]: Start difference. First operand 36113 states and 139318 transitions. Second operand has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 16:58:40,747 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 16:59:11,230 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 16:59:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:59:14,861 INFO L93 Difference]: Finished difference Result 93948 states and 361348 transitions. [2023-12-02 16:59:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2023-12-02 16:59:14,862 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 62 [2023-12-02 16:59:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:59:15,241 INFO L225 Difference]: With dead ends: 93948 [2023-12-02 16:59:15,241 INFO L226 Difference]: Without dead ends: 93948 [2023-12-02 16:59:15,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23634 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=6889, Invalid=64522, Unknown=145, NotChecked=0, Total=71556 [2023-12-02 16:59:15,245 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2799 mSDsluCounter, 4175 mSDsCounter, 0 mSdLazyCounter, 11826 mSolverCounterSat, 1002 mSolverCounterUnsat, 463 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 4269 SdHoareTripleChecker+Invalid, 13291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1002 IncrementalHoareTripleChecker+Valid, 11826 IncrementalHoareTripleChecker+Invalid, 463 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:59:15,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 4269 Invalid, 13291 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1002 Valid, 11826 Invalid, 463 Unknown, 0 Unchecked, 28.5s Time] [2023-12-02 16:59:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93948 states. [2023-12-02 16:59:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93948 to 52459. [2023-12-02 16:59:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52459 states, 52444 states have (on average 4.133837998627107) internal successors, (216795), 52458 states have internal predecessors, (216795), 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 16:59:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52459 states to 52459 states and 216795 transitions. [2023-12-02 16:59:17,113 INFO L78 Accepts]: Start accepts. Automaton has 52459 states and 216795 transitions. Word has length 62 [2023-12-02 16:59:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:59:17,114 INFO L495 AbstractCegarLoop]: Abstraction has 52459 states and 216795 transitions. [2023-12-02 16:59:17,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 16:59:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 52459 states and 216795 transitions. [2023-12-02 16:59:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 16:59:17,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:59:17,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:59:17,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2023-12-02 16:59:17,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:59:17,330 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 16:59:17,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:59:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403777, now seen corresponding path program 2 times [2023-12-02 16:59:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:59:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406328790] [2023-12-02 16:59:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:59:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:59:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:59:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 16:59:18,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:59:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406328790] [2023-12-02 16:59:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406328790] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:59:18,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780292977] [2023-12-02 16:59:18,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:59:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:59:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:59:18,673 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:59:18,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 16:59:19,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 16:59:19,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:59:19,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 16:59:19,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:59:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 16:59:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 16:59:19,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:59:19,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:59:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 16:59:19,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:59:19,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 16:59:19,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:19,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-02 16:59:19,316 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 23 treesize of output 1 [2023-12-02 16:59:19,519 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 16:59:19,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 16:59:19,580 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 21 treesize of output 16 [2023-12-02 16:59:19,739 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 21 treesize of output 16 [2023-12-02 16:59:19,888 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 21 treesize of output 16 [2023-12-02 16:59:20,060 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 21 treesize of output 16 [2023-12-02 16:59:20,204 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 16:59:20,204 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 11 treesize of output 11 [2023-12-02 16:59:20,272 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 21 treesize of output 16 [2023-12-02 16:59:20,311 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 21 treesize of output 16 [2023-12-02 16:59:20,344 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 21 treesize of output 16 [2023-12-02 16:59:20,383 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 21 treesize of output 16 [2023-12-02 16:59:20,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:20,532 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 21 treesize of output 16 [2023-12-02 16:59:20,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:59:20,601 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 21 treesize of output 16 [2023-12-02 16:59:20,724 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 21 treesize of output 16 [2023-12-02 16:59:20,866 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 21 treesize of output 16 [2023-12-02 16:59:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 16:59:21,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:59:24,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:59:24,414 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 36 treesize of output 37 [2023-12-02 16:59:24,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 16:59:24,428 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 1226 treesize of output 1195 [2023-12-02 16:59:24,459 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 146 treesize of output 140 [2023-12-02 16:59:24,469 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 282 treesize of output 270 [2023-12-02 16:59:24,481 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 270 treesize of output 246 [2023-12-02 16:59:24,491 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 246 treesize of output 198 [2023-12-02 16:59:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 16:59:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780292977] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:59:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682744041] [2023-12-02 16:59:26,163 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 16:59:26,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:59:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 23] total 66 [2023-12-02 16:59:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381317150] [2023-12-02 16:59:26,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:59:26,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-02 16:59:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:59:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-02 16:59:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4293, Unknown=20, NotChecked=0, Total=4556 [2023-12-02 16:59:26,165 INFO L87 Difference]: Start difference. First operand 52459 states and 216795 transitions. Second operand has 68 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 67 states have internal predecessors, (141), 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 16:59:44,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:59:46,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 16:59:49,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:00:14,238 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:00:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:00:51,181 INFO L93 Difference]: Finished difference Result 89951 states and 345761 transitions. [2023-12-02 17:00:51,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2023-12-02 17:00:51,181 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 67 states have internal predecessors, (141), 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 62 [2023-12-02 17:00:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:00:51,517 INFO L225 Difference]: With dead ends: 89951 [2023-12-02 17:00:51,517 INFO L226 Difference]: Without dead ends: 89951 [2023-12-02 17:00:51,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22895 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=6500, Invalid=62157, Unknown=249, NotChecked=0, Total=68906 [2023-12-02 17:00:51,519 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 2240 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 11119 mSolverCounterSat, 828 mSolverCounterUnsat, 546 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 12493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 11119 IncrementalHoareTripleChecker+Invalid, 546 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:00:51,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 4221 Invalid, 12493 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [828 Valid, 11119 Invalid, 546 Unknown, 0 Unchecked, 30.7s Time] [2023-12-02 17:00:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89951 states. [2023-12-02 17:00:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89951 to 52459. [2023-12-02 17:00:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52459 states, 52444 states have (on average 4.113816642513919) internal successors, (215745), 52458 states have internal predecessors, (215745), 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:00:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52459 states to 52459 states and 215745 transitions. [2023-12-02 17:00:53,139 INFO L78 Accepts]: Start accepts. Automaton has 52459 states and 215745 transitions. Word has length 62 [2023-12-02 17:00:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:00:53,139 INFO L495 AbstractCegarLoop]: Abstraction has 52459 states and 215745 transitions. [2023-12-02 17:00:53,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 67 states have internal predecessors, (141), 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:00:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 52459 states and 215745 transitions. [2023-12-02 17:00:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 17:00:53,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:00:53,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:00:53,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 17:00:53,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:00:53,356 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:00:53,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:00:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1764845585, now seen corresponding path program 2 times [2023-12-02 17:00:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:00:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405082312] [2023-12-02 17:00:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:00:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:00:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:00:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 17:00:55,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:00:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405082312] [2023-12-02 17:00:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405082312] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:00:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574135009] [2023-12-02 17:00:55,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:00:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:00:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:00:55,206 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:00:55,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-12-02 17:00:55,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:00:55,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:00:55,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 17:00:55,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:00:55,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:00:56,442 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 15 treesize of output 1 [2023-12-02 17:00:56,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:00:56,557 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 11 treesize of output 11 [2023-12-02 17:00:56,637 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 18 treesize of output 13 [2023-12-02 17:00:56,678 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 18 treesize of output 13 [2023-12-02 17:00:56,721 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 18 treesize of output 13 [2023-12-02 17:00:56,757 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 18 treesize of output 13 [2023-12-02 17:00:56,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:00:56,934 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 18 treesize of output 13 [2023-12-02 17:00:57,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:00:57,016 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 18 treesize of output 13 [2023-12-02 17:00:57,154 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 18 treesize of output 13 [2023-12-02 17:00:57,315 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 18 treesize of output 13 [2023-12-02 17:00:57,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:00:57,500 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 18 treesize of output 13 [2023-12-02 17:00:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 17:00:57,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:00:57,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:57,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 4 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:57,625 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:57,631 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_3328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:57,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_3328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 8 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:57,648 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_3328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ 8 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:58,069 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int)) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3325) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3326) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_3328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3329) c_~B~0.base) (+ 12 c_~B~0.offset)) 9223372039002259456))) is different from false [2023-12-02 17:00:58,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:00:58,228 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 35 treesize of output 36 [2023-12-02 17:00:58,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:00:58,244 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 9795 treesize of output 9603 [2023-12-02 17:00:58,286 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 143 treesize of output 139 [2023-12-02 17:00:58,295 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 139 treesize of output 123 [2023-12-02 17:00:58,305 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 123 treesize of output 115 [2023-12-02 17:00:58,316 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 146 treesize of output 114 [2023-12-02 17:00:59,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:00:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-12-02 17:00:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 44 trivial. 9 not checked. [2023-12-02 17:00:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574135009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:00:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606107680] [2023-12-02 17:00:59,490 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:00:59,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:00:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 20] total 67 [2023-12-02 17:00:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281885167] [2023-12-02 17:00:59,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:00:59,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-12-02 17:00:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:00:59,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-12-02 17:00:59,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3541, Unknown=31, NotChecked=882, Total=4692 [2023-12-02 17:00:59,493 INFO L87 Difference]: Start difference. First operand 52459 states and 215745 transitions. Second operand has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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:01:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:01:08,468 INFO L93 Difference]: Finished difference Result 84632 states and 329791 transitions. [2023-12-02 17:01:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 17:01:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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 63 [2023-12-02 17:01:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:01:08,780 INFO L225 Difference]: With dead ends: 84632 [2023-12-02 17:01:08,780 INFO L226 Difference]: Without dead ends: 84632 [2023-12-02 17:01:08,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1866 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=669, Invalid=7518, Unknown=31, NotChecked=1288, Total=9506 [2023-12-02 17:01:08,781 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 611 mSDsluCounter, 4114 mSDsCounter, 0 mSdLazyCounter, 8324 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 11472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 8324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3059 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:01:08,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 4242 Invalid, 11472 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [89 Valid, 8324 Invalid, 0 Unknown, 3059 Unchecked, 5.7s Time] [2023-12-02 17:01:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84632 states. [2023-12-02 17:01:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84632 to 52459. [2023-12-02 17:01:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52459 states, 52444 states have (on average 4.0762527648539395) internal successors, (213775), 52458 states have internal predecessors, (213775), 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:01:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52459 states to 52459 states and 213775 transitions. [2023-12-02 17:01:10,599 INFO L78 Accepts]: Start accepts. Automaton has 52459 states and 213775 transitions. Word has length 63 [2023-12-02 17:01:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:01:10,600 INFO L495 AbstractCegarLoop]: Abstraction has 52459 states and 213775 transitions. [2023-12-02 17:01:10,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 68 states have internal predecessors, (144), 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:01:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 52459 states and 213775 transitions. [2023-12-02 17:01:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 17:01:10,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:01:10,618 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:01:10,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2023-12-02 17:01:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:01:10,819 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:01:10,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:01:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1764845584, now seen corresponding path program 2 times [2023-12-02 17:01:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:01:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102078039] [2023-12-02 17:01:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:01:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:01:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:01:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 17:01:12,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:01:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102078039] [2023-12-02 17:01:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102078039] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:01:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162779710] [2023-12-02 17:01:12,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:01:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:01:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:01:12,586 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:01:12,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-12-02 17:01:13,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:01:13,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:01:13,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 17:01:13,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:01:13,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:01:14,043 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 15 treesize of output 1 [2023-12-02 17:01:14,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:01:14,162 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 11 treesize of output 11 [2023-12-02 17:01:14,260 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 16 treesize of output 11 [2023-12-02 17:01:14,308 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 16 treesize of output 11 [2023-12-02 17:01:14,347 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 16 treesize of output 11 [2023-12-02 17:01:14,387 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 16 treesize of output 11 [2023-12-02 17:01:14,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:14,561 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 16 treesize of output 11 [2023-12-02 17:01:14,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:14,641 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 16 treesize of output 11 [2023-12-02 17:01:14,796 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 16 treesize of output 11 [2023-12-02 17:01:14,962 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 16 treesize of output 11 [2023-12-02 17:01:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:15,192 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 16 treesize of output 11 [2023-12-02 17:01:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 17:01:15,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:01:15,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3432 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3432) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 17:01:15,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3432 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3432) c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_#t~post6#1| 4) 4 c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 17:01:15,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3431 (Array Int Int)) (v_ArrVal_3432 (Array Int Int))) (< (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_3431) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3432) c_~B~0.base) (+ 4 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 17:01:15,677 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3431 (Array Int Int)) (v_ArrVal_3432 (Array Int Int))) (< (select (select (store (store |c_#memory_int| c_~C~0.base v_ArrVal_3431) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3432) c_~B~0.base) (+ 12 c_~B~0.offset)) 4294967296)) is different from false [2023-12-02 17:01:16,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:01:16,256 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 33 treesize of output 34 [2023-12-02 17:01:16,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:01:16,267 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 4385 treesize of output 4289 [2023-12-02 17:01:16,283 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 127 treesize of output 119 [2023-12-02 17:01:16,292 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 119 treesize of output 115 [2023-12-02 17:01:16,298 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 246 treesize of output 214 [2023-12-02 17:01:16,307 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 114 treesize of output 98 [2023-12-02 17:01:17,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:01:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 62 [2023-12-02 17:01:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 44 trivial. 7 not checked. [2023-12-02 17:01:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162779710] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:01:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201682348] [2023-12-02 17:01:17,645 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:01:17,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:01:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 68 [2023-12-02 17:01:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426086603] [2023-12-02 17:01:17,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:01:17,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-12-02 17:01:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:01:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-12-02 17:01:17,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4021, Unknown=59, NotChecked=524, Total=4830 [2023-12-02 17:01:17,647 INFO L87 Difference]: Start difference. First operand 52459 states and 213775 transitions. Second operand has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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:01:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:01:30,877 INFO L93 Difference]: Finished difference Result 84313 states and 326938 transitions. [2023-12-02 17:01:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-02 17:01:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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 63 [2023-12-02 17:01:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:01:31,287 INFO L225 Difference]: With dead ends: 84313 [2023-12-02 17:01:31,288 INFO L226 Difference]: Without dead ends: 84313 [2023-12-02 17:01:31,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3621 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1203, Invalid=14504, Unknown=59, NotChecked=1004, Total=16770 [2023-12-02 17:01:31,289 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 953 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 9864 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 12128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 9864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2048 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:01:31,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 4729 Invalid, 12128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [216 Valid, 9864 Invalid, 0 Unknown, 2048 Unchecked, 6.9s Time] [2023-12-02 17:01:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84313 states. [2023-12-02 17:01:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84313 to 52459. [2023-12-02 17:01:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52459 states, 52444 states have (on average 4.03868888719396) internal successors, (211805), 52458 states have internal predecessors, (211805), 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:01:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52459 states to 52459 states and 211805 transitions. [2023-12-02 17:01:33,038 INFO L78 Accepts]: Start accepts. Automaton has 52459 states and 211805 transitions. Word has length 63 [2023-12-02 17:01:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:01:33,039 INFO L495 AbstractCegarLoop]: Abstraction has 52459 states and 211805 transitions. [2023-12-02 17:01:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 69 states have internal predecessors, (144), 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:01:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 52459 states and 211805 transitions. [2023-12-02 17:01:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 17:01:33,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:01:33,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:01:33,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2023-12-02 17:01:33,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:01:33,256 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:01:33,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:01:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1764845582, now seen corresponding path program 2 times [2023-12-02 17:01:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:01:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017068700] [2023-12-02 17:01:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:01:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:01:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:01:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:01:35,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:01:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017068700] [2023-12-02 17:01:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017068700] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:01:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114867845] [2023-12-02 17:01:35,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:01:35,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:01:35,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:01:35,027 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:01:35,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 17:01:35,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:01:35,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:01:35,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-02 17:01:35,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:01:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-12-02 17:01:35,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:01:35,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 17:01:35,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:01:35,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 17:01:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:35,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:01:35,952 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 19 treesize of output 1 [2023-12-02 17:01:36,188 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:01:36,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 17:01:36,270 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 22 treesize of output 17 [2023-12-02 17:01:36,475 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 22 treesize of output 17 [2023-12-02 17:01:36,677 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 22 treesize of output 17 [2023-12-02 17:01:36,893 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 22 treesize of output 17 [2023-12-02 17:01:37,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:01:37,131 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 11 treesize of output 11 [2023-12-02 17:01:37,212 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 22 treesize of output 17 [2023-12-02 17:01:37,396 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 22 treesize of output 17 [2023-12-02 17:01:37,463 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 22 treesize of output 17 [2023-12-02 17:01:37,517 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 22 treesize of output 17 [2023-12-02 17:01:37,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:37,743 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 22 treesize of output 17 [2023-12-02 17:01:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:37,842 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 22 treesize of output 17 [2023-12-02 17:01:38,031 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 22 treesize of output 17 [2023-12-02 17:01:38,229 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 22 treesize of output 17 [2023-12-02 17:01:38,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:01:38,520 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 18 treesize of output 13 [2023-12-02 17:01:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:01:38,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:01:41,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:01:41,648 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 39 treesize of output 40 [2023-12-02 17:01:41,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:01:41,678 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 78084 treesize of output 77315 [2023-12-02 17:01:41,777 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 295 treesize of output 291 [2023-12-02 17:01:41,797 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 291 treesize of output 259 [2023-12-02 17:01:41,817 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 259 treesize of output 243 [2023-12-02 17:01:41,837 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 243 treesize of output 235 [2023-12-02 17:01:41,859 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 298 treesize of output 234 [2023-12-02 17:01:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:01:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114867845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:01:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705366683] [2023-12-02 17:01:42,804 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:01:42,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:01:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 69 [2023-12-02 17:01:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110093761] [2023-12-02 17:01:42,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:01:42,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-12-02 17:01:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:01:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-12-02 17:01:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4673, Unknown=23, NotChecked=0, Total=4970 [2023-12-02 17:01:42,806 INFO L87 Difference]: Start difference. First operand 52459 states and 211805 transitions. Second operand has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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:01:53,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 12)) (.cse1 (< c_~N~0 4)) (.cse0 (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (or .cse0 .cse1 (forall ((v_ArrVal_3540 (Array Int Int)) (v_ArrVal_3541 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337| Int) (v_ArrVal_3543 (Array Int Int)) (v_ArrVal_3544 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337|) 0)) (< 0 (+ 2147483649 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3541) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337| v_ArrVal_3543) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3544) c_~A~0.base) .cse2)))))) (or (forall ((v_ArrVal_3540 (Array Int Int)) (v_ArrVal_3541 (Array Int Int)) (v_ArrVal_3543 (Array Int Int)) (v_ArrVal_3544 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3541) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_3543) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3544) c_~A~0.base) .cse2)))) .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_338| Int) (v_ArrVal_3540 (Array Int Int)) (v_ArrVal_3541 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337| Int) (v_ArrVal_3543 (Array Int Int)) (v_ArrVal_3544 (Array Int Int)) (v_ArrVal_3531 Int) (v_ArrVal_3535 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_338| v_ArrVal_3531) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_338|) 0)) (< 0 (+ 2147483649 (select (select (store (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_338| v_ArrVal_3535) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3540) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3541) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_337| v_ArrVal_3543) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3544) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (not (= c_~N~0 4))))) is different from false [2023-12-02 17:01:57,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:01:59,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:01,290 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:02:02,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:10,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:02:12,883 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:02:14,946 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:02:20,547 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:02:22,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:24,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:26,685 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:02:28,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:30,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:32,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:42,875 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:02:47,872 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:02:49,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:02:52,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:03:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:03:21,615 INFO L93 Difference]: Finished difference Result 209656 states and 811256 transitions. [2023-12-02 17:03:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-12-02 17:03:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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 63 [2023-12-02 17:03:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:03:22,840 INFO L225 Difference]: With dead ends: 209656 [2023-12-02 17:03:22,840 INFO L226 Difference]: Without dead ends: 209656 [2023-12-02 17:03:22,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13053 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=3948, Invalid=41903, Unknown=163, NotChecked=426, Total=46440 [2023-12-02 17:03:22,842 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 3311 mSDsluCounter, 7965 mSDsCounter, 0 mSdLazyCounter, 16350 mSolverCounterSat, 739 mSolverCounterUnsat, 435 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 8159 SdHoareTripleChecker+Invalid, 17593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 16350 IncrementalHoareTripleChecker+Invalid, 435 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 66.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:03:22,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3311 Valid, 8159 Invalid, 17593 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [739 Valid, 16350 Invalid, 435 Unknown, 69 Unchecked, 66.7s Time] [2023-12-02 17:03:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209656 states. [2023-12-02 17:03:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209656 to 79184. [2023-12-02 17:03:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79184 states, 79169 states have (on average 4.131629804595233) internal successors, (327097), 79183 states have internal predecessors, (327097), 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:03:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79184 states to 79184 states and 327097 transitions. [2023-12-02 17:03:26,707 INFO L78 Accepts]: Start accepts. Automaton has 79184 states and 327097 transitions. Word has length 63 [2023-12-02 17:03:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:03:26,707 INFO L495 AbstractCegarLoop]: Abstraction has 79184 states and 327097 transitions. [2023-12-02 17:03:26,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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:03:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 79184 states and 327097 transitions. [2023-12-02 17:03:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 17:03:26,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:03:26,726 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:03:26,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-12-02 17:03:26,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:03:26,926 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:03:26,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:03:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1764845581, now seen corresponding path program 2 times [2023-12-02 17:03:26,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:03:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954848121] [2023-12-02 17:03:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:03:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:03:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:03:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:03:28,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:03:28,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954848121] [2023-12-02 17:03:28,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954848121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:03:28,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369089888] [2023-12-02 17:03:28,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:03:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:03:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:03:28,745 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:03:28,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-12-02 17:03:29,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:03:29,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:03:29,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 17:03:29,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:03:29,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:03:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 17:03:29,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:03:29,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-12-02 17:03:29,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:03:29,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:29,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-12-02 17:03:29,923 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 23 treesize of output 1 [2023-12-02 17:03:30,236 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:03:30,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 17:03:30,357 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 21 treesize of output 16 [2023-12-02 17:03:30,588 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 21 treesize of output 16 [2023-12-02 17:03:30,856 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 21 treesize of output 16 [2023-12-02 17:03:31,138 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 21 treesize of output 16 [2023-12-02 17:03:31,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:03:31,411 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 11 treesize of output 11 [2023-12-02 17:03:31,515 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 21 treesize of output 16 [2023-12-02 17:03:31,578 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 21 treesize of output 16 [2023-12-02 17:03:31,624 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 21 treesize of output 16 [2023-12-02 17:03:31,693 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 21 treesize of output 16 [2023-12-02 17:03:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:32,040 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 21 treesize of output 16 [2023-12-02 17:03:32,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:32,127 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 21 treesize of output 16 [2023-12-02 17:03:32,302 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 21 treesize of output 16 [2023-12-02 17:03:32,540 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 21 treesize of output 16 [2023-12-02 17:03:32,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:03:32,910 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 21 treesize of output 16 [2023-12-02 17:03:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:03:33,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:03:37,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:03:37,373 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 39 treesize of output 40 [2023-12-02 17:03:37,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:03:37,392 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 4882 treesize of output 4819 [2023-12-02 17:03:37,447 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 592 treesize of output 496 [2023-12-02 17:03:37,468 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 496 treesize of output 448 [2023-12-02 17:03:37,492 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 221 treesize of output 215 [2023-12-02 17:03:37,514 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 442 treesize of output 418 [2023-12-02 17:03:37,538 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 214 treesize of output 202 [2023-12-02 17:03:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 36 refuted. 3 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 17:03:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369089888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:03:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682426383] [2023-12-02 17:03:39,722 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:03:39,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:03:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 69 [2023-12-02 17:03:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800223524] [2023-12-02 17:03:39,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:03:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-12-02 17:03:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:03:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-12-02 17:03:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4686, Unknown=27, NotChecked=0, Total=4970 [2023-12-02 17:03:39,723 INFO L87 Difference]: Start difference. First operand 79184 states and 327097 transitions. Second operand has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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:03:55,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:03:57,152 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:03:59,166 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:04:06,915 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:04:11,493 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:04:13,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:04:27,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:04:34,102 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:04:36,324 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:05:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:05:48,340 INFO L93 Difference]: Finished difference Result 254242 states and 951164 transitions. [2023-12-02 17:05:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2023-12-02 17:05:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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 63 [2023-12-02 17:05:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:05:49,842 INFO L225 Difference]: With dead ends: 254242 [2023-12-02 17:05:49,842 INFO L226 Difference]: Without dead ends: 254242 [2023-12-02 17:05:49,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18235 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=5442, Invalid=54817, Unknown=503, NotChecked=0, Total=60762 [2023-12-02 17:05:49,845 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 6445 mSDsluCounter, 9077 mSDsCounter, 0 mSdLazyCounter, 19147 mSolverCounterSat, 1053 mSolverCounterUnsat, 460 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6445 SdHoareTripleChecker+Valid, 9316 SdHoareTripleChecker+Invalid, 20660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1053 IncrementalHoareTripleChecker+Valid, 19147 IncrementalHoareTripleChecker+Invalid, 460 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:05:49,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6445 Valid, 9316 Invalid, 20660 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1053 Valid, 19147 Invalid, 460 Unknown, 0 Unchecked, 62.3s Time] [2023-12-02 17:05:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254242 states. [2023-12-02 17:05:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254242 to 97899. [2023-12-02 17:05:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97899 states, 97884 states have (on average 4.002196477463119) internal successors, (391751), 97898 states have internal predecessors, (391751), 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:05:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97899 states to 97899 states and 391751 transitions. [2023-12-02 17:05:55,045 INFO L78 Accepts]: Start accepts. Automaton has 97899 states and 391751 transitions. Word has length 63 [2023-12-02 17:05:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:05:55,045 INFO L495 AbstractCegarLoop]: Abstraction has 97899 states and 391751 transitions. [2023-12-02 17:05:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.057142857142857) internal successors, (144), 70 states have internal predecessors, (144), 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:05:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 97899 states and 391751 transitions. [2023-12-02 17:05:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 17:05:55,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:05:55,071 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:05:55,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2023-12-02 17:05:55,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:05:55,271 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:05:55,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:05:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash 498080450, now seen corresponding path program 1 times [2023-12-02 17:05:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:05:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670229391] [2023-12-02 17:05:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:05:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:05:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:05:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-02 17:05:55,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:05:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670229391] [2023-12-02 17:05:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670229391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:05:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:05:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:05:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120593229] [2023-12-02 17:05:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:05:55,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:05:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:05:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:05:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:05:55,335 INFO L87 Difference]: Start difference. First operand 97899 states and 391751 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:05:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:05:56,531 INFO L93 Difference]: Finished difference Result 97545 states and 383892 transitions. [2023-12-02 17:05:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:05:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-12-02 17:05:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:05:56,907 INFO L225 Difference]: With dead ends: 97545 [2023-12-02 17:05:56,907 INFO L226 Difference]: Without dead ends: 97545 [2023-12-02 17:05:56,908 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:05:56,908 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:05:56,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 108 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:05:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97545 states. [2023-12-02 17:05:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97545 to 97517. [2023-12-02 17:05:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97517 states, 97504 states have (on average 3.936494913029209) internal successors, (383824), 97516 states have internal predecessors, (383824), 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:05:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97517 states to 97517 states and 383824 transitions. [2023-12-02 17:05:59,687 INFO L78 Accepts]: Start accepts. Automaton has 97517 states and 383824 transitions. Word has length 65 [2023-12-02 17:05:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:05:59,687 INFO L495 AbstractCegarLoop]: Abstraction has 97517 states and 383824 transitions. [2023-12-02 17:05:59,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:05:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 97517 states and 383824 transitions. [2023-12-02 17:05:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 17:05:59,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:05:59,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:05:59,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-12-02 17:05:59,715 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2023-12-02 17:05:59,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:05:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 311195282, now seen corresponding path program 1 times [2023-12-02 17:05:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:05:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115063835] [2023-12-02 17:05:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:05:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:05:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:06:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:06:01,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:06:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115063835] [2023-12-02 17:06:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115063835] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:06:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372336596] [2023-12-02 17:06:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:06:01,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:06:01,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:06:01,415 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:06:01,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d06d2829-7021-40ed-92e4-142a1ecbca6c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-12-02 17:06:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:06:01,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 17:06:01,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:06:01,843 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 15 treesize of output 7 [2023-12-02 17:06:02,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:06:02,130 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 30 treesize of output 23 [2023-12-02 17:06:02,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:06:02,293 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 108 treesize of output 78 [2023-12-02 17:06:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 17:06:02,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:06:02,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:06:02,950 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 77 treesize of output 55 [2023-12-02 17:06:03,001 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 9 treesize of output 5 [2023-12-02 17:06:03,192 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 15 treesize of output 7 [2023-12-02 17:06:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 17:06:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372336596] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:06:03,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012511724] [2023-12-02 17:06:03,353 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:06:03,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:06:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2023-12-02 17:06:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108309476] [2023-12-02 17:06:03,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:06:03,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 17:06:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:06:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 17:06:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 17:06:03,355 INFO L87 Difference]: Start difference. First operand 97517 states and 383824 transitions. Second operand has 39 states, 38 states have (on average 3.8947368421052633) internal successors, (148), 38 states have internal predecessors, (148), 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:06:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:06:09,896 INFO L93 Difference]: Finished difference Result 178556 states and 681242 transitions. [2023-12-02 17:06:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 17:06:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.8947368421052633) internal successors, (148), 38 states have internal predecessors, (148), 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 65 [2023-12-02 17:06:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:06:10,920 INFO L225 Difference]: With dead ends: 178556 [2023-12-02 17:06:10,921 INFO L226 Difference]: Without dead ends: 177977 [2023-12-02 17:06:10,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2086 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1457, Invalid=6553, Unknown=0, NotChecked=0, Total=8010 [2023-12-02 17:06:10,921 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1523 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:06:10,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1100 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 17:06:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177977 states.