./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:10:04,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:10:04,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:10:04,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:10:04,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:10:04,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:10:04,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:10:04,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:10:04,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:10:04,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:10:04,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:10:04,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:10:04,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:10:04,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:10:04,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:10:04,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:10:04,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:10:04,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:10:04,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:10:04,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:10:04,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:10:04,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:10:04,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:10:04,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:10:04,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:10:04,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:10:04,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:10:04,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:10:04,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:10:04,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:10:04,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:10:04,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:10:04,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:10:04,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:10:04,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:10:04,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:10:04,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:10:04,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:10:04,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:10:04,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:10:04,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:10:04,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 16:10:04,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:10:04,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:10:04,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:10:04,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:10:04,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:10:04,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:10:04,443 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:10:04,444 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:10:04,444 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:10:04,444 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:10:04,446 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:10:04,446 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:10:04,446 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:10:04,447 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:10:04,447 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:10:04,447 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:10:04,448 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:10:04,448 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:10:04,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:10:04,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:10:04,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:10:04,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:10:04,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:10:04,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:10:04,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:10:04,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:10:04,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:10:04,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:10:04,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:10:04,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:10:04,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:10:04,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:10:04,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:10:04,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:10:04,455 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:10:04,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:10:04,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:10:04,456 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:10:04,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:10:04,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:10:04,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:10:04,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/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_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-23 16:10:04,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:10:04,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:10:04,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:10:04,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:10:04,890 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:10:04,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-23 16:10:08,246 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:10:08,550 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:10:08,551 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-23 16:10:08,572 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/data/51a0cd913/c86b0d197fd34e29810e00c0bb2a7dad/FLAG40098386b [2022-11-23 16:10:08,591 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/data/51a0cd913/c86b0d197fd34e29810e00c0bb2a7dad [2022-11-23 16:10:08,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:10:08,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:10:08,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:10:08,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:10:08,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:10:08,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:10:08" (1/1) ... [2022-11-23 16:10:08,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dbf3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:08, skipping insertion in model container [2022-11-23 16:10:08,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:10:08" (1/1) ... [2022-11-23 16:10:08,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:10:08,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:10:09,260 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-23 16:10:09,273 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-23 16:10:09,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:10:09,293 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:10:09,359 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-23 16:10:09,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-23 16:10:09,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:10:09,436 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:10:09,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09 WrapperNode [2022-11-23 16:10:09,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:10:09,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:10:09,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:10:09,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:10:09,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,509 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-23 16:10:09,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:10:09,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:10:09,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:10:09,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:10:09,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:10:09,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:10:09,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:10:09,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:10:09,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (1/1) ... [2022-11-23 16:10:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:10:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:09,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:10:09,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:10:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 16:10:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 16:10:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 16:10:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 16:10:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:10:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:10:09,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:10:09,664 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:10:09,943 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:10:09,945 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:10:10,357 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:10:10,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:10:10,368 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 16:10:10,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:10 BoogieIcfgContainer [2022-11-23 16:10:10,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:10:10,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:10:10,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:10:10,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:10:10,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:10:08" (1/3) ... [2022-11-23 16:10:10,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c4818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:10:10, skipping insertion in model container [2022-11-23 16:10:10,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:09" (2/3) ... [2022-11-23 16:10:10,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c4818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:10:10, skipping insertion in model container [2022-11-23 16:10:10,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:10" (3/3) ... [2022-11-23 16:10:10,380 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-23 16:10:10,391 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 16:10:10,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:10:10,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 16:10:10,404 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:10:10,574 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 16:10:10,631 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:10:10,656 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-23 16:10:10,665 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-11-23 16:10:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-23 16:10:10,754 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-23 16:10:10,755 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 16:10:10,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-23 16:10:10,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-23 16:10:21,526 INFO L134 LiptonReduction]: Checked pairs total: 21650 [2022-11-23 16:10:21,527 INFO L136 LiptonReduction]: Total number of compositions: 215 [2022-11-23 16:10:21,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2022-11-23 16:10:21,624 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:21,652 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:10:21,662 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fa43614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:10:21,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 16:10:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 16:10:21,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:21,674 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 16:10:21,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times [2022-11-23 16:10:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792821808] [2022-11-23 16:10:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:21,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:21,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792821808] [2022-11-23 16:10:21,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792821808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:10:21,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:10:21,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 16:10:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85212490] [2022-11-23 16:10:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:10:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 16:10:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:21,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 16:10:21,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 16:10:21,883 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:22,007 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2022-11-23 16:10:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 16:10:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-23 16:10:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:22,037 INFO L225 Difference]: With dead ends: 510 [2022-11-23 16:10:22,039 INFO L226 Difference]: Without dead ends: 510 [2022-11-23 16:10:22,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 16:10:22,045 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:22,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:10:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-23 16:10:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-23 16:10:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2022-11-23 16:10:22,150 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2022-11-23 16:10:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:22,150 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2022-11-23 16:10:22,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2022-11-23 16:10:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 16:10:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:22,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:22,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:10:22,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1171630367, now seen corresponding path program 1 times [2022-11-23 16:10:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:22,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027868972] [2022-11-23 16:10:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:22,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:22,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027868972] [2022-11-23 16:10:22,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027868972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:10:22,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:10:22,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:10:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972885414] [2022-11-23 16:10:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:10:22,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:10:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:10:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:10:22,577 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:22,671 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2022-11-23 16:10:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:10:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 [2022-11-23 16:10:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:22,673 INFO L225 Difference]: With dead ends: 220 [2022-11-23 16:10:22,673 INFO L226 Difference]: Without dead ends: 198 [2022-11-23 16:10:22,673 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 [2022-11-23 16:10:22,674 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:22,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:10:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-23 16:10:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-23 16:10:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2022-11-23 16:10:22,683 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2022-11-23 16:10:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:22,683 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2022-11-23 16:10:22,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2022-11-23 16:10:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 16:10:22,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:22,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 16:10:22,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2092899768, now seen corresponding path program 1 times [2022-11-23 16:10:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222924834] [2022-11-23 16:10:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:22,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:22,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222924834] [2022-11-23 16:10:22,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222924834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:10:22,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:10:22,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:10:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631193620] [2022-11-23 16:10:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:10:22,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:10:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:10:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:10:22,759 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:22,857 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2022-11-23 16:10:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:10:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 16:10:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:22,859 INFO L225 Difference]: With dead ends: 258 [2022-11-23 16:10:22,859 INFO L226 Difference]: Without dead ends: 258 [2022-11-23 16:10:22,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:10:22,861 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:22,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:10:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-23 16:10:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2022-11-23 16:10:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1970443349753697) internal successors, (446), 203 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2022-11-23 16:10:22,869 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2022-11-23 16:10:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:22,870 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2022-11-23 16:10:22,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2022-11-23 16:10:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 16:10:22,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:22,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:22,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 16:10:22,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -985514399, now seen corresponding path program 1 times [2022-11-23 16:10:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828181990] [2022-11-23 16:10:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:22,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:23,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828181990] [2022-11-23 16:10:23,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828181990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642465200] [2022-11-23 16:10:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:23,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:23,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 16:10:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:23,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 16:10:23,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:23,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:23,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642465200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:23,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087746357] [2022-11-23 16:10:23,254 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:10:23,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:23,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 16:10:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221988998] [2022-11-23 16:10:23,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:23,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 16:10:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:23,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 16:10:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 16:10:23,260 INFO L87 Difference]: Start difference. First operand 204 states and 446 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:23,421 INFO L93 Difference]: Finished difference Result 384 states and 824 transitions. [2022-11-23 16:10:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:10:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-23 16:10:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:23,424 INFO L225 Difference]: With dead ends: 384 [2022-11-23 16:10:23,424 INFO L226 Difference]: Without dead ends: 384 [2022-11-23 16:10:23,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 16:10:23,426 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:23,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 9 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:10:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-23 16:10:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-23 16:10:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.151436031331593) internal successors, (824), 383 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 824 transitions. [2022-11-23 16:10:23,439 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 824 transitions. Word has length 26 [2022-11-23 16:10:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:23,440 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 824 transitions. [2022-11-23 16:10:23,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 824 transitions. [2022-11-23 16:10:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 16:10:23,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:23,442 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:23,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:23,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-23 16:10:23,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash 953933320, now seen corresponding path program 2 times [2022-11-23 16:10:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:23,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859874700] [2022-11-23 16:10:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-23 16:10:23,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:23,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859874700] [2022-11-23 16:10:23,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859874700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:10:23,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:10:23,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:10:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7908342] [2022-11-23 16:10:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:10:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:10:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:10:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:10:23,973 INFO L87 Difference]: Start difference. First operand 384 states and 824 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:24,071 INFO L93 Difference]: Finished difference Result 272 states and 526 transitions. [2022-11-23 16:10:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:10:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-23 16:10:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:24,074 INFO L225 Difference]: With dead ends: 272 [2022-11-23 16:10:24,074 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 16:10:24,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:10:24,076 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:24,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:10:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 16:10:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-23 16:10:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2022-11-23 16:10:24,094 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 47 [2022-11-23 16:10:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:24,096 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2022-11-23 16:10:24,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2022-11-23 16:10:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 16:10:24,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:24,100 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 16:10:24,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2121986374, now seen corresponding path program 1 times [2022-11-23 16:10:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:24,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292535009] [2022-11-23 16:10:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:24,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292535009] [2022-11-23 16:10:24,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292535009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:24,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796438290] [2022-11-23 16:10:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:24,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:24,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 16:10:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:24,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:10:24,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:24,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:24,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796438290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:24,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1813686736] [2022-11-23 16:10:24,704 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:10:24,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:24,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-23 16:10:24,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794498551] [2022-11-23 16:10:24,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:24,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 16:10:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:24,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 16:10:24,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-23 16:10:24,708 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:25,059 INFO L93 Difference]: Finished difference Result 510 states and 967 transitions. [2022-11-23 16:10:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 16:10:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-23 16:10:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:25,062 INFO L225 Difference]: With dead ends: 510 [2022-11-23 16:10:25,063 INFO L226 Difference]: Without dead ends: 510 [2022-11-23 16:10:25,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-23 16:10:25,064 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 222 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:25,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 19 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:10:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-23 16:10:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-11-23 16:10:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.899803536345776) internal successors, (967), 509 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 967 transitions. [2022-11-23 16:10:25,078 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 967 transitions. Word has length 48 [2022-11-23 16:10:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:25,079 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 967 transitions. [2022-11-23 16:10:25,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 967 transitions. [2022-11-23 16:10:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-23 16:10:25,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:25,081 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:25,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:25,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash 626664730, now seen corresponding path program 2 times [2022-11-23 16:10:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:25,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128815548] [2022-11-23 16:10:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:25,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128815548] [2022-11-23 16:10:25,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128815548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:25,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905313436] [2022-11-23 16:10:25,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:10:25,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:25,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:25,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:25,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 16:10:26,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 16:10:26,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:10:26,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-23 16:10:26,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:26,942 INFO L350 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 13 treesize of output 9 [2022-11-23 16:10:26,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:10:26,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 16:10:27,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:10:27,078 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 16:10:27,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-23 16:10:27,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:10:27,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 16:10:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-23 16:10:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:27,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:27,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-11-23 16:10:27,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:27,420 INFO L350 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 78 treesize of output 80 [2022-11-23 16:10:27,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-11-23 16:10:27,469 INFO L350 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 8 treesize of output 4 [2022-11-23 16:10:27,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:27,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-11-23 16:10:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-23 16:10:27,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905313436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:27,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1792943869] [2022-11-23 16:10:27,752 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:10:27,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:27,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-11-23 16:10:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105733850] [2022-11-23 16:10:27,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:27,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:10:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:10:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=470, Unknown=7, NotChecked=0, Total=600 [2022-11-23 16:10:27,755 INFO L87 Difference]: Start difference. First operand 510 states and 967 transitions. Second operand has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:29,881 INFO L93 Difference]: Finished difference Result 978 states and 1809 transitions. [2022-11-23 16:10:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 16:10:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 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 90 [2022-11-23 16:10:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:29,885 INFO L225 Difference]: With dead ends: 978 [2022-11-23 16:10:29,886 INFO L226 Difference]: Without dead ends: 978 [2022-11-23 16:10:29,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1175, Invalid=2849, Unknown=8, NotChecked=0, Total=4032 [2022-11-23 16:10:29,888 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1424 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:29,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 16 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 16:10:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-11-23 16:10:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 777. [2022-11-23 16:10:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.8518041237113403) internal successors, (1437), 776 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1437 transitions. [2022-11-23 16:10:29,916 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1437 transitions. Word has length 90 [2022-11-23 16:10:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:29,916 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1437 transitions. [2022-11-23 16:10:29,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 25 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1437 transitions. [2022-11-23 16:10:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-23 16:10:29,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:29,921 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:29,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:30,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:30,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1789955963, now seen corresponding path program 1 times [2022-11-23 16:10:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:30,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677593204] [2022-11-23 16:10:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:30,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677593204] [2022-11-23 16:10:30,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677593204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035319344] [2022-11-23 16:10:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:30,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:30,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 16:10:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:31,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 16:10:31,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:31,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:31,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035319344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:31,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1789284535] [2022-11-23 16:10:31,597 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:10:31,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:31,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-11-23 16:10:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644049727] [2022-11-23 16:10:31,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:31,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 16:10:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 16:10:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-23 16:10:31,603 INFO L87 Difference]: Start difference. First operand 777 states and 1437 transitions. Second operand has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:32,279 INFO L93 Difference]: Finished difference Result 1596 states and 2919 transitions. [2022-11-23 16:10:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 16:10:32,279 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 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 102 [2022-11-23 16:10:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:32,287 INFO L225 Difference]: With dead ends: 1596 [2022-11-23 16:10:32,287 INFO L226 Difference]: Without dead ends: 1596 [2022-11-23 16:10:32,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-23 16:10:32,289 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 635 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:32,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 35 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 16:10:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-11-23 16:10:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2022-11-23 16:10:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.8300940438871474) internal successors, (2919), 1595 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2919 transitions. [2022-11-23 16:10:32,330 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2919 transitions. Word has length 102 [2022-11-23 16:10:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:32,330 INFO L495 AbstractCegarLoop]: Abstraction has 1596 states and 2919 transitions. [2022-11-23 16:10:32,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 27 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2919 transitions. [2022-11-23 16:10:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-23 16:10:32,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:32,336 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:32,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:32,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1648220756, now seen corresponding path program 2 times [2022-11-23 16:10:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:32,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377939638] [2022-11-23 16:10:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:34,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377939638] [2022-11-23 16:10:34,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377939638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:34,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708777418] [2022-11-23 16:10:34,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:10:34,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:34,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:34,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 16:10:35,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 16:10:35,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:10:35,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-23 16:10:35,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:35,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 16:10:35,096 INFO L350 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 24 treesize of output 24 [2022-11-23 16:10:36,641 INFO L350 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 13 treesize of output 9 [2022-11-23 16:10:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:10:36,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 16:10:36,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:10:36,807 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 16:10:36,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-23 16:10:36,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:10:36,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 16:10:36,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 16:10:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 154 proven. 115 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2022-11-23 16:10:36,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:36,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 400)) is different from false [2022-11-23 16:10:36,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (v_ArrVal_1316 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 400)) is different from false [2022-11-23 16:10:37,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| Int) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1314 Int) (v_ArrVal_1316 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1313))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| 4)) v_ArrVal_1314) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1316)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1318) |c_~#queue~0.base|) .cse2) 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_131| (select .cse1 .cse2))))))) is different from false [2022-11-23 16:10:37,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:37,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 59 [2022-11-23 16:10:37,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:37,246 INFO L350 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 112 treesize of output 114 [2022-11-23 16:10:37,253 INFO L350 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 72 treesize of output 64 [2022-11-23 16:10:37,265 INFO L350 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 68 treesize of output 60 [2022-11-23 16:10:37,288 INFO L350 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 8 treesize of output 4 [2022-11-23 16:10:37,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:37,450 INFO L350 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 123 treesize of output 103 [2022-11-23 16:10:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 144 proven. 69 refuted. 0 times theorem prover too weak. 1465 trivial. 56 not checked. [2022-11-23 16:10:38,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708777418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:38,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591925939] [2022-11-23 16:10:38,197 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:10:38,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:38,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8, 9] total 42 [2022-11-23 16:10:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086390070] [2022-11-23 16:10:38,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:38,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 16:10:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 16:10:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1088, Unknown=3, NotChecked=228, Total=1722 [2022-11-23 16:10:38,202 INFO L87 Difference]: Start difference. First operand 1596 states and 2919 transitions. Second operand has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:47,723 INFO L93 Difference]: Finished difference Result 2307 states and 4159 transitions. [2022-11-23 16:10:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-23 16:10:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 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 200 [2022-11-23 16:10:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:47,732 INFO L225 Difference]: With dead ends: 2307 [2022-11-23 16:10:47,733 INFO L226 Difference]: Without dead ends: 2307 [2022-11-23 16:10:47,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 386 SyntacticMatches, 99 SemanticMatches, 119 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 9154 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=4137, Invalid=9678, Unknown=3, NotChecked=702, Total=14520 [2022-11-23 16:10:47,737 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2888 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 665 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2888 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:47,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2888 Valid, 14 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 724 Invalid, 3 Unknown, 511 Unchecked, 1.4s Time] [2022-11-23 16:10:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2022-11-23 16:10:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1566. [2022-11-23 16:10:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.8370607028753994) internal successors, (2875), 1565 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2875 transitions. [2022-11-23 16:10:47,781 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2875 transitions. Word has length 200 [2022-11-23 16:10:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:47,781 INFO L495 AbstractCegarLoop]: Abstraction has 1566 states and 2875 transitions. [2022-11-23 16:10:47,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2875 transitions. [2022-11-23 16:10:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-23 16:10:47,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:47,787 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:47,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:47,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:47,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:10:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1450663775, now seen corresponding path program 3 times [2022-11-23 16:10:47,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:47,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444143753] [2022-11-23 16:10:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:10:49,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444143753] [2022-11-23 16:10:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444143753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101552831] [2022-11-23 16:10:49,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:10:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:49,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:49,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 16:13:41,421 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:13:41,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:13:41,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 16:13:41,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:41,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:43,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101552831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1309050490] [2022-11-23 16:13:43,024 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:13:43,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:43,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2022-11-23 16:13:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544297611] [2022-11-23 16:13:43,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-23 16:13:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-23 16:13:43,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2022-11-23 16:13:43,028 INFO L87 Difference]: Start difference. First operand 1566 states and 2875 transitions. Second operand has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:44,512 INFO L93 Difference]: Finished difference Result 3186 states and 5818 transitions. [2022-11-23 16:13:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-23 16:13:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 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 208 [2022-11-23 16:13:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:44,526 INFO L225 Difference]: With dead ends: 3186 [2022-11-23 16:13:44,526 INFO L226 Difference]: Without dead ends: 3186 [2022-11-23 16:13:44,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2022-11-23 16:13:44,529 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1415 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:44,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 69 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 16:13:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2022-11-23 16:13:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3186. [2022-11-23 16:13:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.8266875981161697) internal successors, (5818), 3185 states have internal predecessors, (5818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 5818 transitions. [2022-11-23 16:13:44,626 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 5818 transitions. Word has length 208 [2022-11-23 16:13:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:44,627 INFO L495 AbstractCegarLoop]: Abstraction has 3186 states and 5818 transitions. [2022-11-23 16:13:44,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.4) internal successors, (407), 55 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 5818 transitions. [2022-11-23 16:13:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-11-23 16:13:44,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:44,643 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 52, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:44,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:44,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 16:13:44,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:13:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1088692858, now seen corresponding path program 4 times [2022-11-23 16:13:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:44,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196346262] [2022-11-23 16:13:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:50,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:13:50,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196346262] [2022-11-23 16:13:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196346262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:13:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010309657] [2022-11-23 16:13:50,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:13:50,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:50,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:13:50,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:13:50,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 16:13:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:50,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 16:13:50,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:51,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 0 proven. 8307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:55,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010309657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:55,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [386898602] [2022-11-23 16:13:55,492 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:13:55,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:55,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2022-11-23 16:13:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278152457] [2022-11-23 16:13:55,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:55,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-11-23 16:13:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:55,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-11-23 16:13:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2022-11-23 16:13:55,501 INFO L87 Difference]: Start difference. First operand 3186 states and 5818 transitions. Second operand has 109 states, 109 states have (on average 7.440366972477064) internal successors, (811), 109 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:14:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:14:01,040 INFO L93 Difference]: Finished difference Result 6426 states and 11704 transitions. [2022-11-23 16:14:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-23 16:14:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 7.440366972477064) internal successors, (811), 109 states have internal predecessors, (811), 0 states have call successors, (0), 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 410 [2022-11-23 16:14:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:14:01,063 INFO L225 Difference]: With dead ends: 6426 [2022-11-23 16:14:01,063 INFO L226 Difference]: Without dead ends: 6426 [2022-11-23 16:14:01,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2022-11-23 16:14:01,066 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3678 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3678 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 773 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:14:01,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3678 Valid, 123 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [773 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 16:14:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2022-11-23 16:14:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6426. [2022-11-23 16:14:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6426 states, 6425 states have (on average 1.8216342412451363) internal successors, (11704), 6425 states have internal predecessors, (11704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:14:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6426 states to 6426 states and 11704 transitions. [2022-11-23 16:14:01,212 INFO L78 Accepts]: Start accepts. Automaton has 6426 states and 11704 transitions. Word has length 410 [2022-11-23 16:14:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:14:01,213 INFO L495 AbstractCegarLoop]: Abstraction has 6426 states and 11704 transitions. [2022-11-23 16:14:01,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 7.440366972477064) internal successors, (811), 109 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:14:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 6426 states and 11704 transitions. [2022-11-23 16:14:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2022-11-23 16:14:01,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:14:01,253 INFO L195 NwaCegarLoop]: trace histogram [106, 106, 106, 106, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:14:01,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 16:14:01,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 16:14:01,463 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:14:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:14:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1536175098, now seen corresponding path program 5 times [2022-11-23 16:14:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:14:01,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847358871] [2022-11-23 16:14:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:14:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:14:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:14:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 0 proven. 34821 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:14:17,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:14:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847358871] [2022-11-23 16:14:17,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847358871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:14:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159702985] [2022-11-23 16:14:17,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:14:17,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:14:17,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:14:17,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:14:17,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 16:14:19,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 16:14:19,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:14:19,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-23 16:14:19,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:14:24,545 INFO L350 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 13 treesize of output 9 [2022-11-23 16:14:24,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:24,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 16:14:24,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:14:24,802 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 16:14:24,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-23 16:14:24,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:24,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 16:14:25,102 INFO L350 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 [2022-11-23 16:14:25,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:25,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 16:14:25,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:14:25,379 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 16:14:25,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-23 16:14:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:25,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 16:14:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 1400 proven. 525 refuted. 0 times theorem prover too weak. 32896 trivial. 0 not checked. [2022-11-23 16:14:25,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:14:26,065 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4481 Int) (v_ArrVal_4479 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (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) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_4479) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4481)) .cse1))))) is different from false [2022-11-23 16:14:26,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4481 Int) (v_ArrVal_4479 (Array Int Int))) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4479) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_4481)) .cse1))))) is different from false [2022-11-23 16:14:26,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_4481 Int) (v_ArrVal_4479 (Array Int Int)) (v_ArrVal_4475 Int)) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4475) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_4479) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_4481)) .cse2)))))))) is different from false [2022-11-23 16:14:26,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4481 Int) (v_ArrVal_4479 (Array Int Int)) (v_ArrVal_4475 Int) (v_ArrVal_4474 Int)) (let ((.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_4474)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4475) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_4479) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_4481)) .cse1)))) (= 400 .cse4))))) is different from false [2022-11-23 16:14:27,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:27,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-11-23 16:14:27,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:27,206 INFO L350 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 266 treesize of output 262 [2022-11-23 16:14:27,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 250 [2022-11-23 16:14:27,226 INFO L350 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 233 treesize of output 209 [2022-11-23 16:14:27,256 INFO L350 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 8 treesize of output 4 [2022-11-23 16:14:27,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:27,301 INFO L350 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 120 treesize of output 104 [2022-11-23 16:14:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 34821 backedges. 776 proven. 626 refuted. 104 times theorem prover too weak. 32896 trivial. 419 not checked. [2022-11-23 16:14:28,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159702985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:14:28,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585069893] [2022-11-23 16:14:28,613 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-23 16:14:28,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:14:28,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 11, 14] total 132 [2022-11-23 16:14:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472757255] [2022-11-23 16:14:28,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:14:28,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-11-23 16:14:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:14:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-11-23 16:14:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6000, Invalid=10252, Unknown=20, NotChecked=1020, Total=17292 [2022-11-23 16:14:28,623 INFO L87 Difference]: Start difference. First operand 6426 states and 11704 transitions. Second operand has 132 states, 132 states have (on average 6.7272727272727275) internal successors, (888), 132 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:23:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:23:47,749 INFO L93 Difference]: Finished difference Result 17306 states and 30516 transitions. [2022-11-23 16:23:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1179 states. [2022-11-23 16:23:47,750 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 6.7272727272727275) internal successors, (888), 132 states have internal predecessors, (888), 0 states have call successors, (0), 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 815 [2022-11-23 16:23:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:23:47,814 INFO L225 Difference]: With dead ends: 17306 [2022-11-23 16:23:47,814 INFO L226 Difference]: Without dead ends: 17306 [2022-11-23 16:23:47,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3862 GetRequests, 1922 SyntacticMatches, 638 SemanticMatches, 1302 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1268242 ImplicationChecksByTransitivity, 485.3s TimeCoverageRelationStatistics Valid=353604, Invalid=1335092, Unknown=20, NotChecked=10396, Total=1699112 [2022-11-23 16:23:47,987 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28389 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 9734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28389 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 9734 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1927 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-11-23 16:23:47,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28389 Valid, 46 Invalid, 16374 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [9734 Valid, 4713 Invalid, 0 Unknown, 1927 Unchecked, 16.7s Time] [2022-11-23 16:23:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17306 states. [2022-11-23 16:23:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17306 to 13449. [2022-11-23 16:23:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13449 states, 13448 states have (on average 1.7825698988697205) internal successors, (23972), 13448 states have internal predecessors, (23972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:23:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13449 states to 13449 states and 23972 transitions. [2022-11-23 16:23:48,354 INFO L78 Accepts]: Start accepts. Automaton has 13449 states and 23972 transitions. Word has length 815 [2022-11-23 16:23:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:23:48,355 INFO L495 AbstractCegarLoop]: Abstraction has 13449 states and 23972 transitions. [2022-11-23 16:23:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 6.7272727272727275) internal successors, (888), 132 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:23:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13449 states and 23972 transitions. [2022-11-23 16:23:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2022-11-23 16:23:48,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:23:48,389 INFO L195 NwaCegarLoop]: trace histogram [107, 107, 107, 107, 80, 80, 80, 80, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:23:48,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 16:23:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:23:48,604 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 16:23:48,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:23:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 493968553, now seen corresponding path program 6 times [2022-11-23 16:23:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:23:48,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197443373] [2022-11-23 16:23:48,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:23:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:23:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:24:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 38644 backedges. 0 proven. 38644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:24:04,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:24:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197443373] [2022-11-23 16:24:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197443373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:24:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632378883] [2022-11-23 16:24:04,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:24:04,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:24:04,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:24:04,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:24:04,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53fa1a1b-e5cd-4f6b-9d4f-8ae5ef52e173/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process