./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:54,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:54,598 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:33:54,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:54,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:54,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:54,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:54,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:54,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:54,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:54,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:54,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:54,662 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:54,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:54,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:33:54,665 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:54,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:54,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:54,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:54,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:33:54,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:54,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:33:54,669 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:54,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:33:54,670 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:54,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:54,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:54,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:54,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:54,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:54,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:54,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:33:54,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:33:54,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:33:54,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:54,676 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:33:54,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:54,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:54,677 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:54,677 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_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2023-11-19 07:33:55,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:55,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:55,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:55,056 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:55,056 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:55,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2023-11-19 07:33:58,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:58,625 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:58,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c [2023-11-19 07:33:58,636 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/data/6edd28800/32bc408923c64fe094496f74e91f746f/FLAGc3d891c61 [2023-11-19 07:33:58,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/data/6edd28800/32bc408923c64fe094496f74e91f746f [2023-11-19 07:33:58,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:58,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:58,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:58,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:58,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:58,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:58,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451c886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58, skipping insertion in model container [2023-11-19 07:33:58,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:58,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:58,873 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_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2023-11-19 07:33:58,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:58,894 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:58,921 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_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/sv-benchmarks/c/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2023-11-19 07:33:58,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:58,934 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:58,935 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:58,943 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:58,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58 WrapperNode [2023-11-19 07:33:58,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:58,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:58,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:58,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:58,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:58,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,001 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-11-19 07:33:59,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:59,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:59,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:59,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:59,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:59,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:59,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:59,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:59,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (1/1) ... [2023-11-19 07:33:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:59,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:33:59,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:33:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-19 07:33:59,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-19 07:33:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-19 07:33:59,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-19 07:33:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:33:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:33:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:33:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:33:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:33:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:33:59,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:59,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:59,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:33:59,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:33:59,147 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:33:59,329 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:59,333 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:59,693 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:59,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:59,881 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 07:33:59,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:59 BoogieIcfgContainer [2023-11-19 07:33:59,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:59,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:59,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:59,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:58" (1/3) ... [2023-11-19 07:33:59,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145f4380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:59, skipping insertion in model container [2023-11-19 07:33:59,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:58" (2/3) ... [2023-11-19 07:33:59,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145f4380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:59, skipping insertion in model container [2023-11-19 07:33:59,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:59" (3/3) ... [2023-11-19 07:33:59,907 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-11-19 07:33:59,915 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:33:59,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:59,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:33:59,923 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:59,989 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 07:34:00,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 402 flow [2023-11-19 07:34:00,120 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2023-11-19 07:34:00,120 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:34:00,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-19 07:34:00,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 402 flow [2023-11-19 07:34:00,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 378 flow [2023-11-19 07:34:00,136 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:34:00,146 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-19 07:34:00,149 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-19 07:34:00,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 378 flow [2023-11-19 07:34:00,200 INFO L124 PetriNetUnfolderBase]: 15/183 cut-off events. [2023-11-19 07:34:00,200 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:34:00,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 15/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-19 07:34:00,204 INFO L119 LiptonReduction]: Number of co-enabled transitions 772 [2023-11-19 07:34:07,513 INFO L134 LiptonReduction]: Checked pairs total: 1282 [2023-11-19 07:34:07,513 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-11-19 07:34:07,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:34:07,535 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40d001c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:34:07,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 07:34:07,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:34:07,543 INFO L124 PetriNetUnfolderBase]: 5/23 cut-off events. [2023-11-19 07:34:07,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:34:07,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:07,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:07,545 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-19 07:34:07,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1126679500, now seen corresponding path program 1 times [2023-11-19 07:34:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029269708] [2023-11-19 07:34:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029269708] [2023-11-19 07:34:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029269708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:07,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695932839] [2023-11-19 07:34:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:08,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 389 [2023-11-19 07:34:08,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:08,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 389 [2023-11-19 07:34:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:08,241 INFO L124 PetriNetUnfolderBase]: 157/261 cut-off events. [2023-11-19 07:34:08,242 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-19 07:34:08,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 261 events. 157/261 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 812 event pairs, 39 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 491. Up to 169 conditions per place. [2023-11-19 07:34:08,251 INFO L140 encePairwiseOnDemand]: 384/389 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-19 07:34:08,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 157 flow [2023-11-19 07:34:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:34:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:34:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 720 transitions. [2023-11-19 07:34:08,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46272493573264784 [2023-11-19 07:34:08,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 720 transitions. [2023-11-19 07:34:08,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 720 transitions. [2023-11-19 07:34:08,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:08,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 720 transitions. [2023-11-19 07:34:08,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 389.0) internal successors, (1945), 5 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 389.0) internal successors, (1945), 5 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,304 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 60 flow. Second operand 4 states and 720 transitions. [2023-11-19 07:34:08,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 36 transitions, 157 flow [2023-11-19 07:34:08,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 36 transitions, 147 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:34:08,309 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 73 flow [2023-11-19 07:34:08,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2023-11-19 07:34:08,315 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2023-11-19 07:34:08,316 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 73 flow [2023-11-19 07:34:08,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:08,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:08,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:34:08,318 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-19 07:34:08,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:08,318 INFO L85 PathProgramCache]: Analyzing trace with hash 729908109, now seen corresponding path program 1 times [2023-11-19 07:34:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682244626] [2023-11-19 07:34:08,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:34:08,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682244626] [2023-11-19 07:34:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682244626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308749006] [2023-11-19 07:34:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:08,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:08,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 389 [2023-11-19 07:34:08,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:08,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 389 [2023-11-19 07:34:08,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:08,770 INFO L124 PetriNetUnfolderBase]: 157/262 cut-off events. [2023-11-19 07:34:08,770 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-19 07:34:08,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 262 events. 157/262 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 794 event pairs, 105 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 276. Up to 261 conditions per place. [2023-11-19 07:34:08,773 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-11-19 07:34:08,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 127 flow [2023-11-19 07:34:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:34:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-11-19 07:34:08,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44301628106255353 [2023-11-19 07:34:08,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-11-19 07:34:08,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-11-19 07:34:08,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:08,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-11-19 07:34:08,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,784 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 73 flow. Second operand 3 states and 517 transitions. [2023-11-19 07:34:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 127 flow [2023-11-19 07:34:08,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:34:08,787 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-19 07:34:08,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-19 07:34:08,788 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-19 07:34:08,788 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-19 07:34:08,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:08,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:08,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:34:08,790 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-19 07:34:08,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1310587903, now seen corresponding path program 1 times [2023-11-19 07:34:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415762118] [2023-11-19 07:34:08,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:34:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415762118] [2023-11-19 07:34:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415762118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:08,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:34:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787173375] [2023-11-19 07:34:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:08,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:08,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:08,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:08,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 389 [2023-11-19 07:34:08,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:08,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:08,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 389 [2023-11-19 07:34:08,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:09,050 INFO L124 PetriNetUnfolderBase]: 256/422 cut-off events. [2023-11-19 07:34:09,050 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-19 07:34:09,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 422 events. 256/422 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1458 event pairs, 105 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 928. Up to 240 conditions per place. [2023-11-19 07:34:09,056 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 37 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-19 07:34:09,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 204 flow [2023-11-19 07:34:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:34:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-19 07:34:09,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47643530419880037 [2023-11-19 07:34:09,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-19 07:34:09,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-19 07:34:09,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:09,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-19 07:34:09,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,067 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 556 transitions. [2023-11-19 07:34:09,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 204 flow [2023-11-19 07:34:09,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:34:09,070 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-19 07:34:09,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-19 07:34:09,072 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-11-19 07:34:09,075 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-19 07:34:09,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:09,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:09,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:34:09,077 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-19 07:34:09,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -515102088, now seen corresponding path program 1 times [2023-11-19 07:34:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629843522] [2023-11-19 07:34:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:34:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629843522] [2023-11-19 07:34:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629843522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:34:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156816871] [2023-11-19 07:34:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:09,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:09,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 389 [2023-11-19 07:34:09,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:09,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 389 [2023-11-19 07:34:09,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:09,370 INFO L124 PetriNetUnfolderBase]: 259/440 cut-off events. [2023-11-19 07:34:09,370 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-19 07:34:09,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 440 events. 259/440 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1527 event pairs, 90 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 1017. Up to 337 conditions per place. [2023-11-19 07:34:09,375 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 32 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2023-11-19 07:34:09,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 40 transitions, 197 flow [2023-11-19 07:34:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:34:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-11-19 07:34:09,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730077120822622 [2023-11-19 07:34:09,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-11-19 07:34:09,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-11-19 07:34:09,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:09,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-11-19 07:34:09,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,387 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 3 states and 552 transitions. [2023-11-19 07:34:09,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 40 transitions, 197 flow [2023-11-19 07:34:09,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:34:09,391 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 98 flow [2023-11-19 07:34:09,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-11-19 07:34:09,393 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-11-19 07:34:09,393 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 98 flow [2023-11-19 07:34:09,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:09,394 INFO L208 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] [2023-11-19 07:34:09,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:34:09,395 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-19 07:34:09,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1388560608, now seen corresponding path program 1 times [2023-11-19 07:34:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099962581] [2023-11-19 07:34:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:34:09,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099962581] [2023-11-19 07:34:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099962581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648628313] [2023-11-19 07:34:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:09,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:09,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:09,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 389 [2023-11-19 07:34:09,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:09,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 389 [2023-11-19 07:34:09,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:09,836 INFO L124 PetriNetUnfolderBase]: 310/543 cut-off events. [2023-11-19 07:34:09,836 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-19 07:34:09,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 543 events. 310/543 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2056 event pairs, 227 based on Foata normal form. 16/559 useless extension candidates. Maximal degree in co-relation 1081. Up to 440 conditions per place. [2023-11-19 07:34:09,840 INFO L140 encePairwiseOnDemand]: 384/389 looper letters, 27 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2023-11-19 07:34:09,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 244 flow [2023-11-19 07:34:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:34:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:34:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2023-11-19 07:34:09,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43753213367609256 [2023-11-19 07:34:09,844 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2023-11-19 07:34:09,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2023-11-19 07:34:09,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:09,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2023-11-19 07:34:09,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 389.0) internal successors, (2334), 6 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 389.0) internal successors, (2334), 6 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,854 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 98 flow. Second operand 5 states and 851 transitions. [2023-11-19 07:34:09,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 244 flow [2023-11-19 07:34:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:34:09,857 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 112 flow [2023-11-19 07:34:09,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-19 07:34:09,858 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:34:09,858 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 112 flow [2023-11-19 07:34:09,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:09,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:09,859 INFO L208 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] [2023-11-19 07:34:09,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:34:09,860 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-19 07:34:09,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1583704034, now seen corresponding path program 1 times [2023-11-19 07:34:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:09,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326688059] [2023-11-19 07:34:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:34:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326688059] [2023-11-19 07:34:11,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326688059] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:34:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378668057] [2023-11-19 07:34:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:34:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:11,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:34:11,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7bfd8c8-3ea4-4ed8-b1ab-1150f629261d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:34:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:11,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-19 07:34:11,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:11,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:34:11,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-19 07:34:11,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:34:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:34:11,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-19 07:34:11,682 INFO L378 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 23 treesize of output 1 [2023-11-19 07:34:11,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:34:11,767 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-19 07:34:11,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-19 07:34:11,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-19 07:34:11,864 INFO L378 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-19 07:34:12,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:34:12,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-11-19 07:34:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:34:12,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:34:13,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:13,844 INFO L378 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 62 treesize of output 51 [2023-11-19 07:34:13,855 INFO L378 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 3350 treesize of output 3222 [2023-11-19 07:34:13,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:13,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 623 [2023-11-19 07:34:13,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:13,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 606 treesize of output 551 [2023-11-19 07:34:14,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:14,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 455 [2023-11-19 07:34:14,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:14,770 INFO L378 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 123 treesize of output 87 [2023-11-19 07:34:14,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:14,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2096 treesize of output 2024 [2023-11-19 07:34:14,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:14,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 1048 [2023-11-19 07:34:14,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:14,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1008 treesize of output 808 [2023-11-19 07:34:15,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:15,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 768 treesize of output 676 [2023-11-19 07:34:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:19,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378668057] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:34:19,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:34:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 29 [2023-11-19 07:34:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216086332] [2023-11-19 07:34:19,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:34:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 07:34:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 07:34:19,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=778, Unknown=8, NotChecked=0, Total=930 [2023-11-19 07:34:20,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 389 [2023-11-19 07:34:20,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 112 flow. Second operand has 31 states, 31 states have (on average 90.09677419354838) internal successors, (2793), 31 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:20,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:20,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 389 [2023-11-19 07:34:20,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:23,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:34:28,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:34:31,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~end~0 1)) (.cse29 (select |c_#memory_int| c_~A~0.base)) (.cse13 (+ c_~A~0.offset (* c_~i~0 4)))) (let ((.cse2 (not (= c_~end~0 0))) (.cse0 (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1))) (.cse1 (not (= c_~start~0 0))) (.cse6 (select .cse29 .cse13)) (.cse7 (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0)) (.cse8 (< c_~end~0 0)) (.cse11 (< c_~n~0 .cse3)) (.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse10 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and .cse0 (or .cse1 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse2) (or (< 0 .cse3) (< c_~start~0 .cse3)) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (not (= (select .cse4 .cse5) .cse6)) .cse7 .cse8 (and .cse9 (<= c_~v_old~0 (select .cse4 .cse10))) .cse11)) (or .cse2 (and .cse0 (or .cse1 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= |c_thread1Thread1of1ForFork1_#t~mem1#1| .cse6))))) (or .cse7 .cse8 (and (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse14 (select .cse12 c_~queue~0.base))) (or (not (= (select (select .cse12 c_~A~0.base) .cse13) (select .cse14 .cse5))) (< c_~v_old~0 (+ (select .cse14 .cse10) 1)))))) (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse15 c_~A~0.base) .cse13) (select (select .cse15 c_~queue~0.base) .cse5))))) .cse9)) .cse11) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse8 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse19 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse18 (select .cse19 c_~queue~0.base)) (.cse17 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (+ (select .cse18 .cse10) 1)) (not (= (select .cse18 .cse5) (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17)))))))) (or .cse9 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse20 c_~queue~0.base) .cse5) (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse11) (= c_~ok~0 1) (or .cse8 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 (let ((.cse21 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse21 (= c_~start~0 c_~end~0)) (or .cse9 .cse21) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (or .cse8 .cse11 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse22 (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse23 (+ (* ~i~0 4) ~A~0.offset)) (.cse24 (select .cse22 c_~queue~0.base))) (or (not (= (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23) (select .cse24 .cse5))) (< (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse23) (+ (select .cse24 .cse10) 1))))))) (or .cse9 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse26 c_~queue~0.base) .cse5)))))))) (= c_~v_old~0 c_~last~0) (or .cse8 .cse11 (and (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse28 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse27 c_~A~0.base) .cse28) (select (select .cse27 c_~queue~0.base) .cse5)))) (< (select .cse29 .cse28) c_~last~0)))) .cse9) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse31 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse32 (select .cse30 c_~queue~0.base))) (or (not (= (select (select .cse30 c_~A~0.base) .cse31) (select .cse32 .cse5))) (< c_~v_old~0 (+ (select .cse32 .cse10) 1)))))) (< (select .cse29 .cse31) c_~last~0))))))))) is different from false [2023-11-19 07:34:32,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1))) (let ((.cse1 (< c_~end~0 0)) (.cse10 (< c_~n~0 .cse0)) (.cse5 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (not (= c_~end~0 0))) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse1 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse4 (select .cse7 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (+ (select .cse4 .cse5) 1)) (not (= (select .cse4 .cse6) (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse9 c_~queue~0.base) .cse6) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse10) (= c_~ok~0 1) (or .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse11 (= c_~start~0 c_~end~0)) (or .cse8 .cse11) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (or .cse1 .cse10 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse12 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset)) (.cse14 (select .cse12 c_~queue~0.base))) (or (not (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) (select .cse14 .cse6))) (< (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) (+ (select .cse14 .cse5) 1))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse16 c_~queue~0.base) .cse6))))))))))) is different from false [2023-11-19 07:34:32,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~end~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse23 (* c_~i~0 4)) (.cse4 (= c_~start~0 0))) (let ((.cse2 (not (= c_~end~0 0))) (.cse0 (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1))) (.cse1 (not .cse4)) (.cse7 (+ c_~A~0.offset .cse23)) (.cse21 (select .cse5 c_~queue~0.offset)) (.cse8 (< c_~end~0 0)) (.cse15 (< c_~n~0 .cse3)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse11 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse12 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse6 (select |c_#memory_int| c_~A~0.base))) (and (or (and .cse0 (or .cse1 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse2) (or (< 0 .cse3) (< c_~start~0 .cse3)) (or (and .cse4 (<= c_~v_old~0 (select .cse5 0))) (< c_~start~0 0)) .cse4 (or .cse2 (and .cse0 (or .cse1 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select .cse6 .cse7)))))) (or (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0) .cse8 (and (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse10 (select .cse9 c_~queue~0.base))) (or (not (= (select (select .cse9 c_~A~0.base) .cse7) (select .cse10 .cse11))) (< c_~v_old~0 (+ (select .cse10 .cse12) 1)))))) (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse13 c_~A~0.base) .cse7) (select (select .cse13 c_~queue~0.base) .cse11))))) .cse14)) .cse15) (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse8 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse19 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse18 (select .cse19 c_~queue~0.base)) (.cse17 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (+ (select .cse18 .cse12) 1)) (not (= (select .cse18 .cse11) (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17)))))))) (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse20 c_~queue~0.base) .cse11) (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse15) (= c_~ok~0 1) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse22 (select (select |c_#memory_int| ~A~0.base) (+ ~A~0.offset .cse23)))) (and (= .cse21 .cse22) (not (= c_~queue~0.base ~A~0.base)) (<= c_~v_old~0 .cse22)))) (or .cse8 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 (let ((.cse24 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse24 (= c_~start~0 c_~end~0)) (or .cse14 .cse24) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse25 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= c_~v_old~0 .cse25) (not (= c_~queue~0.base ~A~0.base)) (= .cse21 .cse25)))) (or .cse8 .cse15 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse27 (+ (* ~i~0 4) ~A~0.offset)) (.cse28 (select .cse26 c_~queue~0.base))) (or (not (= (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27) (select .cse28 .cse11))) (< (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27) (+ (select .cse28 .cse12) 1))))))) (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse30 c_~queue~0.base) .cse11)))))))) (= c_~v_old~0 c_~last~0) (or .cse8 .cse15 (and (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse32 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse31 c_~A~0.base) .cse32) (select (select .cse31 c_~queue~0.base) .cse11)))) (< (select .cse6 .cse32) c_~last~0)))) .cse14) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse34 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse35 (select .cse33 c_~queue~0.base))) (or (not (= (select (select .cse33 c_~A~0.base) .cse34) (select .cse35 .cse11))) (< c_~v_old~0 (+ (select .cse35 .cse12) 1)))))) (< (select .cse6 .cse34) c_~last~0))))))))) is different from false [2023-11-19 07:34:37,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1))) (let ((.cse1 (< c_~end~0 0)) (.cse10 (< c_~n~0 .cse0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (not (= c_~end~0 0))) (<= c_~v_old~0 c_~new~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse1 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse4 (select .cse7 c_~queue~0.base)) (.cse3 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (+ (select .cse4 .cse5) 1)) (not (= (select .cse4 .cse6) (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse9 c_~queue~0.base) .cse6) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse10) (= c_~ok~0 1) (or .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse11 (= c_~start~0 c_~end~0)) (or .cse8 .cse11) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (or .cse1 .cse10 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse12 (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset)) (.cse14 (select .cse12 c_~queue~0.base))) (or (not (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) (select .cse14 .cse6))) (< (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) (+ (select .cse14 .cse5) 1))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse16 c_~queue~0.base) .cse6)))))))) (or .cse1 .cse10 (let ((.cse19 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse18 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse17 c_~A~0.base) .cse18) (select (select .cse17 c_~queue~0.base) .cse6)))) (< (select .cse19 .cse18) c_~last~0)))) .cse8) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse21 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse22 (select .cse20 c_~queue~0.base))) (or (not (= (select (select .cse20 c_~A~0.base) .cse21) (select .cse22 .cse6))) (< c_~v_old~0 (+ (select .cse22 .cse5) 1)))))) (< (select .cse19 .cse21) c_~last~0)))))))))) is different from false [2023-11-19 07:34:41,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:34:43,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:34:43,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1))) (let ((.cse1 (< c_~end~0 0)) (.cse9 (< c_~n~0 .cse0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (not (= c_~end~0 0))) (<= c_~v_old~0 c_~new~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0) .cse1 (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse4 (select .cse2 c_~queue~0.base))) (or (not (= (select (select .cse2 c_~A~0.base) .cse3) (select .cse4 .cse5))) (< c_~v_old~0 (+ (select .cse4 .cse6) 1)))))) (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse7 c_~A~0.base) .cse3) (select (select .cse7 c_~queue~0.base) .cse5))))) .cse8))) .cse9) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse1 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse13 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse12 (select .cse13 c_~queue~0.base)) (.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse11) (+ (select .cse12 .cse6) 1)) (not (= (select .cse12 .cse5) (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse11)))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse14 c_~queue~0.base) .cse5) (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse9) (= c_~ok~0 1) (or .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse15 (= c_~start~0 c_~end~0)) (or .cse8 .cse15) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (or .cse1 .cse9 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse16 (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse17 (+ (* ~i~0 4) ~A~0.offset)) (.cse18 (select .cse16 c_~queue~0.base))) (or (not (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (select .cse18 .cse5))) (< (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (+ (select .cse18 .cse6) 1))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse20 c_~queue~0.base) .cse5)))))))) (or .cse1 .cse9 (let ((.cse23 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse21 c_~A~0.base) .cse22) (select (select .cse21 c_~queue~0.base) .cse5)))) (< (select .cse23 .cse22) c_~last~0)))) .cse8) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse25 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse26 (select .cse24 c_~queue~0.base))) (or (not (= (select (select .cse24 c_~A~0.base) .cse25) (select .cse26 .cse5))) (< c_~v_old~0 (+ (select .cse26 .cse6) 1)))))) (< (select .cse23 .cse25) c_~last~0)))))))))) is different from false [2023-11-19 07:34:44,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:34:45,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1))) (let ((.cse1 (< c_~end~0 0)) (.cse9 (< c_~n~0 .cse0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (not (= c_~end~0 0))) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0) .cse1 (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse4 (select .cse2 c_~queue~0.base))) (or (not (= (select (select .cse2 c_~A~0.base) .cse3) (select .cse4 .cse5))) (< c_~v_old~0 (+ (select .cse4 .cse6) 1)))))) (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse7 c_~A~0.base) .cse3) (select (select .cse7 c_~queue~0.base) .cse5))))) .cse8))) .cse9) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse1 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse13 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse12 (select .cse13 c_~queue~0.base)) (.cse11 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse11) (+ (select .cse12 .cse6) 1)) (not (= (select .cse12 .cse5) (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse11)))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse14 c_~queue~0.base) .cse5) (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))))))) .cse9) (= c_~ok~0 1) (or .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse15 (= c_~start~0 c_~end~0)) (or .cse8 .cse15) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (or .cse1 .cse9 (and (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse16 (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse17 (+ (* ~i~0 4) ~A~0.offset)) (.cse18 (select .cse16 c_~queue~0.base))) (or (not (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (select .cse18 .cse5))) (< (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) (+ (select .cse18 .cse6) 1))))))) (or .cse8 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse20 c_~queue~0.base) .cse5)))))))) (or .cse1 .cse9 (let ((.cse23 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse21 c_~A~0.base) .cse22) (select (select .cse21 c_~queue~0.base) .cse5)))) (< (select .cse23 .cse22) c_~last~0)))) .cse8) (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse25 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse26 (select .cse24 c_~queue~0.base))) (or (not (= (select (select .cse24 c_~A~0.base) .cse25) (select .cse26 .cse5))) (< c_~v_old~0 (+ (select .cse26 .cse6) 1)))))) (< (select .cse23 .cse25) c_~last~0)))))))))) is different from false