./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu --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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:29,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:29,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:33:29,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:29,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:29,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:29,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:29,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:29,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:29,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:29,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:29,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:29,517 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:29,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:29,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:33:29,519 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:29,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:29,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:29,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:29,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:33:29,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:29,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:33:29,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:29,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:33:29,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:29,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:29,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:29,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:29,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:29,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:29,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:29,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:33:29,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:33:29,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:33:29,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:29,531 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:33:29,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:29,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:29,532 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:29,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf [2023-11-19 07:33:29,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:29,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:29,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:29,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:29,856 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:29,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-19 07:33:33,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:33,609 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:33,609 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/sv-benchmarks/c/pthread-wmm/mix031.oepc.i [2023-11-19 07:33:33,639 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/data/5b41a5bbc/3f308f6377d8480e987502054650caf2/FLAGca9dda001 [2023-11-19 07:33:33,659 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/data/5b41a5bbc/3f308f6377d8480e987502054650caf2 [2023-11-19 07:33:33,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:33,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:33,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:33,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:33,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:33,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:33" (1/1) ... [2023-11-19 07:33:33,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47744bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:33, skipping insertion in model container [2023-11-19 07:33:33,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:33" (1/1) ... [2023-11-19 07:33:33,773 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:33,996 WARN L240 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_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2023-11-19 07:33:34,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:34,299 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:34,312 WARN L240 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_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/sv-benchmarks/c/pthread-wmm/mix031.oepc.i[945,958] [2023-11-19 07:33:34,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:34,448 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:34,448 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:34,456 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:34,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34 WrapperNode [2023-11-19 07:33:34,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:34,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:34,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:34,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:34,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,532 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2023-11-19 07:33:34,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:34,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:34,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:34,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:34,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:34,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:34,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:34,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:34,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (1/1) ... [2023-11-19 07:33:34,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:34,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:33:34,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:33:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:33:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:33:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:33:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:33:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:33:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:33:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:33:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:33:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:33:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:33:34,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:34,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:34,662 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:33:34,861 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:34,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:35,232 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:35,425 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:35,425 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:33:35,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:35 BoogieIcfgContainer [2023-11-19 07:33:35,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:35,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:35,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:35,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:35,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:33" (1/3) ... [2023-11-19 07:33:35,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706d00b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:35, skipping insertion in model container [2023-11-19 07:33:35,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:34" (2/3) ... [2023-11-19 07:33:35,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706d00b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:35, skipping insertion in model container [2023-11-19 07:33:35,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:35" (3/3) ... [2023-11-19 07:33:35,447 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-11-19 07:33:35,456 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:33:35,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:35,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:33:35,467 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:35,527 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:33:35,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 100 transitions, 208 flow [2023-11-19 07:33:35,627 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-11-19 07:33:35,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:35,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-11-19 07:33:35,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 100 transitions, 208 flow [2023-11-19 07:33:35,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 98 transitions, 202 flow [2023-11-19 07:33:35,642 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:33:35,658 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 98 transitions, 202 flow [2023-11-19 07:33:35,660 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 98 transitions, 202 flow [2023-11-19 07:33:35,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 202 flow [2023-11-19 07:33:35,691 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-11-19 07:33:35,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:35,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-11-19 07:33:35,694 INFO L119 LiptonReduction]: Number of co-enabled transitions 1592 [2023-11-19 07:33:39,427 INFO L134 LiptonReduction]: Checked pairs total: 3654 [2023-11-19 07:33:39,428 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-19 07:33:39,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:39,456 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@615fd2cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:39,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:33:39,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:33:39,460 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 07:33:39,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:39,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:39,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:33:39,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:39,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 442974, now seen corresponding path program 1 times [2023-11-19 07:33:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150715847] [2023-11-19 07:33:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150715847] [2023-11-19 07:33:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150715847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:39,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:39,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477977950] [2023-11-19 07:33:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:39,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:40,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2023-11-19 07:33:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:40,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2023-11-19 07:33:40,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:40,202 INFO L124 PetriNetUnfolderBase]: 184/334 cut-off events. [2023-11-19 07:33:40,202 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 07:33:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 334 events. 184/334 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1311 event pairs, 61 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 660. Up to 277 conditions per place. [2023-11-19 07:33:40,207 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-19 07:33:40,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2023-11-19 07:33:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-11-19 07:33:40,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2023-11-19 07:33:40,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-11-19 07:33:40,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-11-19 07:33:40,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:40,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-11-19 07:33:40,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,242 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 290 transitions. [2023-11-19 07:33:40,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2023-11-19 07:33:40,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:40,246 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-19 07:33:40,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-19 07:33:40,252 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-19 07:33:40,252 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-19 07:33:40,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:40,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:33:40,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:40,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650479, now seen corresponding path program 1 times [2023-11-19 07:33:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177518453] [2023-11-19 07:33:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177518453] [2023-11-19 07:33:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177518453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397949568] [2023-11-19 07:33:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:40,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:40,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-11-19 07:33:40,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:40,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-11-19 07:33:40,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:40,657 INFO L124 PetriNetUnfolderBase]: 207/360 cut-off events. [2023-11-19 07:33:40,658 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-19 07:33:40,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1237 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2023-11-19 07:33:40,667 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-19 07:33:40,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2023-11-19 07:33:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-11-19 07:33:40,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4670138888888889 [2023-11-19 07:33:40,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-11-19 07:33:40,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-11-19 07:33:40,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:40,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-11-19 07:33:40,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,689 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 269 transitions. [2023-11-19 07:33:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2023-11-19 07:33:40,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:40,692 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2023-11-19 07:33:40,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-11-19 07:33:40,694 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-19 07:33:40,695 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2023-11-19 07:33:40,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:40,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:40,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:40,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2130317637, now seen corresponding path program 1 times [2023-11-19 07:33:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54004846] [2023-11-19 07:33:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:40,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54004846] [2023-11-19 07:33:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54004846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:40,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:40,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582087650] [2023-11-19 07:33:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:40,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:40,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:40,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:40,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-11-19 07:33:40,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:40,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-11-19 07:33:40,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:41,043 INFO L124 PetriNetUnfolderBase]: 193/338 cut-off events. [2023-11-19 07:33:41,043 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-19 07:33:41,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 338 events. 193/338 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 65 based on Foata normal form. 8/346 useless extension candidates. Maximal degree in co-relation 764. Up to 243 conditions per place. [2023-11-19 07:33:41,047 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-19 07:33:41,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 119 flow [2023-11-19 07:33:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-11-19 07:33:41,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2023-11-19 07:33:41,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-11-19 07:33:41,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-11-19 07:33:41,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:41,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-11-19 07:33:41,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,054 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 268 transitions. [2023-11-19 07:33:41,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 119 flow [2023-11-19 07:33:41,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:41,056 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2023-11-19 07:33:41,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-19 07:33:41,057 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-19 07:33:41,061 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2023-11-19 07:33:41,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:41,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:41,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:41,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:41,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1541940296, now seen corresponding path program 1 times [2023-11-19 07:33:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634137069] [2023-11-19 07:33:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:41,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634137069] [2023-11-19 07:33:41,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634137069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706225625] [2023-11-19 07:33:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:41,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:41,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-11-19 07:33:41,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:41,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-11-19 07:33:41,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:41,522 INFO L124 PetriNetUnfolderBase]: 179/316 cut-off events. [2023-11-19 07:33:41,522 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-19 07:33:41,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 316 events. 179/316 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1039 event pairs, 99 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 746. Up to 237 conditions per place. [2023-11-19 07:33:41,526 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-19 07:33:41,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 137 flow [2023-11-19 07:33:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-11-19 07:33:41,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-11-19 07:33:41,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-11-19 07:33:41,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-11-19 07:33:41,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:41,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-11-19 07:33:41,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,533 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 270 transitions. [2023-11-19 07:33:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 137 flow [2023-11-19 07:33:41,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:41,537 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2023-11-19 07:33:41,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-11-19 07:33:41,539 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-11-19 07:33:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2023-11-19 07:33:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:41,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:41,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:41,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -452957648, now seen corresponding path program 1 times [2023-11-19 07:33:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120479541] [2023-11-19 07:33:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120479541] [2023-11-19 07:33:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120479541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587228269] [2023-11-19 07:33:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:41,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:41,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:41,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2023-11-19 07:33:41,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:41,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2023-11-19 07:33:41,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:41,897 INFO L124 PetriNetUnfolderBase]: 46/113 cut-off events. [2023-11-19 07:33:41,898 INFO L125 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2023-11-19 07:33:41,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 113 events. 46/113 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 330 event pairs, 16 based on Foata normal form. 16/128 useless extension candidates. Maximal degree in co-relation 281. Up to 66 conditions per place. [2023-11-19 07:33:41,902 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-11-19 07:33:41,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 149 flow [2023-11-19 07:33:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-11-19 07:33:41,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878472222222222 [2023-11-19 07:33:41,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-11-19 07:33:41,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-11-19 07:33:41,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:41,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-11-19 07:33:41,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,911 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 3 states and 281 transitions. [2023-11-19 07:33:41,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 149 flow [2023-11-19 07:33:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:41,916 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 83 flow [2023-11-19 07:33:41,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-11-19 07:33:41,919 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-11-19 07:33:41,920 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 83 flow [2023-11-19 07:33:41,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:41,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:41,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:41,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:41,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:41,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1143271888, now seen corresponding path program 1 times [2023-11-19 07:33:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736038868] [2023-11-19 07:33:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736038868] [2023-11-19 07:33:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736038868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109595917] [2023-11-19 07:33:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:42,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:42,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2023-11-19 07:33:42,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:42,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:42,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2023-11-19 07:33:42,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:42,420 INFO L124 PetriNetUnfolderBase]: 25/71 cut-off events. [2023-11-19 07:33:42,420 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-19 07:33:42,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 71 events. 25/71 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 13 based on Foata normal form. 8/78 useless extension candidates. Maximal degree in co-relation 191. Up to 41 conditions per place. [2023-11-19 07:33:42,422 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 21 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-11-19 07:33:42,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 156 flow [2023-11-19 07:33:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2023-11-19 07:33:42,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765625 [2023-11-19 07:33:42,425 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 366 transitions. [2023-11-19 07:33:42,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 366 transitions. [2023-11-19 07:33:42,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:42,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 366 transitions. [2023-11-19 07:33:42,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:42,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:42,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:42,433 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 83 flow. Second operand 4 states and 366 transitions. [2023-11-19 07:33:42,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 156 flow [2023-11-19 07:33:42,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 140 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-19 07:33:42,437 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 84 flow [2023-11-19 07:33:42,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-11-19 07:33:42,440 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-11-19 07:33:42,440 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 84 flow [2023-11-19 07:33:42,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:42,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:42,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:42,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:42,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:42,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1818697632, now seen corresponding path program 1 times [2023-11-19 07:33:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031607898] [2023-11-19 07:33:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:43,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031607898] [2023-11-19 07:33:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031607898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:43,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:43,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721422615] [2023-11-19 07:33:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:43,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:43,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192 [2023-11-19 07:33:43,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:43,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192 [2023-11-19 07:33:43,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:43,659 INFO L124 PetriNetUnfolderBase]: 26/79 cut-off events. [2023-11-19 07:33:43,659 INFO L125 PetriNetUnfolderBase]: For 54/55 co-relation queries the response was YES. [2023-11-19 07:33:43,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 79 events. 26/79 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 207 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 210. Up to 27 conditions per place. [2023-11-19 07:33:43,660 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 22 selfloop transitions, 4 changer transitions 11/40 dead transitions. [2023-11-19 07:33:43,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 234 flow [2023-11-19 07:33:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 607 transitions. [2023-11-19 07:33:43,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45163690476190477 [2023-11-19 07:33:43,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 607 transitions. [2023-11-19 07:33:43,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 607 transitions. [2023-11-19 07:33:43,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:43,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 607 transitions. [2023-11-19 07:33:43,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.71428571428571) internal successors, (607), 7 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,674 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 84 flow. Second operand 7 states and 607 transitions. [2023-11-19 07:33:43,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 234 flow [2023-11-19 07:33:43,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 214 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:43,677 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 88 flow [2023-11-19 07:33:43,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-11-19 07:33:43,678 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-11-19 07:33:43,679 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 88 flow [2023-11-19 07:33:43,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:43,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:43,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:43,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:43,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 498379330, now seen corresponding path program 2 times [2023-11-19 07:33:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326153372] [2023-11-19 07:33:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:43,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326153372] [2023-11-19 07:33:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326153372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:43,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:43,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644518936] [2023-11-19 07:33:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:43,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192 [2023-11-19 07:33:43,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:43,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192 [2023-11-19 07:33:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:44,048 INFO L124 PetriNetUnfolderBase]: 32/98 cut-off events. [2023-11-19 07:33:44,048 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-19 07:33:44,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 98 events. 32/98 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 13 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 286. Up to 42 conditions per place. [2023-11-19 07:33:44,049 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 1 changer transitions 16/35 dead transitions. [2023-11-19 07:33:44,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 217 flow [2023-11-19 07:33:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-11-19 07:33:44,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752604166666667 [2023-11-19 07:33:44,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-11-19 07:33:44,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-11-19 07:33:44,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:44,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-11-19 07:33:44,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:44,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:44,057 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:44,057 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 88 flow. Second operand 4 states and 365 transitions. [2023-11-19 07:33:44,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 217 flow [2023-11-19 07:33:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 199 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-19 07:33:44,060 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 77 flow [2023-11-19 07:33:44,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-11-19 07:33:44,061 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-11-19 07:33:44,062 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 77 flow [2023-11-19 07:33:44,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:44,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:44,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:44,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:44,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:33:44,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -917614152, now seen corresponding path program 3 times [2023-11-19 07:33:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074603942] [2023-11-19 07:33:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:44,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:33:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:44,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:33:44,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:33:44,292 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 07:33:44,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:33:44,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 07:33:44,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 07:33:44,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:33:44,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:44,296 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:44,304 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:33:44,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:33:44,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:33:44,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:33:44,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:33:44 BasicIcfg [2023-11-19 07:33:44,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:33:44,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:33:44,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:33:44,396 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:33:44,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:35" (3/4) ... [2023-11-19 07:33:44,398 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:33:44,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:33:44,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:33:44,505 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:33:44,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:33:44,506 INFO L158 Benchmark]: Toolchain (without parser) took 10835.60ms. Allocated memory was 123.7MB in the beginning and 188.7MB in the end (delta: 65.0MB). Free memory was 83.6MB in the beginning and 137.6MB in the end (delta: -54.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,507 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:44,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.39ms. Allocated memory is still 123.7MB. Free memory was 83.2MB in the beginning and 60.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.98ms. Allocated memory is still 123.7MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,508 INFO L158 Benchmark]: Boogie Preprocessor took 35.86ms. Allocated memory is still 123.7MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,509 INFO L158 Benchmark]: RCFGBuilder took 861.98ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 107.7MB in the end (delta: -51.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,509 INFO L158 Benchmark]: TraceAbstraction took 8959.99ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 107.7MB in the beginning and 145.0MB in the end (delta: -37.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,510 INFO L158 Benchmark]: Witness Printer took 109.95ms. Allocated memory is still 188.7MB. Free memory was 145.0MB in the beginning and 137.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:33:44,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 781.39ms. Allocated memory is still 123.7MB. Free memory was 83.2MB in the beginning and 60.5MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.98ms. Allocated memory is still 123.7MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.86ms. Allocated memory is still 123.7MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 861.98ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 107.7MB in the end (delta: -51.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8959.99ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 107.7MB in the beginning and 145.0MB in the end (delta: -37.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * Witness Printer took 109.95ms. Allocated memory is still 188.7MB. Free memory was 145.0MB in the beginning and 137.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 102 PlacesBefore, 26 PlacesAfterwards, 98 TransitionsBefore, 20 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 3654 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1832, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 870, independent: 837, independent conditional: 0, independent unconditional: 837, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1832, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 870, unknown conditional: 0, unknown unconditional: 870] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 49 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:33:44,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5cb7f0-04ab-4a33-b1b3-cc1efeb86bab/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE