./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:26:50,575 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:26:50,668 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:26:50,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:26:50,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:26:50,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:26:50,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:26:50,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:26:50,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:26:50,718 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:26:50,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:26:50,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:26:50,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:26:50,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:26:50,720 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:26:50,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:26:50,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:26:50,724 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:26:50,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:26:50,725 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:26:50,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:26:50,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:26:50,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:26:50,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:26:50,730 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:26:50,730 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:26:50,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:26:50,731 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:26:50,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:26:50,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:26:50,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:26:50,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:26:50,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:26:50,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:26:50,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:26:50,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:26:50,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:26:50,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:26:50,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:26:50,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:26:50,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:26:50,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:26:50,738 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_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/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_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286
[2024-11-08 18:26:51,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:26:51,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:26:51,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:26:51,118 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:26:51,119 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:26:51,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c
Unable to find full path for "g++"
[2024-11-08 18:26:53,228 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:26:53,507 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:26:53,508 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c
[2024-11-08 18:26:53,519 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/data/bf2efa388/6de49cfd1a7048fa8648cfa795c834cc/FLAG0736e3781
[2024-11-08 18:26:53,820 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/data/bf2efa388/6de49cfd1a7048fa8648cfa795c834cc
[2024-11-08 18:26:53,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:26:53,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:26:53,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:26:53,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:26:53,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:26:53,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:53" (1/1) ...
[2024-11-08 18:26:53,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e056c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:53, skipping insertion in model container
[2024-11-08 18:26:53,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:53" (1/1) ...
[2024-11-08 18:26:53,886 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:26:54,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358]
[2024-11-08 18:26:54,148 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:26:54,167 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:26:54,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c[4345,4358]
[2024-11-08 18:26:54,212 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:26:54,236 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:26:54,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54 WrapperNode
[2024-11-08 18:26:54,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:26:54,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:26:54,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:26:54,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:26:54,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,303 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 305
[2024-11-08 18:26:54,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:26:54,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:26:54,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:26:54,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:26:54,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,348 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2].
[2024-11-08 18:26:54,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:26:54,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:26:54,381 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:26:54,381 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:26:54,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (1/1) ...
[2024-11-08 18:26:54,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:26:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:26:54,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:26:54,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:26:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:26:54,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-11-08 18:26:54,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-11-08 18:26:54,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-11-08 18:26:54,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-11-08 18:26:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-11-08 18:26:54,492 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-11-08 18:26:54,492 INFO L130 BoogieDeclarations]: Found specification of procedure thread4
[2024-11-08 18:26:54,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4
[2024-11-08 18:26:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:26:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-08 18:26:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-08 18:26:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-08 18:26:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:26:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:26:54,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-08 18:26:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:26:54,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:26:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-08 18:26:54,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-08 18:26:54,506 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:26:54,688 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:26:54,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:26:55,313 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:26:55,314 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:26:55,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:26:55,911 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:26:55,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:55 BoogieIcfgContainer
[2024-11-08 18:26:55,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:26:55,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:26:55,916 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:26:55,919 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:26:55,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:53" (1/3) ...
[2024-11-08 18:26:55,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f33a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:55, skipping insertion in model container
[2024-11-08 18:26:55,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:54" (2/3) ...
[2024-11-08 18:26:55,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f33a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:55, skipping insertion in model container
[2024-11-08 18:26:55,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:55" (3/3) ...
[2024-11-08 18:26:55,925 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c
[2024-11-08 18:26:55,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:26:55,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:26:55,948 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:26:56,055 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-11-08 18:26:56,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 68 transitions, 164 flow
[2024-11-08 18:26:56,165 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events.
[2024-11-08 18:26:56,165 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-08 18:26:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 64 events. 12/64 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place.
[2024-11-08 18:26:56,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 68 transitions, 164 flow
[2024-11-08 18:26:56,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 63 transitions, 150 flow
[2024-11-08 18:26:56,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:26:56,195 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5716e8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:26:56,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-08 18:26:56,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:26:56,233 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events.
[2024-11-08 18:26:56,233 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-08 18:26:56,233 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:26:56,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:26:56,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-08 18:26:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:26:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1553660894, now seen corresponding path program 1 times
[2024-11-08 18:26:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:26:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962414641]
[2024-11-08 18:26:56,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:26:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:26:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:26:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:26:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:26:57,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962414641]
[2024-11-08 18:26:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962414641] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:26:57,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:26:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:26:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721581429]
[2024-11-08 18:26:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:26:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:26:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:26:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:26:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:26:57,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 68
[2024-11-08 18:26:57,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:26:57,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:26:57,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 68
[2024-11-08 18:26:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:26:59,019 INFO L124 PetriNetUnfolderBase]: 4141/6290 cut-off events.
[2024-11-08 18:26:59,021 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES.
[2024-11-08 18:26:59,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11878 conditions, 6290 events. 4141/6290 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 39694 event pairs, 290 based on Foata normal form. 380/6298 useless extension candidates. Maximal degree in co-relation 10618. Up to 3483 conditions per place.
[2024-11-08 18:26:59,104 INFO L140 encePairwiseOnDemand]: 60/68 looper letters, 70 selfloop transitions, 7 changer transitions 0/108 dead transitions.
[2024-11-08 18:26:59,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 427 flow
[2024-11-08 18:26:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:26:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 18:26:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions.
[2024-11-08 18:26:59,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471
[2024-11-08 18:26:59,123 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 150 flow. Second operand 6 states and 291 transitions.
[2024-11-08 18:26:59,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 427 flow
[2024-11-08 18:26:59,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 389 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-11-08 18:26:59,146 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 185 flow
[2024-11-08 18:26:59,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=64, PETRI_TRANSITIONS=68}
[2024-11-08 18:26:59,154 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places.
[2024-11-08 18:26:59,157 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 185 flow
[2024-11-08 18:26:59,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:26:59,157 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:26:59,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:26:59,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:26:59,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-08 18:26:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:26:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash -230578610, now seen corresponding path program 1 times
[2024-11-08 18:26:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:26:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849587111]
[2024-11-08 18:26:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:26:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:26:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:26:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:26:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:26:59,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849587111]
[2024-11-08 18:26:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849587111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:26:59,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:26:59,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:26:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474307030]
[2024-11-08 18:26:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:26:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:26:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:26:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:26:59,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:26:59,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 68
[2024-11-08 18:26:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:26:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:26:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 68
[2024-11-08 18:26:59,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:27:00,359 INFO L124 PetriNetUnfolderBase]: 2852/4769 cut-off events.
[2024-11-08 18:27:00,360 INFO L125 PetriNetUnfolderBase]: For 1573/1761 co-relation queries the response was YES.
[2024-11-08 18:27:00,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9838 conditions, 4769 events. 2852/4769 cut-off events. For 1573/1761 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 32918 event pairs, 548 based on Foata normal form. 181/4359 useless extension candidates. Maximal degree in co-relation 6060. Up to 2615 conditions per place.
[2024-11-08 18:27:00,424 INFO L140 encePairwiseOnDemand]: 65/68 looper letters, 43 selfloop transitions, 2 changer transitions 2/84 dead transitions.
[2024-11-08 18:27:00,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 312 flow
[2024-11-08 18:27:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:27:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:27:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions.
[2024-11-08 18:27:00,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451
[2024-11-08 18:27:00,429 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 185 flow. Second operand 3 states and 164 transitions.
[2024-11-08 18:27:00,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 312 flow
[2024-11-08 18:27:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:27:00,439 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 186 flow
[2024-11-08 18:27:00,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=68}
[2024-11-08 18:27:00,440 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places.
[2024-11-08 18:27:00,440 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 186 flow
[2024-11-08 18:27:00,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:27:00,441 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:27:00,441 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:27:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:27:00,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-08 18:27:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:27:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 336740115, now seen corresponding path program 1 times
[2024-11-08 18:27:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:27:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664923666]
[2024-11-08 18:27:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:27:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:27:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:27:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:27:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:27:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664923666]
[2024-11-08 18:27:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664923666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:27:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:27:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:27:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012408412]
[2024-11-08 18:27:00,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:27:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:27:00,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:27:00,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:27:00,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:27:00,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 68
[2024-11-08 18:27:00,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:27:00,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:27:00,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 68
[2024-11-08 18:27:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:27:01,775 INFO L124 PetriNetUnfolderBase]: 3251/5648 cut-off events.
[2024-11-08 18:27:01,776 INFO L125 PetriNetUnfolderBase]: For 2359/2567 co-relation queries the response was YES.
[2024-11-08 18:27:01,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11807 conditions, 5648 events. 3251/5648 cut-off events. For 2359/2567 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 40521 event pairs, 1922 based on Foata normal form. 117/4776 useless extension candidates. Maximal degree in co-relation 5347. Up to 3415 conditions per place.
[2024-11-08 18:27:01,848 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 37 selfloop transitions, 2 changer transitions 24/94 dead transitions.
[2024-11-08 18:27:01,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 375 flow
[2024-11-08 18:27:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:27:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:27:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions.
[2024-11-08 18:27:01,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411
[2024-11-08 18:27:01,856 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 186 flow. Second operand 5 states and 226 transitions.
[2024-11-08 18:27:01,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 375 flow
[2024-11-08 18:27:01,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 18:27:01,865 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 204 flow
[2024-11-08 18:27:01,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=71, PETRI_TRANSITIONS=69}
[2024-11-08 18:27:01,866 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2024-11-08 18:27:01,867 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 204 flow
[2024-11-08 18:27:01,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:27:01,868 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:27:01,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:27:01,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:27:01,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-08 18:27:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:27:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 300656823, now seen corresponding path program 1 times
[2024-11-08 18:27:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:27:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660090325]
[2024-11-08 18:27:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:27:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:27:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:27:01,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:27:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:27:02,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:27:02,037 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:27:02,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-08 18:27:02,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining)
[2024-11-08 18:27:02,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-08 18:27:02,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-08 18:27:02,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-11-08 18:27:02,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:27:02,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-08 18:27:02,205 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:27:02,205 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:27:02,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:27:02 BasicIcfg
[2024-11-08 18:27:02,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:27:02,217 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:27:02,217 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:27:02,217 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:27:02,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:55" (3/4) ...
[2024-11-08 18:27:02,220 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 18:27:02,413 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 18:27:02,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:27:02,417 INFO L158 Benchmark]: Toolchain (without parser) took 8591.52ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 142.8MB in the beginning and 375.7MB in the end (delta: -232.9MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,417 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:27:02,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.98ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 127.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.57ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 125.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,419 INFO L158 Benchmark]: Boogie Preprocessor took 75.38ms. Allocated memory is still 174.1MB. Free memory was 125.0MB in the beginning and 121.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,419 INFO L158 Benchmark]: RCFGBuilder took 1531.25ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 95.4MB in the end (delta: 26.1MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,420 INFO L158 Benchmark]: TraceAbstraction took 6302.28ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 95.4MB in the beginning and 396.7MB in the end (delta: -301.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,420 INFO L158 Benchmark]: Witness Printer took 199.42ms. Allocated memory is still 490.7MB. Free memory was 396.7MB in the beginning and 375.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 18:27:02,422 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.36ms. Allocated memory is still 117.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 409.98ms. Allocated memory is still 174.1MB. Free memory was 142.5MB in the beginning and 127.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 65.57ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 125.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 75.38ms. Allocated memory is still 174.1MB. Free memory was 125.0MB in the beginning and 121.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1531.25ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 95.4MB in the end (delta: 26.1MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 6302.28ms. Allocated memory was 174.1MB in the beginning and 490.7MB in the end (delta: 316.7MB). Free memory was 95.4MB in the beginning and 396.7MB in the end (delta: -301.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB.
* Witness Printer took 199.42ms. Allocated memory is still 490.7MB. Free memory was 396.7MB in the beginning and 375.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 154]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L40] 0 int* q1;
[L41] 0 int* q2;
[L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2;
[L124] 0 pthread_t t1, t2, t3, t4;
[L126] 0 C = __VERIFIER_nondet_int()
[L127] 0 M = __VERIFIER_nondet_int()
[L128] 0 N = __VERIFIER_nondet_int()
[L130] 0 q1_front = __VERIFIER_nondet_int()
[L131] 0 q1_back = __VERIFIER_nondet_int()
[L132] 0 q2_front = __VERIFIER_nondet_int()
[L133] 0 q2_back = __VERIFIER_nondet_int()
[L135] 0 n1 = __VERIFIER_nondet_int()
[L136] 0 n2 = __VERIFIER_nondet_int()
[L137] CALL, EXPR 0 create_fresh_int_array(n1)
[L160] CALL 0 assume_abort_if_not(size >= 0)
[L37] COND FALSE 0 !(!cond)
[L160] RET 0 assume_abort_if_not(size >= 0)
[L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int)))
[L37] COND FALSE 0 !(!cond)
[L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int)))
[L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size);
[L164] 0 int i = 0;
VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0]
[L164] COND FALSE 0 !(i < size)
VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, total=0]
[L164] COND TRUE 0 i < size
[L165] 0 arr[i] = __VERIFIER_nondet_int()
[L164] 0 i++
VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0]
[L164] COND TRUE 0 i < size
VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, total=0]
[L167] 0 return arr;
[L137] RET, EXPR 0 create_fresh_int_array(n1)
[L137] 0 q1 = create_fresh_int_array(n1)
[L138] CALL, EXPR 0 create_fresh_int_array(n2)
[L160] CALL 0 assume_abort_if_not(size >= 0)
[L37] COND FALSE 0 !(!cond)
[L160] RET 0 assume_abort_if_not(size >= 0)
[L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int)))
[L37] COND FALSE 0 !(!cond)
[L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int)))
[L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size);
[L164] 0 int i = 0;
VAL [C=3, M=0, N=1, \old(size)=0, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0]
[L164] COND TRUE 0 i < size
VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, total=0]
[L167] 0 return arr;
[L138] RET, EXPR 0 create_fresh_int_array(n2)
[L138] 0 q2 = create_fresh_int_array(n2)
[L140] CALL 0 assume_abort_if_not(C > -2147483648)
[L37] COND FALSE 0 !(!cond)
[L140] RET 0 assume_abort_if_not(C > -2147483648)
[L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back)
[L37] COND FALSE 0 !(!cond)
[L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back)
[L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0)
VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0]
[L49] 1 _Bool cond = i < N;
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L51] COND FALSE 1 !(\read(cond))
VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L51] COND TRUE 1 \read(cond)
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C
[L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C
[L53] EXPR 1 q1[q1_back]
[L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C
[L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C)
[L37] COND FALSE 1 !(!cond)
[L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C)
[L54] 1 i++
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0]
[L69] 2 _Bool cond = j < M;
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L71] COND TRUE 2 \read(cond)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L84] 2 return 0;
[L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0]
[L89] 3 _Bool cond = i < N || q1_front < q1_back;
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L91] COND TRUE 3 \read(cond)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L102] 3 return 0;
[L57] 1 q1_back++
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L60] 1 cond = i < N
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L51] COND TRUE 1 \read(cond)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L64] 1 return 0;
[L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
[L107] 4 _Bool cond = j < M || q2_front < q2_back;
VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L109] COND TRUE 4 \read(cond)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0]
[L120] 4 return 0;
[L148] FCALL, JOIN 1 pthread_join(t1, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
[L149] FCALL, JOIN 2 pthread_join(t2, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
[L150] FCALL, JOIN 3 pthread_join(t3, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
[L151] FCALL, JOIN 4 pthread_join(t4, 0)
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
[L153] CALL 0 assume_abort_if_not(total <= 0)
[L37] COND FALSE 0 !(!cond)
[L153] RET 0 assume_abort_if_not(total <= 0)
[L154] 0 reach_error()
VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0]
- UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 95 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 5 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 18:27:02,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f6665c-24aa-428d-9608-920c0d5ea1a7/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE