./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:57:08,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:57:08,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:57:08,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:57:08,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:57:08,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:57:08,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:57:08,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:57:08,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:57:08,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:57:08,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:57:08,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:57:08,777 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:57:08,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:57:08,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:57:08,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:57:08,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:57:08,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:57:08,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:57:08,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:57:08,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:57:08,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:57:08,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:57:08,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:57:08,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:57:08,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:57:08,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:57:08,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:57:08,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:57:08,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:57:08,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:57:08,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:57:08,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:57:08,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:57:08,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:57:08,791 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:57:08,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:57:08,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:57:08,793 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:57:08,793 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_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/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_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e [2023-11-06 21:57:09,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:57:09,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:57:09,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:57:09,150 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:57:09,150 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:57:09,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2023-11-06 21:57:12,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:57:12,525 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:57:12,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2023-11-06 21:57:12,539 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/data/de0093a82/9ba28c34dba641779b51574fb704434a/FLAG3471cc63b [2023-11-06 21:57:12,561 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/data/de0093a82/9ba28c34dba641779b51574fb704434a [2023-11-06 21:57:12,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:57:12,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:57:12,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:12,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:57:12,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:57:12,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3229e649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12, skipping insertion in model container [2023-11-06 21:57:12,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,622 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:57:12,795 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_6a0db3f3-52ce-44b5-be45-a89101b5c1db/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-11-06 21:57:12,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:12,821 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:57:12,844 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_6a0db3f3-52ce-44b5-be45-a89101b5c1db/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-11-06 21:57:12,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:12,865 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:57:12,865 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:57:12,873 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:57:12,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12 WrapperNode [2023-11-06 21:57:12,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:12,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:12,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:57:12,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:57:12,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,953 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2023-11-06 21:57:12,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:12,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:57:12,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:57:12,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:57:12,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:12,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:13,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:57:13,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:57:13,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:57:13,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:57:13,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (1/1) ... [2023-11-06 21:57:13,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:57:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:13,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:57:13,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:57:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:57:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:57:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:57:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:57:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 21:57:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 21:57:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 21:57:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 21:57:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:57:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:57:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:57:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:57:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:57:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:57:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:57:13,101 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:57:13,274 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:57:13,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:57:13,705 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:57:13,896 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:57:13,897 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 21:57:13,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:13 BoogieIcfgContainer [2023-11-06 21:57:13,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:57:13,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:57:13,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:57:13,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:57:13,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:57:12" (1/3) ... [2023-11-06 21:57:13,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ead7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:13, skipping insertion in model container [2023-11-06 21:57:13,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:12" (2/3) ... [2023-11-06 21:57:13,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ead7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:13, skipping insertion in model container [2023-11-06 21:57:13,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:13" (3/3) ... [2023-11-06 21:57:13,912 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-11-06 21:57:13,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:57:13,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:57:13,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:57:13,930 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:57:13,999 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 21:57:14,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 254 flow [2023-11-06 21:57:14,150 INFO L124 PetriNetUnfolderBase]: 9/118 cut-off events. [2023-11-06 21:57:14,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 21:57:14,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 9/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-11-06 21:57:14,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 254 flow [2023-11-06 21:57:14,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 109 transitions, 230 flow [2023-11-06 21:57:14,166 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:57:14,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 109 transitions, 230 flow [2023-11-06 21:57:14,181 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 109 transitions, 230 flow [2023-11-06 21:57:14,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 230 flow [2023-11-06 21:57:14,216 INFO L124 PetriNetUnfolderBase]: 9/109 cut-off events. [2023-11-06 21:57:14,216 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 21:57:14,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 9/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-11-06 21:57:14,219 INFO L119 LiptonReduction]: Number of co-enabled transitions 648 [2023-11-06 21:57:18,676 INFO L134 LiptonReduction]: Checked pairs total: 914 [2023-11-06 21:57:18,677 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-11-06 21:57:18,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:18,716 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d0d2dcc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:18,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 21:57:18,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:57:18,733 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-11-06 21:57:18,733 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 21:57:18,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:18,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:18,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:18,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -937987986, now seen corresponding path program 1 times [2023-11-06 21:57:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111270927] [2023-11-06 21:57:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:19,135 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-06 21:57:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111270927] [2023-11-06 21:57:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111270927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:57:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522343723] [2023-11-06 21:57:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:19,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:57:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:57:19,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:57:19,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 226 [2023-11-06 21:57:19,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-06 21:57:19,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:19,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 226 [2023-11-06 21:57:19,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:19,338 INFO L124 PetriNetUnfolderBase]: 114/197 cut-off events. [2023-11-06 21:57:19,338 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-06 21:57:19,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 114/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 711 event pairs, 24 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-11-06 21:57:19,345 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 25 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-11-06 21:57:19,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-11-06 21:57:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:57:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:57:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-06 21:57:19,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504424778761062 [2023-11-06 21:57:19,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-06 21:57:19,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-06 21:57:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:19,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-06 21:57:19,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-06 21:57:19,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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-06 21:57:19,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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-06 21:57:19,391 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 342 transitions. [2023-11-06 21:57:19,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-11-06 21:57:19,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 21:57:19,398 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-11-06 21:57:19,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, 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=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2023-11-06 21:57:19,406 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-11-06 21:57:19,407 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-11-06 21:57:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-06 21:57:19,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:19,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:19,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:57:19,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:19,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash -545400920, now seen corresponding path program 1 times [2023-11-06 21:57:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261025838] [2023-11-06 21:57:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261025838] [2023-11-06 21:57:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261025838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:19,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:57:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461275823] [2023-11-06 21:57:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:19,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:19,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:19,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:19,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:19,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-11-06 21:57:19,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-06 21:57:19,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:19,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-11-06 21:57:19,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:19,933 INFO L124 PetriNetUnfolderBase]: 178/330 cut-off events. [2023-11-06 21:57:19,934 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 21:57:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 330 events. 178/330 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1344 event pairs, 93 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 277. Up to 207 conditions per place. [2023-11-06 21:57:19,942 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 38 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-06 21:57:19,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 210 flow [2023-11-06 21:57:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:57:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:57:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-11-06 21:57:19,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557522123893805 [2023-11-06 21:57:19,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-11-06 21:57:19,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-11-06 21:57:19,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:19,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-11-06 21:57:19,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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-06 21:57:19,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:19,962 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:19,962 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 515 transitions. [2023-11-06 21:57:19,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 210 flow [2023-11-06 21:57:19,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:57:19,967 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 94 flow [2023-11-06 21:57:19,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2023-11-06 21:57:19,968 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-11-06 21:57:19,973 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 25 transitions, 94 flow [2023-11-06 21:57:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-06 21:57:19,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:19,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:57:19,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:19,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1284830186, now seen corresponding path program 1 times [2023-11-06 21:57:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:19,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599380043] [2023-11-06 21:57:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599380043] [2023-11-06 21:57:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599380043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:20,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:57:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453158638] [2023-11-06 21:57:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:20,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:20,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-11-06 21:57:20,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-06 21:57:20,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:20,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-11-06 21:57:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:20,395 INFO L124 PetriNetUnfolderBase]: 132/246 cut-off events. [2023-11-06 21:57:20,395 INFO L125 PetriNetUnfolderBase]: For 66/73 co-relation queries the response was YES. [2023-11-06 21:57:20,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 246 events. 132/246 cut-off events. For 66/73 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 944 event pairs, 87 based on Foata normal form. 7/207 useless extension candidates. Maximal degree in co-relation 508. Up to 205 conditions per place. [2023-11-06 21:57:20,399 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 19 selfloop transitions, 2 changer transitions 16/38 dead transitions. [2023-11-06 21:57:20,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 201 flow [2023-11-06 21:57:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:57:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:57:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-11-06 21:57:20,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45132743362831856 [2023-11-06 21:57:20,402 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-11-06 21:57:20,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-11-06 21:57:20,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:20,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-11-06 21:57:20,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 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-06 21:57:20,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:20,409 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:20,409 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 94 flow. Second operand 5 states and 510 transitions. [2023-11-06 21:57:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 201 flow [2023-11-06 21:57:20,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 197 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 21:57:20,414 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 82 flow [2023-11-06 21:57:20,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 21:57:20,415 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-11-06 21:57:20,416 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 82 flow [2023-11-06 21:57:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-06 21:57:20,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:20,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:20,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:57:20,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:20,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 342195749, now seen corresponding path program 1 times [2023-11-06 21:57:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633602324] [2023-11-06 21:57:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:20,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633602324] [2023-11-06 21:57:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633602324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647572328] [2023-11-06 21:57:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:20,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:20,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:20,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:57:20,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:57:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:57:20,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:57:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:20,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:57:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647572328] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:57:20,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:57:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2023-11-06 21:57:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126851056] [2023-11-06 21:57:20,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:57:20,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:57:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:57:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:57:21,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2023-11-06 21:57:21,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 82 flow. Second operand has 10 states, 10 states have (on average 94.9) internal successors, (949), 10 states have internal predecessors, (949), 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-06 21:57:21,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:21,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2023-11-06 21:57:21,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:21,233 INFO L124 PetriNetUnfolderBase]: 128/224 cut-off events. [2023-11-06 21:57:21,233 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-06 21:57:21,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 224 events. 128/224 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 761 event pairs, 35 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 610. Up to 118 conditions per place. [2023-11-06 21:57:21,236 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 28 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2023-11-06 21:57:21,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 204 flow [2023-11-06 21:57:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:57:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:57:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-11-06 21:57:21,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-06 21:57:21,240 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-11-06 21:57:21,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-11-06 21:57:21,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:21,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-11-06 21:57:21,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 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-06 21:57:21,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-06 21:57:21,250 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 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-06 21:57:21,250 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 82 flow. Second operand 7 states and 678 transitions. [2023-11-06 21:57:21,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 204 flow [2023-11-06 21:57:21,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 176 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-06 21:57:21,255 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 99 flow [2023-11-06 21:57:21,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-11-06 21:57:21,258 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2023-11-06 21:57:21,258 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 99 flow [2023-11-06 21:57:21,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.9) internal successors, (949), 10 states have internal predecessors, (949), 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-06 21:57:21,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:21,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:21,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:57:21,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:21,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:21,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1223273041, now seen corresponding path program 1 times [2023-11-06 21:57:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018129521] [2023-11-06 21:57:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:57:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018129521] [2023-11-06 21:57:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018129521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:21,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12488086] [2023-11-06 21:57:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:21,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:57:21,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:57:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:57:21,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:57:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:57:21,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:57:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:57:21,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12488086] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:21,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:57:21,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-06 21:57:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220853513] [2023-11-06 21:57:21,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:21,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:21,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:57:21,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2023-11-06 21:57:21,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 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-06 21:57:21,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:21,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2023-11-06 21:57:21,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:21,994 INFO L124 PetriNetUnfolderBase]: 105/188 cut-off events. [2023-11-06 21:57:21,995 INFO L125 PetriNetUnfolderBase]: For 139/161 co-relation queries the response was YES. [2023-11-06 21:57:21,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 188 events. 105/188 cut-off events. For 139/161 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 578 event pairs, 36 based on Foata normal form. 22/198 useless extension candidates. Maximal degree in co-relation 511. Up to 107 conditions per place. [2023-11-06 21:57:21,997 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 27 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2023-11-06 21:57:21,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 210 flow [2023-11-06 21:57:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:57:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:57:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-11-06 21:57:22,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097345132743364 [2023-11-06 21:57:22,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-11-06 21:57:22,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-11-06 21:57:22,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:22,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-11-06 21:57:22,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-06 21:57:22,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:22,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 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-06 21:57:22,006 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 99 flow. Second operand 5 states and 487 transitions. [2023-11-06 21:57:22,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 210 flow [2023-11-06 21:57:22,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:57:22,008 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 123 flow [2023-11-06 21:57:22,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-06 21:57:22,009 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2023-11-06 21:57:22,010 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 123 flow [2023-11-06 21:57:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 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-06 21:57:22,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:22,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:22,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:57:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:22,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:22,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 805624867, now seen corresponding path program 1 times [2023-11-06 21:57:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703473217] [2023-11-06 21:57:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:23,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703473217] [2023-11-06 21:57:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703473217] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232048969] [2023-11-06 21:57:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:23,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:57:23,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:57:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-06 21:57:23,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:57:23,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:57:23,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 21:57:23,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:57:23,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:57:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:23,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:57:23,551 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-06 21:57:23,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-06 21:57:23,620 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-06 21:57:23,638 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (= (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2023-11-06 21:57:23,650 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:23,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-11-06 21:57:23,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2023-11-06 21:57:23,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 21:57:23,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-06 21:57:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 21:57:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232048969] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:57:23,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:57:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-11-06 21:57:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044463134] [2023-11-06 21:57:23,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:57:23,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 21:57:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 21:57:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=428, Unknown=8, NotChecked=180, Total=702 [2023-11-06 21:57:23,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 226 [2023-11-06 21:57:23,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 123 flow. Second operand has 27 states, 27 states have (on average 65.55555555555556) internal successors, (1770), 27 states have internal predecessors, (1770), 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-06 21:57:23,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:57:23,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 226 [2023-11-06 21:57:23,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:57:24,936 INFO L124 PetriNetUnfolderBase]: 339/584 cut-off events. [2023-11-06 21:57:24,937 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2023-11-06 21:57:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 584 events. 339/584 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2354 event pairs, 14 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 1972. Up to 241 conditions per place. [2023-11-06 21:57:24,943 INFO L140 encePairwiseOnDemand]: 214/226 looper letters, 96 selfloop transitions, 51 changer transitions 2/149 dead transitions. [2023-11-06 21:57:24,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 149 transitions, 963 flow [2023-11-06 21:57:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:57:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-06 21:57:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1551 transitions. [2023-11-06 21:57:24,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31194690265486724 [2023-11-06 21:57:24,970 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1551 transitions. [2023-11-06 21:57:24,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1551 transitions. [2023-11-06 21:57:24,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:57:24,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1551 transitions. [2023-11-06 21:57:24,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 70.5) internal successors, (1551), 22 states have internal predecessors, (1551), 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-06 21:57:24,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 226.0) internal successors, (5198), 23 states have internal predecessors, (5198), 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-06 21:57:24,990 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 226.0) internal successors, (5198), 23 states have internal predecessors, (5198), 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-06 21:57:24,990 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 123 flow. Second operand 22 states and 1551 transitions. [2023-11-06 21:57:24,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 149 transitions, 963 flow [2023-11-06 21:57:24,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 149 transitions, 935 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:57:25,000 INFO L231 Difference]: Finished difference. Result has 64 places, 83 transitions, 671 flow [2023-11-06 21:57:25,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=671, PETRI_PLACES=64, PETRI_TRANSITIONS=83} [2023-11-06 21:57:25,003 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 41 predicate places. [2023-11-06 21:57:25,003 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 83 transitions, 671 flow [2023-11-06 21:57:25,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 65.55555555555556) internal successors, (1770), 27 states have internal predecessors, (1770), 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-06 21:57:25,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:57:25,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:25,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:57:25,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 21:57:25,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-06 21:57:25,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -276936093, now seen corresponding path program 2 times [2023-11-06 21:57:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797653702] [2023-11-06 21:57:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:25,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:57:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:25,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:57:25,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:57:25,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-06 21:57:25,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-06 21:57:25,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-06 21:57:25,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:57:25,287 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-06 21:57:25,292 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:57:25,293 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:57:25,322 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,324 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,325 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:57:25 BasicIcfg [2023-11-06 21:57:25,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:57:25,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:57:25,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:57:25,336 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:57:25,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:13" (3/4) ... [2023-11-06 21:57:25,337 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 21:57:25,351 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,353 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-06 21:57:25,411 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a0db3f3-52ce-44b5-be45-a89101b5c1db/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:57:25,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:57:25,412 INFO L158 Benchmark]: Toolchain (without parser) took 12839.32ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 102.3MB in the beginning and 118.0MB in the end (delta: -15.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,412 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 148.9MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:57:25,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.31ms. Allocated memory is still 148.9MB. Free memory was 101.8MB in the beginning and 90.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.78ms. Allocated memory is still 148.9MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,414 INFO L158 Benchmark]: Boogie Preprocessor took 46.76ms. Allocated memory is still 148.9MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,414 INFO L158 Benchmark]: RCFGBuilder took 898.10ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 86.5MB in the beginning and 141.9MB in the end (delta: -55.3MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,414 INFO L158 Benchmark]: TraceAbstraction took 11432.31ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 123.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,415 INFO L158 Benchmark]: Witness Printer took 76.18ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:57:25,417 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.37ms. Allocated memory is still 148.9MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.31ms. Allocated memory is still 148.9MB. Free memory was 101.8MB in the beginning and 90.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.78ms. Allocated memory is still 148.9MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.76ms. Allocated memory is still 148.9MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 898.10ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 86.5MB in the beginning and 141.9MB in the end (delta: -55.3MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11432.31ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 123.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 76.18ms. Allocated memory is still 180.4MB. Free memory was 123.2MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - 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: 4.5s, 107 PlacesBefore, 23 PlacesAfterwards, 109 TransitionsBefore, 19 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 106 TotalNumberOfCompositions, 914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 731, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 342, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 731, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 342, unknown conditional: 0, unknown unconditional: 342] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, pthread_create(&t1, 0, thread1, 0)=6, t1={3:0}, t2={5:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, pthread_create(&t2, 0, thread2, 0)=7, t1={3:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={-3:0}, N=1, counter=0, i=0] [L83] 0 \read(t1) VAL [A={-3:0}, N=1, \read(t1)=6, counter=0, t1={3:0}, t2={5:0}] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L49] 1 int i=0; VAL [A={-3:0}, N=1, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={-3:0}, N=1, counter=-1, i=1, tmp=-1] [L49] COND FALSE 1 !(i