./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:54:01,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:54:01,785 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-19 04:54:01,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:54:01,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:54:01,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:54:01,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:54:01,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:54:01,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:54:01,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:54:01,846 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:54:01,846 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:54:01,847 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:54:01,848 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:54:01,849 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:54:01,849 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:54:01,850 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:54:01,850 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:54:01,851 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:54:01,851 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:54:01,851 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:54:01,852 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:54:01,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:54:01,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:54:01,854 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:54:01,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:54:01,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:54:01,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:54:01,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:54:01,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:54:01,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:54:01,858 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 04:54:01,858 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:54:01,858 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:54:01,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:54:01,859 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:54:01,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:54:01,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:54:01,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:54:01,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:54:01,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:54:01,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:54:01,861 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:54:01,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:54:01,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:54:01,862 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:54:01,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:54:01,863 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_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/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_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-11-19 04:54:02,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:54:02,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:54:02,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:54:02,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:54:02,160 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:54:02,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-19 04:54:05,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:54:05,644 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:54:05,645 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-19 04:54:05,672 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/data/17a3d51f0/7ad299b268e54e3083566d19881bfb0d/FLAG2a97793d9 [2023-11-19 04:54:05,689 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/data/17a3d51f0/7ad299b268e54e3083566d19881bfb0d [2023-11-19 04:54:05,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:54:05,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:54:05,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:54:05,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:54:05,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:54:05,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:54:05" (1/1) ... [2023-11-19 04:54:05,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4cb5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:05, skipping insertion in model container [2023-11-19 04:54:05,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:54:05" (1/1) ... [2023-11-19 04:54:05,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:54:06,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:54:06,333 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:54:06,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:54:06,522 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:54:06,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06 WrapperNode [2023-11-19 04:54:06,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:54:06,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:54:06,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:54:06,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:54:06,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,624 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2023-11-19 04:54:06,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:54:06,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:54:06,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:54:06,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:54:06,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:54:06,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:54:06,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:54:06,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:54:06,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (1/1) ... [2023-11-19 04:54:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:54:06,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:54:06,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:54:06,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:54:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-19 04:54:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-19 04:54:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-19 04:54:06,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-19 04:54:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:54:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:54:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:54:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:54:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 04:54:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:54:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:54:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:54:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:54:06,826 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:54:07,064 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:54:07,066 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:54:07,491 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:54:07,505 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:54:07,505 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 04:54:07,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:54:07 BoogieIcfgContainer [2023-11-19 04:54:07,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:54:07,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:54:07,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:54:07,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:54:07,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:54:05" (1/3) ... [2023-11-19 04:54:07,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bdf38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:54:07, skipping insertion in model container [2023-11-19 04:54:07,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:54:06" (2/3) ... [2023-11-19 04:54:07,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bdf38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:54:07, skipping insertion in model container [2023-11-19 04:54:07,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:54:07" (3/3) ... [2023-11-19 04:54:07,542 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-11-19 04:54:07,549 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:54:07,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:54:07,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-19 04:54:07,558 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:54:07,753 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 04:54:07,810 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:54:07,826 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 258 transitions, 530 flow [2023-11-19 04:54:07,829 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 258 transitions, 530 flow [2023-11-19 04:54:07,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 258 transitions, 530 flow [2023-11-19 04:54:07,969 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2023-11-19 04:54:07,970 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 04:54:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 256 events. 15/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 477 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 175. Up to 3 conditions per place. [2023-11-19 04:54:08,001 INFO L119 LiptonReduction]: Number of co-enabled transitions 15300 [2023-11-19 04:54:16,565 INFO L134 LiptonReduction]: Checked pairs total: 32702 [2023-11-19 04:54:16,565 INFO L136 LiptonReduction]: Total number of compositions: 256 [2023-11-19 04:54:16,574 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 62 transitions, 138 flow [2023-11-19 04:54:16,671 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:16,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:54:16,697 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;@e0ca846, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:54:16,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-19 04:54:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:54:16,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:16,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:16,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:16,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1097154522, now seen corresponding path program 1 times [2023-11-19 04:54:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514921526] [2023-11-19 04:54:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:17,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:17,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514921526] [2023-11-19 04:54:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514921526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:54:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509307389] [2023-11-19 04:54:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:54:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:54:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:54:17,704 INFO L87 Difference]: Start difference. First operand has 1104 states, 1056 states have (on average 2.777462121212121) internal successors, (2933), 1103 states have internal predecessors, (2933), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 04:54:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:18,022 INFO L93 Difference]: Finished difference Result 1112 states and 2949 transitions. [2023-11-19 04:54:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:54:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 04:54:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:18,050 INFO L225 Difference]: With dead ends: 1112 [2023-11-19 04:54:18,050 INFO L226 Difference]: Without dead ends: 1112 [2023-11-19 04:54:18,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:54:18,054 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:18,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:54:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-19 04:54:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1107. [2023-11-19 04:54:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1059 states have (on average 2.776203966005666) internal successors, (2940), 1106 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2940 transitions. [2023-11-19 04:54:18,156 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 2940 transitions. Word has length 7 [2023-11-19 04:54:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:18,156 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 2940 transitions. [2023-11-19 04:54:18,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-19 04:54:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2940 transitions. [2023-11-19 04:54:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:54:18,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:18,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:18,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:54:18,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:18,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -235032713, now seen corresponding path program 1 times [2023-11-19 04:54:18,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:18,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54304409] [2023-11-19 04:54:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:18,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54304409] [2023-11-19 04:54:18,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54304409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:18,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:54:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251971282] [2023-11-19 04:54:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:18,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:54:18,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:54:18,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:54:18,578 INFO L87 Difference]: Start difference. First operand 1107 states and 2940 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:18,942 INFO L93 Difference]: Finished difference Result 1481 states and 3910 transitions. [2023-11-19 04:54:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:54:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-19 04:54:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:18,958 INFO L225 Difference]: With dead ends: 1481 [2023-11-19 04:54:18,958 INFO L226 Difference]: Without dead ends: 1481 [2023-11-19 04:54:18,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:18,961 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:18,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 26 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:54:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2023-11-19 04:54:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1272. [2023-11-19 04:54:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1224 states have (on average 2.7908496732026142) internal successors, (3416), 1271 states have internal predecessors, (3416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 3416 transitions. [2023-11-19 04:54:19,016 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 3416 transitions. Word has length 8 [2023-11-19 04:54:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:19,017 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 3416 transitions. [2023-11-19 04:54:19,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 3416 transitions. [2023-11-19 04:54:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:54:19,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:19,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:19,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:54:19,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:19,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -347613863, now seen corresponding path program 2 times [2023-11-19 04:54:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733959004] [2023-11-19 04:54:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:19,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733959004] [2023-11-19 04:54:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733959004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:54:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436799735] [2023-11-19 04:54:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:54:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:54:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:54:19,648 INFO L87 Difference]: Start difference. First operand 1272 states and 3416 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:20,173 INFO L93 Difference]: Finished difference Result 1524 states and 4168 transitions. [2023-11-19 04:54:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:54:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-19 04:54:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:20,188 INFO L225 Difference]: With dead ends: 1524 [2023-11-19 04:54:20,188 INFO L226 Difference]: Without dead ends: 1524 [2023-11-19 04:54:20,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:54:20,190 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:20,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 46 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:54:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2023-11-19 04:54:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1356. [2023-11-19 04:54:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1308 states have (on average 2.81651376146789) internal successors, (3684), 1355 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3684 transitions. [2023-11-19 04:54:20,244 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3684 transitions. Word has length 8 [2023-11-19 04:54:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:20,245 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 3684 transitions. [2023-11-19 04:54:20,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3684 transitions. [2023-11-19 04:54:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:54:20,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:20,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:20,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:54:20,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:20,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -347613844, now seen corresponding path program 1 times [2023-11-19 04:54:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428002054] [2023-11-19 04:54:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:20,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428002054] [2023-11-19 04:54:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428002054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:20,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:20,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:54:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337892926] [2023-11-19 04:54:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:20,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:54:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:54:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:54:20,798 INFO L87 Difference]: Start difference. First operand 1356 states and 3684 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:21,147 INFO L93 Difference]: Finished difference Result 1461 states and 3947 transitions. [2023-11-19 04:54:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:54:21,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-19 04:54:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:21,159 INFO L225 Difference]: With dead ends: 1461 [2023-11-19 04:54:21,159 INFO L226 Difference]: Without dead ends: 1461 [2023-11-19 04:54:21,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:54:21,161 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:21,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 32 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:54:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2023-11-19 04:54:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1354. [2023-11-19 04:54:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1306 states have (on average 2.8300153139356814) internal successors, (3696), 1353 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3696 transitions. [2023-11-19 04:54:21,210 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3696 transitions. Word has length 8 [2023-11-19 04:54:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:21,211 INFO L495 AbstractCegarLoop]: Abstraction has 1354 states and 3696 transitions. [2023-11-19 04:54:21,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3696 transitions. [2023-11-19 04:54:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:54:21,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:21,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:54:21,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:21,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2123999781, now seen corresponding path program 1 times [2023-11-19 04:54:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529800138] [2023-11-19 04:54:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:21,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529800138] [2023-11-19 04:54:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529800138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:54:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400889414] [2023-11-19 04:54:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:54:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:54:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:54:21,261 INFO L87 Difference]: Start difference. First operand 1354 states and 3696 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:21,470 INFO L93 Difference]: Finished difference Result 2204 states and 6016 transitions. [2023-11-19 04:54:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:54:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 04:54:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:21,489 INFO L225 Difference]: With dead ends: 2204 [2023-11-19 04:54:21,489 INFO L226 Difference]: Without dead ends: 2204 [2023-11-19 04:54:21,490 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-11-19 04:54:21,490 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:21,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 26 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:54:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2023-11-19 04:54:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2012. [2023-11-19 04:54:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1964 states have (on average 2.9063136456211813) internal successors, (5708), 2011 states have internal predecessors, (5708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 5708 transitions. [2023-11-19 04:54:21,597 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 5708 transitions. Word has length 9 [2023-11-19 04:54:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:21,598 INFO L495 AbstractCegarLoop]: Abstraction has 2012 states and 5708 transitions. [2023-11-19 04:54:21,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 5708 transitions. [2023-11-19 04:54:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:54:21,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:21,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:21,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:54:21,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:21,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 630565487, now seen corresponding path program 1 times [2023-11-19 04:54:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483502548] [2023-11-19 04:54:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:21,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483502548] [2023-11-19 04:54:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483502548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:21,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:21,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:54:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329317652] [2023-11-19 04:54:21,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:54:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:54:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:54:21,955 INFO L87 Difference]: Start difference. First operand 2012 states and 5708 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-11-19 04:54:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:22,248 INFO L93 Difference]: Finished difference Result 2251 states and 6276 transitions. [2023-11-19 04:54:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:54:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-11-19 04:54:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:22,268 INFO L225 Difference]: With dead ends: 2251 [2023-11-19 04:54:22,269 INFO L226 Difference]: Without dead ends: 2251 [2023-11-19 04:54:22,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:22,270 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:22,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:54:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2023-11-19 04:54:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2015. [2023-11-19 04:54:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1967 states have (on average 2.9049313675648194) internal successors, (5714), 2014 states have internal predecessors, (5714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 5714 transitions. [2023-11-19 04:54:22,410 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 5714 transitions. Word has length 10 [2023-11-19 04:54:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:22,410 INFO L495 AbstractCegarLoop]: Abstraction has 2015 states and 5714 transitions. [2023-11-19 04:54:22,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-11-19 04:54:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 5714 transitions. [2023-11-19 04:54:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:54:22,412 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:22,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:22,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:54:22,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:22,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1061537358, now seen corresponding path program 1 times [2023-11-19 04:54:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635231229] [2023-11-19 04:54:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:22,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635231229] [2023-11-19 04:54:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635231229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:54:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714976201] [2023-11-19 04:54:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:54:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:54:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:22,890 INFO L87 Difference]: Start difference. First operand 2015 states and 5714 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:23,212 INFO L93 Difference]: Finished difference Result 3036 states and 8471 transitions. [2023-11-19 04:54:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:54:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 04:54:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:23,239 INFO L225 Difference]: With dead ends: 3036 [2023-11-19 04:54:23,239 INFO L226 Difference]: Without dead ends: 3036 [2023-11-19 04:54:23,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:54:23,241 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 189 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:23,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 24 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:54:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2023-11-19 04:54:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2355. [2023-11-19 04:54:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2307 states have (on average 2.9839618552232334) internal successors, (6884), 2354 states have internal predecessors, (6884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 6884 transitions. [2023-11-19 04:54:23,363 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 6884 transitions. Word has length 11 [2023-11-19 04:54:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:23,364 INFO L495 AbstractCegarLoop]: Abstraction has 2355 states and 6884 transitions. [2023-11-19 04:54:23,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 6884 transitions. [2023-11-19 04:54:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:54:23,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:23,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:23,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:54:23,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:23,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1061537293, now seen corresponding path program 1 times [2023-11-19 04:54:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275866326] [2023-11-19 04:54:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:23,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275866326] [2023-11-19 04:54:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275866326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:54:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096500329] [2023-11-19 04:54:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:54:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:54:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:23,769 INFO L87 Difference]: Start difference. First operand 2355 states and 6884 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:24,180 INFO L93 Difference]: Finished difference Result 3068 states and 8727 transitions. [2023-11-19 04:54:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:54:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 04:54:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:24,207 INFO L225 Difference]: With dead ends: 3068 [2023-11-19 04:54:24,208 INFO L226 Difference]: Without dead ends: 3068 [2023-11-19 04:54:24,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:54:24,209 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 80 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:24,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 36 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:54:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2023-11-19 04:54:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2451. [2023-11-19 04:54:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2403 states have (on average 2.9529754473574696) internal successors, (7096), 2450 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 7096 transitions. [2023-11-19 04:54:24,333 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 7096 transitions. Word has length 11 [2023-11-19 04:54:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:24,333 INFO L495 AbstractCegarLoop]: Abstraction has 2451 states and 7096 transitions. [2023-11-19 04:54:24,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 7096 transitions. [2023-11-19 04:54:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:54:24,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:24,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:24,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:54:24,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:24,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -597118832, now seen corresponding path program 2 times [2023-11-19 04:54:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280357474] [2023-11-19 04:54:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:24,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280357474] [2023-11-19 04:54:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280357474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:54:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328205022] [2023-11-19 04:54:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:24,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:54:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:54:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:24,744 INFO L87 Difference]: Start difference. First operand 2451 states and 7096 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:25,244 INFO L93 Difference]: Finished difference Result 3416 states and 9676 transitions. [2023-11-19 04:54:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:54:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 04:54:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:25,272 INFO L225 Difference]: With dead ends: 3416 [2023-11-19 04:54:25,272 INFO L226 Difference]: Without dead ends: 3416 [2023-11-19 04:54:25,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:54:25,274 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:25,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 32 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 04:54:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-11-19 04:54:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 2386. [2023-11-19 04:54:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2338 states have (on average 2.9657827202737383) internal successors, (6934), 2385 states have internal predecessors, (6934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6934 transitions. [2023-11-19 04:54:25,402 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6934 transitions. Word has length 11 [2023-11-19 04:54:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:25,403 INFO L495 AbstractCegarLoop]: Abstraction has 2386 states and 6934 transitions. [2023-11-19 04:54:25,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6934 transitions. [2023-11-19 04:54:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:54:25,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:25,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:25,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:54:25,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:25,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1922224860, now seen corresponding path program 3 times [2023-11-19 04:54:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141866057] [2023-11-19 04:54:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:25,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141866057] [2023-11-19 04:54:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141866057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:25,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:54:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321555050] [2023-11-19 04:54:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:25,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:54:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:54:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:54:25,775 INFO L87 Difference]: Start difference. First operand 2386 states and 6934 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:26,080 INFO L93 Difference]: Finished difference Result 2791 states and 7958 transitions. [2023-11-19 04:54:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:54:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 04:54:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:26,093 INFO L225 Difference]: With dead ends: 2791 [2023-11-19 04:54:26,093 INFO L226 Difference]: Without dead ends: 2791 [2023-11-19 04:54:26,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:54:26,094 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:26,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 26 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:54:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2023-11-19 04:54:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2485. [2023-11-19 04:54:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2437 states have (on average 2.9708658186294623) internal successors, (7240), 2484 states have internal predecessors, (7240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 7240 transitions. [2023-11-19 04:54:26,223 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 7240 transitions. Word has length 11 [2023-11-19 04:54:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:26,223 INFO L495 AbstractCegarLoop]: Abstraction has 2485 states and 7240 transitions. [2023-11-19 04:54:26,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 7240 transitions. [2023-11-19 04:54:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:54:26,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:26,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:26,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:54:26,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:26,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1054384760, now seen corresponding path program 1 times [2023-11-19 04:54:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664035949] [2023-11-19 04:54:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:26,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664035949] [2023-11-19 04:54:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664035949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:54:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943187723] [2023-11-19 04:54:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:26,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:54:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:54:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:54:26,294 INFO L87 Difference]: Start difference. First operand 2485 states and 7240 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:26,384 INFO L93 Difference]: Finished difference Result 609 states and 1413 transitions. [2023-11-19 04:54:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:54:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-19 04:54:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:26,387 INFO L225 Difference]: With dead ends: 609 [2023-11-19 04:54:26,387 INFO L226 Difference]: Without dead ends: 587 [2023-11-19 04:54:26,388 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-11-19 04:54:26,389 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:26,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:54:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-11-19 04:54:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 562. [2023-11-19 04:54:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 544 states have (on average 2.4099264705882355) internal successors, (1311), 561 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1311 transitions. [2023-11-19 04:54:26,411 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1311 transitions. Word has length 11 [2023-11-19 04:54:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:26,412 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1311 transitions. [2023-11-19 04:54:26,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1311 transitions. [2023-11-19 04:54:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:54:26,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:26,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:54:26,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:26,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 383074367, now seen corresponding path program 1 times [2023-11-19 04:54:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322959556] [2023-11-19 04:54:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:26,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:26,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322959556] [2023-11-19 04:54:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322959556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:54:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:54:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:54:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222477000] [2023-11-19 04:54:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:54:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:54:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:54:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:54:26,472 INFO L87 Difference]: Start difference. First operand 562 states and 1311 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:26,579 INFO L93 Difference]: Finished difference Result 586 states and 1359 transitions. [2023-11-19 04:54:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:54:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-19 04:54:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:26,582 INFO L225 Difference]: With dead ends: 586 [2023-11-19 04:54:26,582 INFO L226 Difference]: Without dead ends: 586 [2023-11-19 04:54:26,583 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-11-19 04:54:26,583 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:26,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:54:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-11-19 04:54:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2023-11-19 04:54:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 568 states have (on average 2.392605633802817) internal successors, (1359), 585 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1359 transitions. [2023-11-19 04:54:26,605 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1359 transitions. Word has length 12 [2023-11-19 04:54:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:26,606 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 1359 transitions. [2023-11-19 04:54:26,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1359 transitions. [2023-11-19 04:54:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:54:26,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:26,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:26,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:54:26,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:26,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 442112290, now seen corresponding path program 1 times [2023-11-19 04:54:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395009075] [2023-11-19 04:54:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:27,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395009075] [2023-11-19 04:54:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395009075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:54:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589128397] [2023-11-19 04:54:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:27,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:54:27,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:54:27,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:54:27,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:54:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:27,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-19 04:54:27,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:54:27,382 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-11-19 04:54:27,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-19 04:54:27,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:27,496 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 20 treesize of output 15 [2023-11-19 04:54:27,585 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-11-19 04:54:27,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 19 [2023-11-19 04:54:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:28,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:54:28,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:54:28,512 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 2 case distinctions, treesize of input 38 treesize of output 44 [2023-11-19 04:54:28,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:54:28,531 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 55 treesize of output 59 [2023-11-19 04:54:28,547 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-11-19 04:54:28,569 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-11-19 04:54:28,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:54:28,581 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 41 treesize of output 41 [2023-11-19 04:54:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589128397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:54:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1284854001] [2023-11-19 04:54:28,723 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-11-19 04:54:28,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:54:28,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-19 04:54:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481259346] [2023-11-19 04:54:28,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:54:28,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 04:54:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 04:54:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=528, Unknown=11, NotChecked=0, Total=650 [2023-11-19 04:54:28,733 INFO L87 Difference]: Start difference. First operand 586 states and 1359 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 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-11-19 04:54:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:29,887 INFO L93 Difference]: Finished difference Result 1146 states and 2671 transitions. [2023-11-19 04:54:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:54:29,888 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 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 15 [2023-11-19 04:54:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:29,892 INFO L225 Difference]: With dead ends: 1146 [2023-11-19 04:54:29,892 INFO L226 Difference]: Without dead ends: 1146 [2023-11-19 04:54:29,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=898, Unknown=11, NotChecked=0, Total=1190 [2023-11-19 04:54:29,894 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 577 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:29,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 92 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 04:54:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-19 04:54:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 717. [2023-11-19 04:54:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 699 states have (on average 2.4721030042918457) internal successors, (1728), 716 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1728 transitions. [2023-11-19 04:54:29,921 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1728 transitions. Word has length 15 [2023-11-19 04:54:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:29,922 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1728 transitions. [2023-11-19 04:54:29,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 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-11-19 04:54:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1728 transitions. [2023-11-19 04:54:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:54:29,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:29,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:29,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:54:30,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-19 04:54:30,141 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:30,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 442112309, now seen corresponding path program 1 times [2023-11-19 04:54:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272772902] [2023-11-19 04:54:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:30,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272772902] [2023-11-19 04:54:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272772902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:54:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976888307] [2023-11-19 04:54:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:54:30,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:54:30,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:54:31,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:54:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:31,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-19 04:54:31,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:54:31,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,169 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 32 treesize of output 21 [2023-11-19 04:54:31,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 04:54:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 04:54:31,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 04:54:31,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,197 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 27 treesize of output 1 [2023-11-19 04:54:31,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 47 [2023-11-19 04:54:31,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 73 treesize of output 64 [2023-11-19 04:54:31,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 125 treesize of output 110 [2023-11-19 04:54:31,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:31,807 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 179 treesize of output 158 [2023-11-19 04:54:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 203 treesize of output 180 [2023-11-19 04:54:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:32,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:54:32,412 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|)))) is different from false [2023-11-19 04:54:32,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|)))) is different from false [2023-11-19 04:54:32,454 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|))))) is different from false [2023-11-19 04:54:32,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|))))))) is different from false [2023-11-19 04:54:32,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_346 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_346) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_346) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-11-19 04:54:32,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_346 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_346) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (select .cse1 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_346) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2023-11-19 04:54:32,588 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 Int) (v_ArrVal_344 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| Int) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_351 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| Int)) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_344)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse0 .cse4)) (.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_346) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166| 1))) |c_~#stored_elements~0.base| v_ArrVal_349) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_346) (= 400 .cse2) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157| 4) |c_~#queue~0.offset|) v_ArrVal_351) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_166|) (< (select .cse3 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_157|))))) is different from false [2023-11-19 04:54:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 04:54:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976888307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:54:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [687839851] [2023-11-19 04:54:32,910 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-11-19 04:54:32,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:54:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-11-19 04:54:32,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489671167] [2023-11-19 04:54:32,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:54:32,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-19 04:54:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:32,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-19 04:54:32,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=526, Unknown=7, NotChecked=378, Total=1056 [2023-11-19 04:54:32,914 INFO L87 Difference]: Start difference. First operand 717 states and 1728 transitions. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-11-19 04:54:36,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-19 04:54:38,594 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 [0, 1] [2023-11-19 04:54:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:54:39,122 INFO L93 Difference]: Finished difference Result 758 states and 1821 transitions. [2023-11-19 04:54:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 04:54:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 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 15 [2023-11-19 04:54:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:54:39,126 INFO L225 Difference]: With dead ends: 758 [2023-11-19 04:54:39,126 INFO L226 Difference]: Without dead ends: 758 [2023-11-19 04:54:39,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=336, Invalid=1091, Unknown=7, NotChecked=546, Total=1980 [2023-11-19 04:54:39,134 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-19 04:54:39,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 102 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 794 Invalid, 2 Unknown, 1087 Unchecked, 4.9s Time] [2023-11-19 04:54:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2023-11-19 04:54:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 728. [2023-11-19 04:54:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 710 states have (on average 2.4746478873239437) internal successors, (1757), 727 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1757 transitions. [2023-11-19 04:54:39,162 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1757 transitions. Word has length 15 [2023-11-19 04:54:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:54:39,163 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 1757 transitions. [2023-11-19 04:54:39,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-11-19 04:54:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1757 transitions. [2023-11-19 04:54:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:54:39,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:54:39,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:54:39,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 04:54:39,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-19 04:54:39,386 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-19 04:54:39,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:54:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1292606418, now seen corresponding path program 1 times [2023-11-19 04:54:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:54:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674380133] [2023-11-19 04:54:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:54:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:40,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:54:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674380133] [2023-11-19 04:54:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674380133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:54:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760989457] [2023-11-19 04:54:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:54:40,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:54:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:54:40,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:54:40,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9aab166-d913-4c4f-a88c-8867ea7858d9/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:54:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:54:40,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-19 04:54:40,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:54:40,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:40,784 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-19 04:54:40,784 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 29 treesize of output 30 [2023-11-19 04:54:40,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:40,792 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 27 treesize of output 21 [2023-11-19 04:54:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:40,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:40,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:40,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2023-11-19 04:54:40,867 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 25 [2023-11-19 04:54:40,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 47 [2023-11-19 04:54:41,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 73 treesize of output 64 [2023-11-19 04:54:41,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 125 treesize of output 110 [2023-11-19 04:54:41,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:54:41,468 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 179 treesize of output 158 [2023-11-19 04:54:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 203 treesize of output 180 [2023-11-19 04:54:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:54:41,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:54:42,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_418 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_416) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_418) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|)))) is different from false [2023-11-19 04:54:42,117 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_416) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_418) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|))))) is different from false [2023-11-19 04:54:42,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_416 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_413 Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_411)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_413) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_416) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164|) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (= .cse1 400) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_418) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_413))))) is different from false [2023-11-19 04:54:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-19 04:54:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760989457] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:54:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [510850822] [2023-11-19 04:54:46,004 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-11-19 04:54:46,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:54:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2023-11-19 04:54:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111713540] [2023-11-19 04:54:46,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:54:46,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-19 04:54:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:54:46,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-19 04:54:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=802, Unknown=27, NotChecked=192, Total=1260 [2023-11-19 04:54:46,008 INFO L87 Difference]: Start difference. First operand 728 states and 1757 transitions. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:54:48,412 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 [0, 1] [2023-11-19 04:54:50,427 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 [0, 1] [2023-11-19 04:54:52,469 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 [0, 1]