./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 04:20:53,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 04:20:53,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 04:20:53,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 04:20:53,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 04:20:53,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 04:20:53,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 04:20:53,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 04:20:53,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 04:20:53,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 04:20:53,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 04:20:53,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 04:20:53,688 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 04:20:53,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 04:20:53,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 04:20:53,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 04:20:53,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 04:20:53,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 04:20:53,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 04:20:53,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 04:20:53,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 04:20:53,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 04:20:53,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 04:20:53,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 04:20:53,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 04:20:53,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 04:20:53,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 04:20:53,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 04:20:53,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 04:20:53,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 04:20:53,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:20:53,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 04:20:53,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 04:20:53,699 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 04:20:53,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 04:20:53,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 04:20:53,700 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 04:20:53,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 04:20:53,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 04:20:53,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 04:20:53,701 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 04:20:53,702 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 04:20:53,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 04:20:53,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 04:20:53,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 04:20:53,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 04:20:53,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 04:20:53,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-10-19 04:20:55,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 04:20:55,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 04:20:55,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-10-19 04:20:55,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f26167ad1/bac2cd86ed1248b9a2af5831c5a662de/FLAGdda4848c6 [2024-10-19 04:20:56,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f26167ad1/bac2cd86ed1248b9a2af5831c5a662de [2024-10-19 04:20:56,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 04:20:56,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 04:20:56,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 04:20:56,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 04:20:56,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 04:20:56,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b94fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56, skipping insertion in model container [2024-10-19 04:20:56,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 04:20:56,301 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[8030,8043] [2024-10-19 04:20:56,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:20:56,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 04:20:56,375 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[8030,8043] [2024-10-19 04:20:56,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:20:56,399 INFO L204 MainTranslator]: Completed translation [2024-10-19 04:20:56,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56 WrapperNode [2024-10-19 04:20:56,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 04:20:56,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 04:20:56,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 04:20:56,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 04:20:56,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,463 INFO L138 Inliner]: procedures = 22, calls = 156, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 388 [2024-10-19 04:20:56,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 04:20:56,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 04:20:56,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 04:20:56,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 04:20:56,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 04:20:56,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 04:20:56,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 04:20:56,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 04:20:56,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (1/1) ... [2024-10-19 04:20:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:20:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:20:56,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 04:20:56,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 04:20:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 04:20:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 04:20:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 04:20:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 04:20:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 04:20:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 04:20:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 04:20:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-19 04:20:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-19 04:20:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 04:20:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 04:20:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 04:20:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 04:20:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 04:20:56,607 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 04:20:56,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 04:20:56,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 04:20:57,114 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 04:20:57,114 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 04:20:57,486 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 04:20:57,486 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 04:20:57,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:20:57 BoogieIcfgContainer [2024-10-19 04:20:57,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 04:20:57,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 04:20:57,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 04:20:57,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 04:20:57,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 04:20:56" (1/3) ... [2024-10-19 04:20:57,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a676244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:20:57, skipping insertion in model container [2024-10-19 04:20:57,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:20:56" (2/3) ... [2024-10-19 04:20:57,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a676244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:20:57, skipping insertion in model container [2024-10-19 04:20:57,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:20:57" (3/3) ... [2024-10-19 04:20:57,500 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2024-10-19 04:20:57,520 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 04:20:57,521 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 04:20:57,521 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 04:20:57,588 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 04:20:57,637 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 04:20:57,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 04:20:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:20:57,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 04:20:57,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 04:20:57,740 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 04:20:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:20:57,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 04:20:57,769 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@171ff089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 04:20:57,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 04:20:59,970 INFO L396 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)] === [2024-10-19 04:20:59,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:20:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1359955431, now seen corresponding path program 1 times [2024-10-19 04:20:59,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:20:59,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928712995] [2024-10-19 04:20:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:20:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928712995] [2024-10-19 04:21:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928712995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-19 04:21:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596285286] [2024-10-19 04:21:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 04:21:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:21:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-19 04:21:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:00,858 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:00,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:00,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1330024055, now seen corresponding path program 1 times [2024-10-19 04:21:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:01,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 984401699, now seen corresponding path program 1 times [2024-10-19 04:21:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 04:21:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-19 04:21:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1330024065, now seen corresponding path program 1 times [2024-10-19 04:21:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:02,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1341249058, now seen corresponding path program 1 times [2024-10-19 04:21:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:02,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1275959510, now seen corresponding path program 1 times [2024-10-19 04:21:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:03,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1926001971, now seen corresponding path program 1 times [2024-10-19 04:21:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:03,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash 452090600, now seen corresponding path program 1 times [2024-10-19 04:21:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 04:21:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-19 04:21:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1330024126, now seen corresponding path program 1 times [2024-10-19 04:21:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1341248999, now seen corresponding path program 1 times [2024-10-19 04:21:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1926002001, now seen corresponding path program 1 times [2024-10-19 04:21:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:04,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 324873054, now seen corresponding path program 1 times [2024-10-19 04:21:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:21:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2024-10-19 04:21:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1330024146, now seen corresponding path program 1 times [2024-10-19 04:21:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:06,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:06,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1926002026, now seen corresponding path program 1 times [2024-10-19 04:21:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:06,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-10-19 04:21:06,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:06,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -827029775, now seen corresponding path program 2 times [2024-10-19 04:21:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249104732] [2024-10-19 04:21:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249104732] [2024-10-19 04:21:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249104732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-19 04:21:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624347114] [2024-10-19 04:21:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:07,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 04:21:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:21:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-19 04:21:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:07,182 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:07,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:07,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:07,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1330024182, now seen corresponding path program 1 times [2024-10-19 04:21:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:07,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1926002052, now seen corresponding path program 1 times [2024-10-19 04:21:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:07,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1147783301, now seen corresponding path program 1 times [2024-10-19 04:21:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 04:21:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2024-10-19 04:21:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1926002068, now seen corresponding path program 1 times [2024-10-19 04:21:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:08,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 957202572, now seen corresponding path program 1 times [2024-10-19 04:21:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:08,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -480778802, now seen corresponding path program 1 times [2024-10-19 04:21:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:21:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2024-10-19 04:21:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash 957202606, now seen corresponding path program 1 times [2024-10-19 04:21:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:11,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash -627847664, now seen corresponding path program 1 times [2024-10-19 04:21:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:12,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:21:13,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1928, Unknown=0, NotChecked=0, Total=2352 [2024-10-19 04:21:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 957202698, now seen corresponding path program 1 times [2024-10-19 04:21:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:13,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1953045422, now seen corresponding path program 1 times [2024-10-19 04:21:14,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1608268033, now seen corresponding path program 1 times [2024-10-19 04:21:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -813858227, now seen corresponding path program 1 times [2024-10-19 04:21:14,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:14,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1929720432, now seen corresponding path program 1 times [2024-10-19 04:21:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 04:21:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=3061, Unknown=0, NotChecked=0, Total=3660 [2024-10-19 04:21:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 957202791, now seen corresponding path program 1 times [2024-10-19 04:21:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:16,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1953045511, now seen corresponding path program 1 times [2024-10-19 04:21:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:17,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1608268114, now seen corresponding path program 1 times [2024-10-19 04:21:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:17,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:17,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1085976897, now seen corresponding path program 1 times [2024-10-19 04:21:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,474 INFO L85 PathProgramCache]: Analyzing trace with hash 668531081, now seen corresponding path program 1 times [2024-10-19 04:21:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 268052244, now seen corresponding path program 1 times [2024-10-19 04:21:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 560857390, now seen corresponding path program 1 times [2024-10-19 04:21:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:18,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2137880391, now seen corresponding path program 1 times [2024-10-19 04:21:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:19,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -405150454, now seen corresponding path program 1 times [2024-10-19 04:21:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:20,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -602947211, now seen corresponding path program 1 times [2024-10-19 04:21:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:21:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=921, Invalid=6219, Unknown=0, NotChecked=0, Total=7140 [2024-10-19 04:21:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1953045796, now seen corresponding path program 1 times [2024-10-19 04:21:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:22,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1608268397, now seen corresponding path program 1 times [2024-10-19 04:21:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:22,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2137880580, now seen corresponding path program 1 times [2024-10-19 04:21:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:23,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash -405150301, now seen corresponding path program 1 times [2024-10-19 04:21:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:24,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2085404506, now seen corresponding path program 1 times [2024-10-19 04:21:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 04:21:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1162, Invalid=8738, Unknown=0, NotChecked=0, Total=9900 [2024-10-19 04:21:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:28,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable43,SelfDestructingSolverStorable22,SelfDestructingSolverStorable44,SelfDestructingSolverStorable23,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable46,SelfDestructingSolverStorable25,SelfDestructingSolverStorable47,SelfDestructingSolverStorable26,SelfDestructingSolverStorable48,SelfDestructingSolverStorable27,SelfDestructingSolverStorable49,SelfDestructingSolverStorable28 [2024-10-19 04:21:28,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 495852733, now seen corresponding path program 3 times [2024-10-19 04:21:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492567192] [2024-10-19 04:21:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492567192] [2024-10-19 04:21:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492567192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-19 04:21:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965630408] [2024-10-19 04:21:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-19 04:21:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 04:21:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-19 04:21:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:29,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:29,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:29,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:29,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 04:21:29,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-19 04:21:33,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:33,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash 158038665, now seen corresponding path program 4 times [2024-10-19 04:21:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406651334] [2024-10-19 04:21:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:33,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:33,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406651334] [2024-10-19 04:21:33,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406651334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:33,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:33,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-19 04:21:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878692951] [2024-10-19 04:21:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:33,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-19 04:21:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:33,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-19 04:21:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-19 04:21:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:33,409 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:33,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:33,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:33,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:33,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:33,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-19 04:21:36,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1247773203, now seen corresponding path program 5 times [2024-10-19 04:21:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076502636] [2024-10-19 04:21:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076502636] [2024-10-19 04:21:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076502636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-19 04:21:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952033731] [2024-10-19 04:21:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:36,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-19 04:21:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 04:21:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-19 04:21:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:36,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:36,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:36,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:36,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:36,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:36,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:21:40,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-19 04:21:40,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:40,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1027861023, now seen corresponding path program 6 times [2024-10-19 04:21:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493922901] [2024-10-19 04:21:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493922901] [2024-10-19 04:21:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493922901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-19 04:21:40,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139195760] [2024-10-19 04:21:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:40,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-19 04:21:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-19 04:21:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-19 04:21:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:40,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:40,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:21:40,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -440228908, now seen corresponding path program 1 times [2024-10-19 04:21:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:44,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:21:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:21:44,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,SelfDestructingSolverStorable56 [2024-10-19 04:21:44,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:21:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:21:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1933828025, now seen corresponding path program 7 times [2024-10-19 04:21:44,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:21:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510569106] [2024-10-19 04:21:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 04:21:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510569106] [2024-10-19 04:21:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510569106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:21:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:21:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-19 04:21:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441003676] [2024-10-19 04:21:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:21:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 04:21:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 04:21:45,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 04:21:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-19 04:21:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:45,781 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:21:45,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:21:45,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:45,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:21:45,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:45,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:21:45,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:21:45,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:21:45,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:21:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -440228463, now seen corresponding path program 1 times [2024-10-19 04:21:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:49,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1267841867, now seen corresponding path program 1 times [2024-10-19 04:21:49,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:21:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1504, Invalid=12538, Unknown=0, NotChecked=0, Total=14042 [2024-10-19 04:21:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash -440227987, now seen corresponding path program 1 times [2024-10-19 04:21:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:54,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 64316267, now seen corresponding path program 1 times [2024-10-19 04:21:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:55,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:21:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:21:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash -219098936, now seen corresponding path program 1 times [2024-10-19 04:21:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:55,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:21:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:21:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:21:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:21:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-19 04:21:56,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2008, Invalid=17174, Unknown=0, NotChecked=0, Total=19182 [2024-10-19 04:22:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -440227450, now seen corresponding path program 1 times [2024-10-19 04:22:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:00,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 64316794, now seen corresponding path program 1 times [2024-10-19 04:22:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:01,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1278919198, now seen corresponding path program 1 times [2024-10-19 04:22:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:01,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 04:22:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2097, Invalid=18209, Unknown=0, NotChecked=0, Total=20306 [2024-10-19 04:22:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -440226961, now seen corresponding path program 1 times [2024-10-19 04:22:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:04,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash 64317263, now seen corresponding path program 1 times [2024-10-19 04:22:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:05,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 77583720, now seen corresponding path program 1 times [2024-10-19 04:22:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:05,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 914159565, now seen corresponding path program 1 times [2024-10-19 04:22:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:22:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=20300, Unknown=0, NotChecked=0, Total=22650 [2024-10-19 04:22:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash 64317794, now seen corresponding path program 1 times [2024-10-19 04:22:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:10,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 77584251, now seen corresponding path program 1 times [2024-10-19 04:22:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:10,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 04:22:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 04:22:11,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable60,SelfDestructingSolverStorable71,SelfDestructingSolverStorable61,SelfDestructingSolverStorable72,SelfDestructingSolverStorable62,SelfDestructingSolverStorable73,SelfDestructingSolverStorable63,SelfDestructingSolverStorable74,SelfDestructingSolverStorable64,SelfDestructingSolverStorable75,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable57,SelfDestructingSolverStorable68,SelfDestructingSolverStorable58,SelfDestructingSolverStorable69,SelfDestructingSolverStorable59 [2024-10-19 04:22:11,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 04:22:11,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:22:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1332682831, now seen corresponding path program 8 times [2024-10-19 04:22:11,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 04:22:11,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359921809] [2024-10-19 04:22:11,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:11,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-10-19 04:22:11,193 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@2584dcd1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1302) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:439) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:84) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-19 04:22:11,197 INFO L158 Benchmark]: Toolchain (without parser) took 75164.59ms. Allocated memory was 184.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 127.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,198 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 184.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 04:22:11,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.28ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 111.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 184.5MB. Free memory was 111.7MB in the beginning and 108.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,199 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 184.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,200 INFO L158 Benchmark]: RCFGBuilder took 976.33ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 106.5MB in the beginning and 166.2MB in the end (delta: -59.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,200 INFO L158 Benchmark]: TraceAbstraction took 73705.06ms. Allocated memory was 245.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 165.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-10-19 04:22:11,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 184.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.28ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 111.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 184.5MB. Free memory was 111.7MB in the beginning and 108.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 184.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 976.33ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 106.5MB in the beginning and 166.2MB in the end (delta: -59.7MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * TraceAbstraction took 73705.06ms. Allocated memory was 245.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 165.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@2584dcd1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@2584dcd1: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-19 04:22:11,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 04:22:11,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 04:22:13,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 04:22:13,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-19 04:22:13,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 04:22:13,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 04:22:13,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 04:22:13,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 04:22:13,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 04:22:13,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 04:22:13,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 04:22:13,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 04:22:13,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 04:22:13,834 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 04:22:13,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 04:22:13,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 04:22:13,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 04:22:13,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 04:22:13,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 04:22:13,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 04:22:13,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 04:22:13,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 04:22:13,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-19 04:22:13,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 04:22:13,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-19 04:22:13,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 04:22:13,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 04:22:13,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 04:22:13,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 04:22:13,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 04:22:13,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 04:22:13,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 04:22:13,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:22:13,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 04:22:13,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 04:22:13,841 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 04:22:13,842 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-19 04:22:13,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 04:22:13,842 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 04:22:13,843 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-19 04:22:13,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 04:22:13,843 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-19 04:22:13,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 04:22:13,845 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 04:22:13,845 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 04:22:14,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 04:22:14,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 04:22:14,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 04:22:14,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 04:22:14,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 04:22:14,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-10-19 04:22:15,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 04:22:15,940 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 04:22:15,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-10-19 04:22:15,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/60183da69/6b9f39b70455408c9540eb8024d755d5/FLAG3a98fec96 [2024-10-19 04:22:15,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/60183da69/6b9f39b70455408c9540eb8024d755d5 [2024-10-19 04:22:15,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 04:22:15,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 04:22:15,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 04:22:15,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 04:22:15,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 04:22:15,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:22:15" (1/1) ... [2024-10-19 04:22:15,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2886b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:15, skipping insertion in model container [2024-10-19 04:22:15,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 04:22:15" (1/1) ... [2024-10-19 04:22:16,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 04:22:16,256 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[8030,8043] [2024-10-19 04:22:16,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:22:16,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 04:22:16,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[8030,8043] [2024-10-19 04:22:16,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 04:22:16,359 INFO L204 MainTranslator]: Completed translation [2024-10-19 04:22:16,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16 WrapperNode [2024-10-19 04:22:16,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 04:22:16,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 04:22:16,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 04:22:16,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 04:22:16,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,425 INFO L138 Inliner]: procedures = 22, calls = 156, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 379 [2024-10-19 04:22:16,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 04:22:16,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 04:22:16,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 04:22:16,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 04:22:16,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 04:22:16,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 04:22:16,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 04:22:16,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 04:22:16,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (1/1) ... [2024-10-19 04:22:16,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 04:22:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:22:16,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 04:22:16,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 04:22:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 04:22:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 04:22:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 04:22:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 04:22:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 04:22:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 04:22:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 04:22:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-19 04:22:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-19 04:22:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-19 04:22:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 04:22:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 04:22:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 04:22:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 04:22:16,588 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 04:22:16,701 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 04:22:16,703 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 04:22:17,188 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 04:22:17,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 04:22:17,525 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 04:22:17,525 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 04:22:17,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:22:17 BoogieIcfgContainer [2024-10-19 04:22:17,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 04:22:17,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 04:22:17,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 04:22:17,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 04:22:17,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 04:22:15" (1/3) ... [2024-10-19 04:22:17,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f555006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:22:17, skipping insertion in model container [2024-10-19 04:22:17,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 04:22:16" (2/3) ... [2024-10-19 04:22:17,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f555006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 04:22:17, skipping insertion in model container [2024-10-19 04:22:17,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 04:22:17" (3/3) ... [2024-10-19 04:22:17,537 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2024-10-19 04:22:17,552 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 04:22:17,553 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 04:22:17,553 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 04:22:17,618 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 04:22:17,658 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 04:22:17,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 04:22:17,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 04:22:17,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 04:22:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 04:22:17,767 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 04:22:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:22:17,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 04:22:17,794 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6be6f4de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 04:22:17,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 04:22:20,666 INFO L396 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)] === [2024-10-19 04:22:20,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 04:22:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 44844375, now seen corresponding path program 1 times [2024-10-19 04:22:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 04:22:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926116459] [2024-10-19 04:22:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 04:22:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 04:22:20,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 04:22:20,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-19 04:22:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:20,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-19 04:22:20,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 04:22:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 04:22:21,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 04:22:21,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 04:22:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926116459] [2024-10-19 04:22:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926116459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 04:22:21,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 04:22:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-19 04:22:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990362445] [2024-10-19 04:22:21,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 04:22:21,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 04:22:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 04:22:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 04:22:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-19 04:22:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:22:21,139 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 04:22:21,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 04:22:21,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 04:22:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash 35793063, now seen corresponding path program 1 times [2024-10-19 04:22:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:22,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 04:22:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 04:22:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1806234917, now seen corresponding path program 1 times [2024-10-19 04:22:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 04:22:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 04:22:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 04:22:27,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-19 04:22:28,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-19 04:22:28,080 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 15135 column 218: unknown constant nat2bv (Int) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:584) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.postprocessInterpolant(NestedInterpolantsBuilder.java:393) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.buildPredicates(NestedInterpolantsBuilder.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:156) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-19 04:22:28,088 INFO L158 Benchmark]: Toolchain (without parser) took 12111.06ms. Allocated memory was 65.0MB in the beginning and 383.8MB in the end (delta: 318.8MB). Free memory was 45.3MB in the beginning and 331.1MB in the end (delta: -285.8MB). Peak memory consumption was 239.6MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,088 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 04:22:28,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 29.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.37ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 44.1MB in the end (delta: -15.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,092 INFO L158 Benchmark]: Boogie Preprocessor took 65.37ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 42.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,093 INFO L158 Benchmark]: RCFGBuilder took 1034.13ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 42.0MB in the beginning and 36.9MB in the end (delta: 5.1MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,094 INFO L158 Benchmark]: TraceAbstraction took 10558.64ms. Allocated memory was 79.7MB in the beginning and 383.8MB in the end (delta: 304.1MB). Free memory was 35.3MB in the beginning and 331.1MB in the end (delta: -295.8MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. [2024-10-19 04:22:28,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 29.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.37ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 44.1MB in the end (delta: -15.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.37ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 42.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1034.13ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 42.0MB in the beginning and 36.9MB in the end (delta: 5.1MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10558.64ms. Allocated memory was 79.7MB in the beginning and 383.8MB in the end (delta: 304.1MB). Free memory was 35.3MB in the beginning and 331.1MB in the end (delta: -295.8MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 15135 column 218: unknown constant nat2bv (Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 15135 column 218: unknown constant nat2bv (Int) : de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-19 04:22:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 04:22:28,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: line 15135 column 218: unknown constant nat2bv (Int)