./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:35:25,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:35:25,157 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:35:25,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:35:25,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:35:25,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:35:25,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:35:25,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:35:25,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:35:25,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:35:25,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:35:25,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:35:25,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:35:25,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:35:25,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:35:25,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:35:25,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:35:25,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:35:25,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:35:25,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:35:25,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:35:25,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:35:25,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:35:25,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:35:25,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:35:25,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:35:25,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:35:25,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:35:25,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:35:25,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:35:25,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:35:25,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd 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 -> Automizer 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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2024-11-13 14:35:25,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:35:25,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:35:25,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:35:25,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:35:25,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:35:25,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c Unable to find full path for "g++" [2024-11-13 14:35:27,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:35:27,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:35:27,979 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2024-11-13 14:35:28,010 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/data/81099c591/10769555d41947a799e4504fd2f4ecea/FLAG242e900ab [2024-11-13 14:35:28,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/data/81099c591/10769555d41947a799e4504fd2f4ecea [2024-11-13 14:35:28,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:35:28,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:35:28,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:35:28,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:35:28,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:35:28,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b10dd48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28, skipping insertion in model container [2024-11-13 14:35:28,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:35:28,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-11-13 14:35:28,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:35:28,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:35:28,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-11-13 14:35:28,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:35:28,476 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:35:28,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28 WrapperNode [2024-11-13 14:35:28,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:35:28,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:35:28,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:35:28,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:35:28,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,525 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-13 14:35:28,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:35:28,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:35:28,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:35:28,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:35:28,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,565 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:35:28,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:35:28,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:35:28,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:35:28,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:35:28,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (1/1) ... [2024-11-13 14:35:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:35:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:28,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:35:28,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:35:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:35:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 14:35:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 14:35:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 14:35:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 14:35:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 14:35:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 14:35:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-13 14:35:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-13 14:35:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:35:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:35:28,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:35:28,666 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:35:28,783 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:35:28,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:35:29,061 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:35:29,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:35:29,293 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:35:29,294 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 14:35:29,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:35:29 BoogieIcfgContainer [2024-11-13 14:35:29,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:35:29,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:35:29,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:35:29,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:35:29,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:35:28" (1/3) ... [2024-11-13 14:35:29,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344e2e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:35:29, skipping insertion in model container [2024-11-13 14:35:29,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:35:28" (2/3) ... [2024-11-13 14:35:29,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344e2e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:35:29, skipping insertion in model container [2024-11-13 14:35:29,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:35:29" (3/3) ... [2024-11-13 14:35:29,310 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-11-13 14:35:29,330 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:35:29,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x4.wvr.c that has 5 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-13 14:35:29,332 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:35:29,416 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-13 14:35:29,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-11-13 14:35:29,510 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-13 14:35:29,515 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 14:35:29,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-13 14:35:29,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-11-13 14:35:29,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2024-11-13 14:35:29,540 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:35:29,564 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=PETRI_NET, 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;@245ebb17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:35:29,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 14:35:29,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:35:29,593 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-13 14:35:29,593 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 14:35:29,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:29,594 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:29,595 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-11-13 14:35:29,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash -157430017, now seen corresponding path program 1 times [2024-11-13 14:35:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191771715] [2024-11-13 14:35:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191771715] [2024-11-13 14:35:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191771715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:30,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:35:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095953748] [2024-11-13 14:35:30,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:35:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:35:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:35:30,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:30,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:30,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:30,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:30,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:30,705 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2024-11-13 14:35:30,705 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-11-13 14:35:30,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5585 event pairs, 123 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2024-11-13 14:35:30,725 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2024-11-13 14:35:30,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2024-11-13 14:35:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:35:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:35:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-11-13 14:35:30,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-13 14:35:30,742 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2024-11-13 14:35:30,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2024-11-13 14:35:30,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-13 14:35:30,755 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2024-11-13 14:35:30,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2024-11-13 14:35:30,762 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-13 14:35:30,762 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2024-11-13 14:35:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:35:30,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:30,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:35:30,763 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-11-13 14:35:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1588458044, now seen corresponding path program 1 times [2024-11-13 14:35:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430139836] [2024-11-13 14:35:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430139836] [2024-11-13 14:35:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430139836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747970329] [2024-11-13 14:35:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:31,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:31,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:31,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:31,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:31,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:31,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:31,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:31,561 INFO L124 PetriNetUnfolderBase]: 1593/2038 cut-off events. [2024-11-13 14:35:31,562 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2024-11-13 14:35:31,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2038 events. 1593/2038 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7034 event pairs, 113 based on Foata normal form. 34/2060 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2024-11-13 14:35:31,580 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-11-13 14:35:31,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 391 flow [2024-11-13 14:35:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-11-13 14:35:31,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-13 14:35:31,582 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 115 transitions. [2024-11-13 14:35:31,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 391 flow [2024-11-13 14:35:31,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:35:31,585 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2024-11-13 14:35:31,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2024-11-13 14:35:31,587 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2024-11-13 14:35:31,587 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2024-11-13 14:35:31,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:31,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:31,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:35:31,588 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-11-13 14:35:31,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1292697606, now seen corresponding path program 1 times [2024-11-13 14:35:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013512655] [2024-11-13 14:35:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:31,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:31,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013512655] [2024-11-13 14:35:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013512655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:31,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841700203] [2024-11-13 14:35:31,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:31,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:31,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:31,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:31,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:31,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:31,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:31,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:32,310 INFO L124 PetriNetUnfolderBase]: 1921/2549 cut-off events. [2024-11-13 14:35:32,311 INFO L125 PetriNetUnfolderBase]: For 3334/3334 co-relation queries the response was YES. [2024-11-13 14:35:32,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 2549 events. 1921/2549 cut-off events. For 3334/3334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10112 event pairs, 288 based on Foata normal form. 64/2541 useless extension candidates. Maximal degree in co-relation 3126. Up to 1063 conditions per place. [2024-11-13 14:35:32,335 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-11-13 14:35:32,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2024-11-13 14:35:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-13 14:35:32,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-13 14:35:32,337 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 108 transitions. [2024-11-13 14:35:32,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2024-11-13 14:35:32,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 14:35:32,346 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2024-11-13 14:35:32,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-11-13 14:35:32,349 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-11-13 14:35:32,349 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2024-11-13 14:35:32,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:32,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:32,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:35:32,350 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-11-13 14:35:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -86519970, now seen corresponding path program 2 times [2024-11-13 14:35:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549745224] [2024-11-13 14:35:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549745224] [2024-11-13 14:35:32,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549745224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:32,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776794568] [2024-11-13 14:35:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:32,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:32,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:32,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:32,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:32,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:33,141 INFO L124 PetriNetUnfolderBase]: 1835/2445 cut-off events. [2024-11-13 14:35:33,141 INFO L125 PetriNetUnfolderBase]: For 4078/4078 co-relation queries the response was YES. [2024-11-13 14:35:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9087 conditions, 2445 events. 1835/2445 cut-off events. For 4078/4078 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9926 event pairs, 348 based on Foata normal form. 90/2505 useless extension candidates. Maximal degree in co-relation 4692. Up to 1412 conditions per place. [2024-11-13 14:35:33,167 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 83 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2024-11-13 14:35:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 649 flow [2024-11-13 14:35:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-11-13 14:35:33,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-11-13 14:35:33,172 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 114 transitions. [2024-11-13 14:35:33,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 649 flow [2024-11-13 14:35:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 14:35:33,195 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 264 flow [2024-11-13 14:35:33,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-11-13 14:35:33,197 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-13 14:35:33,197 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 264 flow [2024-11-13 14:35:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:33,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:33,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:35:33,198 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-11-13 14:35:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2030327583, now seen corresponding path program 1 times [2024-11-13 14:35:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449189402] [2024-11-13 14:35:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449189402] [2024-11-13 14:35:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449189402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219590354] [2024-11-13 14:35:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:33,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:33,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:33,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:33,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:33,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:33,876 INFO L124 PetriNetUnfolderBase]: 1783/2380 cut-off events. [2024-11-13 14:35:33,876 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2024-11-13 14:35:33,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 2380 events. 1783/2380 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9700 event pairs, 131 based on Foata normal form. 52/2423 useless extension candidates. Maximal degree in co-relation 5285. Up to 1057 conditions per place. [2024-11-13 14:35:33,909 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 84 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2024-11-13 14:35:33,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 673 flow [2024-11-13 14:35:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-13 14:35:33,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-13 14:35:33,912 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 264 flow. Second operand 5 states and 113 transitions. [2024-11-13 14:35:33,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 673 flow [2024-11-13 14:35:33,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 664 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-13 14:35:33,937 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 269 flow [2024-11-13 14:35:33,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-11-13 14:35:33,940 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2024-11-13 14:35:33,942 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 269 flow [2024-11-13 14:35:33,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:33,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:33,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:33,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:35:33,943 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-11-13 14:35:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash -585528686, now seen corresponding path program 2 times [2024-11-13 14:35:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831612074] [2024-11-13 14:35:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831612074] [2024-11-13 14:35:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831612074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:34,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920642659] [2024-11-13 14:35:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:34,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:34,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:34,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:34,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:34,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:34,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:34,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:34,554 INFO L124 PetriNetUnfolderBase]: 1610/2155 cut-off events. [2024-11-13 14:35:34,554 INFO L125 PetriNetUnfolderBase]: For 6944/6944 co-relation queries the response was YES. [2024-11-13 14:35:34,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 2155 events. 1610/2155 cut-off events. For 6944/6944 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8179 event pairs, 91 based on Foata normal form. 31/2140 useless extension candidates. Maximal degree in co-relation 5267. Up to 897 conditions per place. [2024-11-13 14:35:34,598 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2024-11-13 14:35:34,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 889 flow [2024-11-13 14:35:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-11-13 14:35:34,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-11-13 14:35:34,600 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 269 flow. Second operand 5 states and 107 transitions. [2024-11-13 14:35:34,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 889 flow [2024-11-13 14:35:34,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 864 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-13 14:35:34,612 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 321 flow [2024-11-13 14:35:34,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-13 14:35:34,613 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-13 14:35:34,614 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 321 flow [2024-11-13 14:35:34,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:34,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:34,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:35:34,616 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-11-13 14:35:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -775209253, now seen corresponding path program 1 times [2024-11-13 14:35:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430480753] [2024-11-13 14:35:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:34,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430480753] [2024-11-13 14:35:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430480753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68350631] [2024-11-13 14:35:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:34,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:34,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:34,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:34,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:34,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:34,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:35,284 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2024-11-13 14:35:35,285 INFO L125 PetriNetUnfolderBase]: For 7108/7108 co-relation queries the response was YES. [2024-11-13 14:35:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 2122 events. 1577/2122 cut-off events. For 7108/7108 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8146 event pairs, 71 based on Foata normal form. 33/2109 useless extension candidates. Maximal degree in co-relation 6031. Up to 983 conditions per place. [2024-11-13 14:35:35,311 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2024-11-13 14:35:35,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 873 flow [2024-11-13 14:35:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-13 14:35:35,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-13 14:35:35,313 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 321 flow. Second operand 5 states and 105 transitions. [2024-11-13 14:35:35,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 873 flow [2024-11-13 14:35:35,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 862 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-13 14:35:35,325 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 324 flow [2024-11-13 14:35:35,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-11-13 14:35:35,326 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2024-11-13 14:35:35,326 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 324 flow [2024-11-13 14:35:35,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:35,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:35,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:35,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:35:35,328 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-11-13 14:35:35,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638409, now seen corresponding path program 2 times [2024-11-13 14:35:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:35,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738815976] [2024-11-13 14:35:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:35,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:35,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738815976] [2024-11-13 14:35:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738815976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101115281] [2024-11-13 14:35:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:35,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:35,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:35,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:35,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:35,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:35,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:35,868 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2024-11-13 14:35:35,868 INFO L125 PetriNetUnfolderBase]: For 7421/7421 co-relation queries the response was YES. [2024-11-13 14:35:35,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2072 events. 1515/2072 cut-off events. For 7421/7421 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8404 event pairs, 258 based on Foata normal form. 62/2076 useless extension candidates. Maximal degree in co-relation 6059. Up to 1124 conditions per place. [2024-11-13 14:35:35,886 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-11-13 14:35:35,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 893 flow [2024-11-13 14:35:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-11-13 14:35:35,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-11-13 14:35:35,888 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 324 flow. Second operand 5 states and 103 transitions. [2024-11-13 14:35:35,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 893 flow [2024-11-13 14:35:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 880 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-13 14:35:35,899 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 364 flow [2024-11-13 14:35:35,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-11-13 14:35:35,900 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2024-11-13 14:35:35,900 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 364 flow [2024-11-13 14:35:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:35,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:35,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:35,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:35:35,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 14:35:35,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash 877389249, now seen corresponding path program 2 times [2024-11-13 14:35:35,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:35,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152133345] [2024-11-13 14:35:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152133345] [2024-11-13 14:35:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152133345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:35:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:35:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:35:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910075660] [2024-11-13 14:35:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:35:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:35:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:35:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:35:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:35:36,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:35:36,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:36,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:35:36,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:35:36,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:35:36,447 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2024-11-13 14:35:36,447 INFO L125 PetriNetUnfolderBase]: For 7054/7054 co-relation queries the response was YES. [2024-11-13 14:35:36,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 1987 events. 1447/1987 cut-off events. For 7054/7054 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8130 event pairs, 375 based on Foata normal form. 68/2029 useless extension candidates. Maximal degree in co-relation 8664. Up to 1150 conditions per place. [2024-11-13 14:35:36,465 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2024-11-13 14:35:36,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1094 flow [2024-11-13 14:35:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:35:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:35:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-13 14:35:36,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-11-13 14:35:36,467 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 364 flow. Second operand 5 states and 111 transitions. [2024-11-13 14:35:36,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1094 flow [2024-11-13 14:35:36,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-13 14:35:36,485 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2024-11-13 14:35:36,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-13 14:35:36,486 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-13 14:35:36,486 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2024-11-13 14:35:36,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-13 14:35:36,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:35:36,486 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:35:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:35:36,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 14:35:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:35:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2145237292, now seen corresponding path program 1 times [2024-11-13 14:35:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:35:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062486910] [2024-11-13 14:35:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:35:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:35:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:35:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062486910] [2024-11-13 14:35:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062486910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:35:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36182938] [2024-11-13 14:35:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:35:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:35:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:35:37,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:35:37,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:35:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:35:38,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:35:38,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:37:10,970 WARN L286 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:37:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:37:52,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:38:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:38:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36182938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:38:20,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:38:20,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-13 14:38:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909487123] [2024-11-13 14:38:20,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:38:20,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:38:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:38:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:38:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=168, Unknown=16, NotChecked=0, Total=240 [2024-11-13 14:38:20,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:38:20,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-13 14:38:20,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:38:20,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:38:20,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:38:29,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:38:47,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:38:51,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:38:58,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:02,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:06,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:10,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:14,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:16,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:20,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:22,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:24,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:28,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:31,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:35,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:39,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:43,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:46,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:50,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:54,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:39:58,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:28,254 WARN L286 SmtUtils]: Spent 1.88m on a formula simplification. DAG size of input: 56 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:42:32,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:36,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:40,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:44,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:48,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:52,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:42:56,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:00,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:04,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:08,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:12,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:16,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:20,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:24,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:28,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:32,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:36,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:40,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:44,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:48,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:52,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:56,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:43:57,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:01,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:06,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:10,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:11,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:15,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:19,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:23,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:27,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:31,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:46,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:50,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:54,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:58,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:02,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:06,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:10,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:14,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:18,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:22,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:26,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:30,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:34,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:38,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:42,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:46,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:48,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:53,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:45:57,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:01,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:05,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:09,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:12,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:19,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:38,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:40,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:44,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:46,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:55,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:46:57,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:01,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:05,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:09,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:13,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:17,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:21,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:25,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:46,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:50,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:54,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:58,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:02,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:06,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:10,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:11,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:15,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:19,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:23,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:25,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:28,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:32,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:36,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:37,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:41,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:45,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:49,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:53,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:57,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:48:58,685 INFO L124 PetriNetUnfolderBase]: 2338/3220 cut-off events. [2024-11-13 14:48:58,685 INFO L125 PetriNetUnfolderBase]: For 11315/11315 co-relation queries the response was YES. [2024-11-13 14:48:58,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15952 conditions, 3220 events. 2338/3220 cut-off events. For 11315/11315 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14258 event pairs, 265 based on Foata normal form. 7/3205 useless extension candidates. Maximal degree in co-relation 14333. Up to 1953 conditions per place. [2024-11-13 14:48:58,715 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 80 changer transitions 17/277 dead transitions. [2024-11-13 14:48:58,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 277 transitions, 2413 flow [2024-11-13 14:48:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:48:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-13 14:48:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 363 transitions. [2024-11-13 14:48:58,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2024-11-13 14:48:58,719 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 401 flow. Second operand 18 states and 363 transitions. [2024-11-13 14:48:58,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 277 transitions, 2413 flow [2024-11-13 14:48:58,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 277 transitions, 2352 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-11-13 14:48:58,752 INFO L231 Difference]: Finished difference. Result has 97 places, 133 transitions, 1388 flow [2024-11-13 14:48:58,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1388, PETRI_PLACES=97, PETRI_TRANSITIONS=133} [2024-11-13 14:48:58,755 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 61 predicate places. [2024-11-13 14:48:58,755 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 133 transitions, 1388 flow [2024-11-13 14:48:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 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-11-13 14:48:58,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:48:58,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:48:58,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:48:58,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:48:58,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 14:48:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -730596706, now seen corresponding path program 2 times [2024-11-13 14:48:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908404422] [2024-11-13 14:48:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:48:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908404422] [2024-11-13 14:48:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908404422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297660342] [2024-11-13 14:48:59,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:48:59,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:59,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:59,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de836b3a-70c4-4d61-ad30-bf740050e73c/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:49:00,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:49:00,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:49:00,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:49:00,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:43,840 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 33 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:49:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:49:44,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:49:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297660342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:49:46,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:49:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-13 14:49:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628644642] [2024-11-13 14:49:46,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:46,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:49:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:49:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:49:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:49:46,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-13 14:49:46,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 133 transitions, 1388 flow. Second operand has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 0 states have call successors, (0), 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-11-13 14:49:46,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:49:46,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-13 14:49:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:49:55,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:59,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:03,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:07,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:11,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:16,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:20,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:22,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:26,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:33,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:37,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:42,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:44,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:49,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod (div c_~x4~0 4) 4294967296)) (.cse2 (mod c_~x1~0 4294967296)) (.cse3 (mod c_~x3~0 4294967296))) (and (<= (+ .cse0 1) .cse1) (= .cse2 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x4~0 4294967296)) (= .cse0 .cse3) (= .cse0 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 4)) 4294967296)) (<= 1 .cse2) (<= 1 .cse3) (= (mod c_~x4~0 4) 0) (= (mod (* c_~x3~0 3) 4) 0))) is different from false