./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:59:12,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:59:12,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:59:12,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:59:12,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:59:12,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:59:12,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:59:12,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:59:12,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:59:12,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:59:12,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:59:12,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:59:12,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:59:12,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:59:12,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:59:12,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:59:12,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:59:12,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:59:12,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:59:12,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:59:12,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:59:12,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:59:12,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:59:12,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:59:12,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:59:12,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:59:12,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:59:12,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:59:12,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:59:12,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:59:12,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:59:12,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:59:12,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:59:12,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:59:12,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:59:12,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:59:12,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:59:12,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:59:12,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:59:12,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:59:12,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:59:12,869 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 01:59:12,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:59:12,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:59:12,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:59:12,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:59:12,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:59:12,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:59:12,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:59:12,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:59:12,915 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:59:12,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:59:12,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:59:12,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:59:12,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:59:12,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:59:12,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:59:12,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:59:12,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:59:12,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:59:12,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:59:12,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:59:12,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:59:12,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:59:12,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:59:12,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:59:12,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:12,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:59:12,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:59:12,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:59:12,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:59:12,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:59:12,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:59:12,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:59:12,923 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:59:12,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:59:12,923 INFO L138 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a025fe4ca65874bde9a09e6a2d9fa9eceda581ed1bc5b23e0ff5285795ed115b [2022-11-23 01:59:13,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:59:13,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:59:13,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:59:13,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:59:13,277 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:59:13,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-23 01:59:16,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:59:16,777 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:59:16,778 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-23 01:59:16,792 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/data/3111659e1/fa2af02ccc324fca9c8cef3be7a9d28d/FLAG9723f4000 [2022-11-23 01:59:16,808 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/data/3111659e1/fa2af02ccc324fca9c8cef3be7a9d28d [2022-11-23 01:59:16,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:59:16,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:59:16,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:16,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:59:16,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:59:16,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:16" (1/1) ... [2022-11-23 01:59:16,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a6bbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:16, skipping insertion in model container [2022-11-23 01:59:16,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:16" (1/1) ... [2022-11-23 01:59:16,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:59:16,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:59:17,293 WARN L237 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-23 01:59:17,317 WARN L237 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-23 01:59:17,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:17,350 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:59:17,417 WARN L237 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-23 01:59:17,426 WARN L237 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_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-23 01:59:17,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:17,477 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:59:17,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17 WrapperNode [2022-11-23 01:59:17,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:17,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:17,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:59:17,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:59:17,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,530 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2022-11-23 01:59:17,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:17,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:59:17,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:59:17,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:59:17,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,560 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:59:17,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:59:17,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:59:17,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:59:17,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (1/1) ... [2022-11-23 01:59:17,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:59:17,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:17,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:59:17,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:59:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:59:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-23 01:59:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-23 01:59:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:59:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:59:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:59:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:59:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:59:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:59:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:59:17,671 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:59:17,849 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:59:17,851 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:59:18,267 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:59:18,481 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:59:18,482 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 01:59:18,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:18 BoogieIcfgContainer [2022-11-23 01:59:18,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:59:18,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:59:18,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:59:18,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:59:18,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:16" (1/3) ... [2022-11-23 01:59:18,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5fc26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:18, skipping insertion in model container [2022-11-23 01:59:18,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:17" (2/3) ... [2022-11-23 01:59:18,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5fc26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:18, skipping insertion in model container [2022-11-23 01:59:18,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:18" (3/3) ... [2022-11-23 01:59:18,495 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2022-11-23 01:59:18,506 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 01:59:18,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:59:18,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 01:59:18,519 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:59:18,653 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:59:18,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,750 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2022-11-23 01:59:18,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:18,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 9/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2022-11-23 01:59:18,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,769 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:59:18,794 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,797 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 215 flow [2022-11-23 01:59:18,833 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2022-11-23 01:59:18,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:18,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 9/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2022-11-23 01:59:18,836 INFO L119 LiptonReduction]: Number of co-enabled transitions 1904 [2022-11-23 01:59:25,096 INFO L134 LiptonReduction]: Checked pairs total: 2376 [2022-11-23 01:59:25,097 INFO L136 LiptonReduction]: Total number of compositions: 97 [2022-11-23 01:59:25,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:59:25,138 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c69c6c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:59:25,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-23 01:59:25,151 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-11-23 01:59:25,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:59:25,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:25,154 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-23 01:59:25,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-23 01:59:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1261550843, now seen corresponding path program 1 times [2022-11-23 01:59:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:25,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207109397] [2022-11-23 01:59:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:25,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:59:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:25,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:59:25,416 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:59:25,418 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-23 01:59:25,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-23 01:59:25,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-23 01:59:25,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-23 01:59:25,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-23 01:59:25,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:59:25,422 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-23 01:59:25,425 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-23 01:59:25,425 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-23 01:59:25,498 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:59:25,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,589 INFO L130 PetriNetUnfolder]: 17/198 cut-off events. [2022-11-23 01:59:25,589 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 01:59:25,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 198 events. 17/198 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 149. Up to 6 conditions per place. [2022-11-23 01:59:25,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,599 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:59:25,599 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,601 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 174 transitions, 360 flow [2022-11-23 01:59:25,646 INFO L130 PetriNetUnfolder]: 17/198 cut-off events. [2022-11-23 01:59:25,647 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 01:59:25,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 198 events. 17/198 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 149. Up to 6 conditions per place. [2022-11-23 01:59:25,657 INFO L119 LiptonReduction]: Number of co-enabled transitions 13192 [2022-11-23 01:59:46,137 INFO L134 LiptonReduction]: Checked pairs total: 20237 [2022-11-23 01:59:46,137 INFO L136 LiptonReduction]: Total number of compositions: 151 [2022-11-23 01:59:46,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:59:46,142 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c69c6c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:59:46,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 01:59:46,146 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-11-23 01:59:46,146 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 01:59:46,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:46,147 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:59:46,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:59:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash 30023301, now seen corresponding path program 1 times [2022-11-23 01:59:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:46,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342680896] [2022-11-23 01:59:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342680896] [2022-11-23 01:59:46,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342680896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:46,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:46,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:59:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205783704] [2022-11-23 01:59:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:46,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 01:59:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 01:59:46,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 01:59:46,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 325 [2022-11-23 01:59:46,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 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) [2022-11-23 01:59:46,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:46,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 325 [2022-11-23 01:59:46,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:46,944 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2022-11-23 01:59:46,945 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-23 01:59:46,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8641 event pairs, 735 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2022-11-23 01:59:46,957 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-11-23 01:59:46,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2022-11-23 01:59:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 01:59:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 01:59:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 357 transitions. [2022-11-23 01:59:46,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5492307692307692 [2022-11-23 01:59:46,981 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 357 transitions. [2022-11-23 01:59:46,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 357 transitions. [2022-11-23 01:59:46,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:46,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 357 transitions. [2022-11-23 01:59:46,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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) [2022-11-23 01:59:47,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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) [2022-11-23 01:59:47,002 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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) [2022-11-23 01:59:47,004 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 357 transitions. [2022-11-23 01:59:47,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2022-11-23 01:59:47,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-23 01:59:47,013 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2022-11-23 01:59:47,015 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2022-11-23 01:59:47,019 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2022-11-23 01:59:47,020 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2022-11-23 01:59:47,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 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) [2022-11-23 01:59:47,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:47,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:47,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:59:47,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:59:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1202523955, now seen corresponding path program 1 times [2022-11-23 01:59:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:47,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432073876] [2022-11-23 01:59:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:47,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432073876] [2022-11-23 01:59:47,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432073876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:47,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:47,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:59:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331698084] [2022-11-23 01:59:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:47,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:59:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:49,063 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 325 [2022-11-23 01:59:49,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 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) [2022-11-23 01:59:49,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:49,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 325 [2022-11-23 01:59:49,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:50,532 INFO L130 PetriNetUnfolder]: 989/1555 cut-off events. [2022-11-23 01:59:50,532 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-23 01:59:50,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 1555 events. 989/1555 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8654 event pairs, 299 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 3140. Up to 1191 conditions per place. [2022-11-23 01:59:50,542 INFO L137 encePairwiseOnDemand]: 319/325 looper letters, 62 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-11-23 01:59:50,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 281 flow [2022-11-23 01:59:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:59:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:59:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-23 01:59:50,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-11-23 01:59:50,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-23 01:59:50,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-23 01:59:50,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:50,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-23 01:59:50,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2022-11-23 01:59:50,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 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) [2022-11-23 01:59:50,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 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) [2022-11-23 01:59:50,556 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 3 states and 500 transitions. [2022-11-23 01:59:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 281 flow [2022-11-23 01:59:50,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:59:50,560 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 127 flow [2022-11-23 01:59:50,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2022-11-23 01:59:50,561 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-11-23 01:59:50,561 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 127 flow [2022-11-23 01:59:50,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 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) [2022-11-23 01:59:50,562 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:50,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:50,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:59:50,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:59:50,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1207921244, now seen corresponding path program 1 times [2022-11-23 01:59:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:50,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118461045] [2022-11-23 01:59:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:52,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118461045] [2022-11-23 01:59:52,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118461045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:52,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:52,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:59:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397262082] [2022-11-23 01:59:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:59:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:52,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:59:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:59:55,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 325 [2022-11-23 01:59:55,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 127 flow. Second operand has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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) [2022-11-23 01:59:55,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:59:55,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 325 [2022-11-23 01:59:55,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:59:59,854 INFO L130 PetriNetUnfolder]: 1704/2686 cut-off events. [2022-11-23 01:59:59,855 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-11-23 01:59:59,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5771 conditions, 2686 events. 1704/2686 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 15955 event pairs, 218 based on Foata normal form. 34/2162 useless extension candidates. Maximal degree in co-relation 5764. Up to 1440 conditions per place. [2022-11-23 01:59:59,872 INFO L137 encePairwiseOnDemand]: 308/325 looper letters, 163 selfloop transitions, 39 changer transitions 0/205 dead transitions. [2022-11-23 01:59:59,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 205 transitions, 913 flow [2022-11-23 01:59:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 01:59:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 01:59:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1777 transitions. [2022-11-23 01:59:59,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45564102564102565 [2022-11-23 01:59:59,902 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1777 transitions. [2022-11-23 01:59:59,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1777 transitions. [2022-11-23 01:59:59,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:59,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1777 transitions. [2022-11-23 01:59:59,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.08333333333334) internal successors, (1777), 12 states have internal predecessors, (1777), 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) [2022-11-23 01:59:59,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 325.0) internal successors, (4225), 13 states have internal predecessors, (4225), 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) [2022-11-23 01:59:59,921 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 325.0) internal successors, (4225), 13 states have internal predecessors, (4225), 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) [2022-11-23 01:59:59,922 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 127 flow. Second operand 12 states and 1777 transitions. [2022-11-23 01:59:59,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 205 transitions, 913 flow [2022-11-23 01:59:59,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 205 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:59:59,930 INFO L231 Difference]: Finished difference. Result has 64 places, 92 transitions, 427 flow [2022-11-23 01:59:59,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=427, PETRI_PLACES=64, PETRI_TRANSITIONS=92} [2022-11-23 01:59:59,935 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-11-23 01:59:59,935 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 92 transitions, 427 flow [2022-11-23 01:59:59,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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) [2022-11-23 01:59:59,936 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:59:59,936 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-23 01:59:59,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:59:59,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:59:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1709169059, now seen corresponding path program 1 times [2022-11-23 01:59:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:59,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312062035] [2022-11-23 01:59:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:59,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:59:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:59,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:59:59,977 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:59:59,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-23 01:59:59,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 01:59:59,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-11-23 01:59:59,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-23 01:59:59,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-23 01:59:59,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-23 01:59:59,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 01:59:59,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:59:59,979 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-23 01:59:59,980 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-23 01:59:59,980 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-23 02:00:00,069 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 02:00:00,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,130 INFO L130 PetriNetUnfolder]: 25/280 cut-off events. [2022-11-23 02:00:00,131 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-23 02:00:00,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 280 events. 25/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1095 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 217. Up to 8 conditions per place. [2022-11-23 02:00:00,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,137 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:00:00,137 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,137 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 507 flow [2022-11-23 02:00:00,182 INFO L130 PetriNetUnfolder]: 25/280 cut-off events. [2022-11-23 02:00:00,183 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-23 02:00:00,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 280 events. 25/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1095 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 217. Up to 8 conditions per place. [2022-11-23 02:00:00,200 INFO L119 LiptonReduction]: Number of co-enabled transitions 33864 [2022-11-23 02:00:59,822 INFO L134 LiptonReduction]: Checked pairs total: 51171 [2022-11-23 02:00:59,823 INFO L136 LiptonReduction]: Total number of compositions: 216 [2022-11-23 02:00:59,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:00:59,826 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c69c6c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:00:59,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-23 02:00:59,829 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-11-23 02:00:59,830 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 02:00:59,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:00:59,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:00:59,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-23 02:00:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1586234543, now seen corresponding path program 1 times [2022-11-23 02:00:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:59,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110653298] [2022-11-23 02:00:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:00:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:00:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:00:59,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110653298] [2022-11-23 02:00:59,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110653298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:00:59,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:00:59,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:00:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568984742] [2022-11-23 02:00:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:00:59,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:00:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:00:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:00:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:00:59,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 459 [2022-11-23 02:00:59,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 74 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 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) [2022-11-23 02:00:59,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:00:59,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 459 [2022-11-23 02:00:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:01:05,540 INFO L130 PetriNetUnfolder]: 26335/34997 cut-off events. [2022-11-23 02:01:05,540 INFO L131 PetriNetUnfolder]: For 1906/1906 co-relation queries the response was YES. [2022-11-23 02:01:05,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70986 conditions, 34997 events. 26335/34997 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 1990. Compared 203948 event pairs, 18655 based on Foata normal form. 0/23893 useless extension candidates. Maximal degree in co-relation 3351. Up to 34528 conditions per place. [2022-11-23 02:01:05,776 INFO L137 encePairwiseOnDemand]: 452/459 looper letters, 64 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2022-11-23 02:01:05,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 283 flow [2022-11-23 02:01:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:01:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:01:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 499 transitions. [2022-11-23 02:01:05,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5435729847494554 [2022-11-23 02:01:05,779 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 499 transitions. [2022-11-23 02:01:05,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 499 transitions. [2022-11-23 02:01:05,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:01:05,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 499 transitions. [2022-11-23 02:01:05,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 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) [2022-11-23 02:01:05,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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) [2022-11-23 02:01:05,785 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 459.0) internal successors, (1377), 3 states have internal predecessors, (1377), 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) [2022-11-23 02:01:05,785 INFO L175 Difference]: Start difference. First operand has 60 places, 74 transitions, 169 flow. Second operand 2 states and 499 transitions. [2022-11-23 02:01:05,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 283 flow [2022-11-23 02:01:05,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 277 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-23 02:01:05,794 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 149 flow [2022-11-23 02:01:05,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2022-11-23 02:01:05,798 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2022-11-23 02:01:05,798 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 149 flow [2022-11-23 02:01:05,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 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) [2022-11-23 02:01:05,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:01:05,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:01:05,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:01:05,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-23 02:01:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:01:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash 346054488, now seen corresponding path program 1 times [2022-11-23 02:01:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:01:05,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122737746] [2022-11-23 02:01:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:01:05,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:01:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:01:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:01:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:01:07,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122737746] [2022-11-23 02:01:07,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122737746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:01:07,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:01:07,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:01:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466831944] [2022-11-23 02:01:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:01:07,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:01:07,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:01:07,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:01:07,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:01:11,584 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 459 [2022-11-23 02:01:11,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 149 flow. Second operand has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 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) [2022-11-23 02:01:11,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:01:11,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 459 [2022-11-23 02:01:11,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:01:26,154 INFO L130 PetriNetUnfolder]: 46302/61766 cut-off events. [2022-11-23 02:01:26,154 INFO L131 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2022-11-23 02:01:26,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124484 conditions, 61766 events. 46302/61766 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 3349. Compared 388745 event pairs, 22037 based on Foata normal form. 0/43097 useless extension candidates. Maximal degree in co-relation 124478. Up to 37236 conditions per place. [2022-11-23 02:01:26,472 INFO L137 encePairwiseOnDemand]: 440/459 looper letters, 299 selfloop transitions, 46 changer transitions 0/348 dead transitions. [2022-11-23 02:01:26,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 348 transitions, 1451 flow [2022-11-23 02:01:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:01:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 02:01:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2621 transitions. [2022-11-23 02:01:26,479 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4758533042846768 [2022-11-23 02:01:26,479 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2621 transitions. [2022-11-23 02:01:26,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2621 transitions. [2022-11-23 02:01:26,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:01:26,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2621 transitions. [2022-11-23 02:01:26,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 218.41666666666666) internal successors, (2621), 12 states have internal predecessors, (2621), 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) [2022-11-23 02:01:26,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 459.0) internal successors, (5967), 13 states have internal predecessors, (5967), 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) [2022-11-23 02:01:26,498 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 459.0) internal successors, (5967), 13 states have internal predecessors, (5967), 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) [2022-11-23 02:01:26,498 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 149 flow. Second operand 12 states and 2621 transitions. [2022-11-23 02:01:26,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 348 transitions, 1451 flow [2022-11-23 02:01:26,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 1451 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:01:26,513 INFO L231 Difference]: Finished difference. Result has 76 places, 118 transitions, 440 flow [2022-11-23 02:01:26,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=440, PETRI_PLACES=76, PETRI_TRANSITIONS=118} [2022-11-23 02:01:26,515 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2022-11-23 02:01:26,516 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 118 transitions, 440 flow [2022-11-23 02:01:26,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 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) [2022-11-23 02:01:26,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:01:26,517 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:01:26,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:01:26,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-23 02:01:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:01:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash 348023022, now seen corresponding path program 1 times [2022-11-23 02:01:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:01:26,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897969467] [2022-11-23 02:01:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:01:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:01:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:01:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:01:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:01:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897969467] [2022-11-23 02:01:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897969467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:01:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:01:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 02:01:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534185733] [2022-11-23 02:01:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:01:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:01:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:01:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:01:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:01:31,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 459 [2022-11-23 02:01:31,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 118 transitions, 440 flow. Second operand has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 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) [2022-11-23 02:01:31,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:01:31,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 459 [2022-11-23 02:01:31,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:01:48,573 INFO L130 PetriNetUnfolder]: 67046/89255 cut-off events. [2022-11-23 02:01:48,573 INFO L131 PetriNetUnfolder]: For 41067/41139 co-relation queries the response was YES. [2022-11-23 02:01:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221586 conditions, 89255 events. 67046/89255 cut-off events. For 41067/41139 co-relation queries the response was YES. Maximal size of possible extension queue 4622. Compared 577026 event pairs, 33889 based on Foata normal form. 200/71148 useless extension candidates. Maximal degree in co-relation 221574. Up to 62951 conditions per place. [2022-11-23 02:01:49,089 INFO L137 encePairwiseOnDemand]: 441/459 looper letters, 309 selfloop transitions, 52 changer transitions 0/364 dead transitions. [2022-11-23 02:01:49,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 364 transitions, 1855 flow [2022-11-23 02:01:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:01:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-23 02:01:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2950 transitions. [2022-11-23 02:01:49,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4590725178960473 [2022-11-23 02:01:49,098 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2950 transitions. [2022-11-23 02:01:49,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2950 transitions. [2022-11-23 02:01:49,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:01:49,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2950 transitions. [2022-11-23 02:01:49,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 210.71428571428572) internal successors, (2950), 14 states have internal predecessors, (2950), 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) [2022-11-23 02:01:49,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 459.0) internal successors, (6885), 15 states have internal predecessors, (6885), 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) [2022-11-23 02:01:49,120 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 459.0) internal successors, (6885), 15 states have internal predecessors, (6885), 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) [2022-11-23 02:01:49,120 INFO L175 Difference]: Start difference. First operand has 76 places, 118 transitions, 440 flow. Second operand 14 states and 2950 transitions. [2022-11-23 02:01:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 364 transitions, 1855 flow [2022-11-23 02:01:49,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 364 transitions, 1855 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:01:49,512 INFO L231 Difference]: Finished difference. Result has 95 places, 168 transitions, 816 flow [2022-11-23 02:01:49,512 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=816, PETRI_PLACES=95, PETRI_TRANSITIONS=168} [2022-11-23 02:01:49,513 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2022-11-23 02:01:49,513 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 168 transitions, 816 flow [2022-11-23 02:01:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 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) [2022-11-23 02:01:49,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:01:49,514 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:01:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:01:49,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-23 02:01:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:01:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -669661749, now seen corresponding path program 1 times [2022-11-23 02:01:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:01:49,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365412286] [2022-11-23 02:01:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:01:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:01:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:01:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:01:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:01:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365412286] [2022-11-23 02:01:53,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365412286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:01:53,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920454657] [2022-11-23 02:01:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:01:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:01:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:01:53,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:01:53,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32ebebb7-f99f-400e-b8d0-e00d7ebb5b54/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:01:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:01:54,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-23 02:01:54,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:01:54,451 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 02:01:54,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-23 02:01:54,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 02:01:55,630 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-23 02:01:55,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 02:01:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:01:56,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:01:57,389 INFO L321 Elim1Store]: treesize reduction 124, result has 28.3 percent of original size [2022-11-23 02:01:57,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 518 [2022-11-23 02:01:57,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2022-11-23 02:01:57,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2022-11-23 02:01:57,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2022-11-23 02:02:00,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:00,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:00,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:00,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:00,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:00,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:01,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 268 [2022-11-23 02:02:01,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:01,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 67 treesize of output 50 [2022-11-23 02:02:01,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 39 treesize of output 34 [2022-11-23 02:02:01,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:01,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:01,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:01,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:01,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:02:01,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:01,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 82 [2022-11-23 02:02:01,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 21 treesize of output 16 [2022-11-23 02:02:02,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:02:02,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 23 [2022-11-23 02:02:02,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:02:02,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 02:02:03,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-23 02:02:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:02:04,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:02:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:02:07,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920454657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:02:07,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:02:07,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-11-23 02:02:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648727367] [2022-11-23 02:02:07,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:02:07,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 02:02:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:02:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 02:02:07,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=364, Unknown=17, NotChecked=0, Total=462 [2022-11-23 02:02:10,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:02:12,744 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] [2022-11-23 02:02:15,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:02:19,558 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] [2022-11-23 02:02:22,526 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 459 [2022-11-23 02:02:22,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 168 transitions, 816 flow. Second operand has 22 states, 22 states have (on average 156.22727272727272) internal successors, (3437), 22 states have internal predecessors, (3437), 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) [2022-11-23 02:02:22,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:02:22,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 459 [2022-11-23 02:02:22,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:02:42,525 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 125 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:02:44,879 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, 1] [2022-11-23 02:02:47,880 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, 1] [2022-11-23 02:02:58,781 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:03:01,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:04,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:06,437 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] [2022-11-23 02:03:06,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse13 (mod .cse16 4294967296))) (let ((.cse5 (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#t~0#1.offset| |c_~#value~0.offset|)) (.cse6 (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0)) (.cse0 (= .cse2 .cse13)) (.cse10 (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1)) (.cse14 (+ 1 .cse16))) (and (or .cse0 (forall ((v_ArrVal_174 (Array Int Int)) (v_ArrVal_166 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_166) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (= (mod (select (select .cse1 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (let ((.cse3 (not .cse5))) (and (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 0) (or .cse3 (<= |c_#pthreadsForks| 1)) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse3 .cse4) (or .cse3 (<= 1 |c_#pthreadsForks|)))) (not .cse6)) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_164))) (let ((.cse8 (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse7 (store (store (store (store .cse9 |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store .cse9 |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse8))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| (store (select (store (store .cse9 |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (not (= (mod (select (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse7 |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0) 4294967296) 0) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0)) (< (mod .cse8 4294967296) (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (or (and .cse5 (or (not (<= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| (+ (* 4294967296 (div |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) 4294967294))) (<= |c_#pthreadsForks| .cse10)) (<= .cse10 |c_#pthreadsForks|) .cse4) .cse6) (or (not .cse0) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse11 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse10)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (not (= (mod (select (select .cse11 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse11 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 0 |c_~#value~0.offset|) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse14)) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (= (mod (select (select .cse12 |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0) 4294967296) 0) (< .cse13 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0))))) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse15 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse14)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (= (mod (select (select .cse15 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= 0 (mod (select (select .cse15 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (< .cse13 (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2022-11-23 02:03:08,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:30,228 WARN L233 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:03:32,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:35,220 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] [2022-11-23 02:03:38,203 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] [2022-11-23 02:03:40,532 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] [2022-11-23 02:03:42,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:45,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:03:52,947 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:04:15,323 WARN L233 SmtUtils]: Spent 18.01s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:04:19,192 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] [2022-11-23 02:04:20,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:23,135 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse10 (mod .cse13 4294967296))) (let ((.cse5 (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#t~0#1.offset| |c_~#value~0.offset|)) (.cse6 (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0)) (.cse0 (= .cse2 .cse10)) (.cse7 (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1)) (.cse11 (+ 1 .cse13))) (and (or .cse0 (forall ((v_ArrVal_174 (Array Int Int)) (v_ArrVal_166 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_166) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (= (mod (select (select .cse1 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (let ((.cse3 (not .cse5))) (and (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 0) (or .cse3 (<= |c_#pthreadsForks| 1)) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse3 .cse4) (or .cse3 (<= 1 |c_#pthreadsForks|)))) (not .cse6)) (or (and .cse5 (or (not (<= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| (+ (* 4294967296 (div |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) 4294967294))) (<= |c_#pthreadsForks| .cse7)) (<= .cse7 |c_#pthreadsForks|) .cse4) .cse6) (or (not .cse0) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse8 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 0 |c_~#value~0.offset|) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| Int) (v_ArrVal_169 (Array Int Int))) (let ((.cse9 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse11)) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (= (mod (select (select .cse9 |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0) 4294967296) 0) (< .cse10 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse9 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_245|) 0))))) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse11)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (= (mod (select (select .cse12 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= 0 (mod (select (select .cse12 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (< .cse10 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2022-11-23 02:04:26,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:28,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:30,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:31,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:33,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:37,403 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] [2022-11-23 02:04:39,639 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] [2022-11-23 02:04:41,950 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] [2022-11-23 02:04:44,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:46,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:48,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:04:51,232 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] [2022-11-23 02:05:59,452 WARN L233 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:06:01,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:06:04,116 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, 1] [2022-11-23 02:06:05,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:06:07,187 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, 1] [2022-11-23 02:06:09,213 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, 1] [2022-11-23 02:06:13,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:16,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:18,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:34,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:43,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:45,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:49,179 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] [2022-11-23 02:06:53,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:06:54,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:57,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:06:57,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse9 (mod .cse11 4294967296))) (let ((.cse5 (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#t~0#1.offset| |c_~#value~0.offset|)) (.cse6 (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0)) (.cse0 (= .cse2 .cse9)) (.cse7 (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) (and (or .cse0 (forall ((v_ArrVal_174 (Array Int Int)) (v_ArrVal_166 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_166) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (= (mod (select (select .cse1 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (let ((.cse3 (not .cse5))) (and (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 0) (or .cse3 (<= |c_#pthreadsForks| 1)) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse3 .cse4) (or .cse3 (<= 1 |c_#pthreadsForks|)))) (not .cse6)) (or (and .cse5 (or (not (<= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| (+ (* 4294967296 (div |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) 4294967294))) (<= |c_#pthreadsForks| .cse7)) (<= .cse7 |c_#pthreadsForks|) .cse4) .cse6) (or (not .cse0) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse8 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 0 |c_~#value~0.offset|) (or (< .cse2 .cse9) (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse11))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (= (mod (select (select .cse10 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= 0 (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (< .cse9 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2022-11-23 02:07:00,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:04,872 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] [2022-11-23 02:07:07,149 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] [2022-11-23 02:07:09,563 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] [2022-11-23 02:07:11,783 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] [2022-11-23 02:07:15,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:18,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:20,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:22,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:32,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:34,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:07:37,968 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, 1] [2022-11-23 02:07:40,540 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, 1] [2022-11-23 02:07:43,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:46,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:48,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:49,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:50,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:52,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:07:55,843 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, 1] [2022-11-23 02:07:58,516 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, 1] [2022-11-23 02:08:01,814 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] [2022-11-23 02:08:03,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:08:07,121 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] [2022-11-23 02:08:09,947 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, 1] [2022-11-23 02:08:14,558 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] [2022-11-23 02:08:16,604 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] [2022-11-23 02:08:18,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:08:20,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:08:28,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:08:30,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:08:32,506 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] [2022-11-23 02:08:34,803 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] [2022-11-23 02:08:58,665 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:09:05,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:07,638 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] [2022-11-23 02:09:08,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:10,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:13,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:16,230 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] [2022-11-23 02:09:19,422 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, 1] [2022-11-23 02:09:21,440 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, 1] [2022-11-23 02:09:23,492 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, 1] [2022-11-23 02:09:25,506 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, 1] [2022-11-23 02:09:29,475 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] [2022-11-23 02:09:31,872 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] [2022-11-23 02:09:35,322 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] [2022-11-23 02:09:37,337 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] [2022-11-23 02:09:39,367 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] [2022-11-23 02:09:41,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:43,567 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] [2022-11-23 02:09:45,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:48,292 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] [2022-11-23 02:09:50,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:53,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:09:55,668 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] [2022-11-23 02:09:57,713 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] [2022-11-23 02:10:04,780 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] [2022-11-23 02:10:06,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:09,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:11,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:13,643 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] [2022-11-23 02:10:15,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:30,137 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] [2022-11-23 02:10:31,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:38,592 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] [2022-11-23 02:10:41,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:43,374 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] [2022-11-23 02:10:46,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, 1] [2022-11-23 02:10:48,475 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, 1] [2022-11-23 02:10:50,525 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, 1] [2022-11-23 02:10:53,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:55,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:57,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:10:59,971 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] [2022-11-23 02:11:00,548 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse9 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (let ((.cse5 (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~#t~0#1.offset| |c_~#value~0.offset|)) (.cse6 (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0)) (.cse0 (= .cse2 .cse9)) (.cse7 (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) (and (or .cse0 (forall ((v_ArrVal_174 (Array Int Int)) (v_ArrVal_166 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_166) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (= (mod (select (select .cse1 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (let ((.cse3 (not .cse5))) (and (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 0) (or .cse3 (<= |c_#pthreadsForks| 1)) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse3 .cse4) (or .cse3 (<= 1 |c_#pthreadsForks|)))) (not .cse6)) (or (and .cse5 (or (not (<= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| (+ (* 4294967296 (div |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) 4294967294))) (<= |c_#pthreadsForks| .cse7)) (<= .cse7 |c_#pthreadsForks|) .cse4) .cse6) (or (not .cse0) (forall ((|v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_170 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (v_ArrVal_168 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse8 (store (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_169) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_171) |c_~#value~0.base|) |c_~#value~0.offset| .cse7)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39| v_ArrVal_168) |c_~#value~0.base| v_ArrVal_170) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_174))) (or (< |c_~#inc_flag~0.base| |v_thr1Thread1of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_39|) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (= 0 |c_~#value~0.offset|) (or (< .cse2 .cse9) (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)))))) is different from false [2022-11-23 02:11:02,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:04,964 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] [2022-11-23 02:11:07,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:13,143 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] [2022-11-23 02:11:24,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:27,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:29,095 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] [2022-11-23 02:11:33,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:35,100 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] [2022-11-23 02:11:37,130 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] [2022-11-23 02:11:39,325 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] [2022-11-23 02:11:41,789 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] [2022-11-23 02:11:43,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:45,982 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] [2022-11-23 02:11:48,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:52,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:54,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:11:57,387 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] [2022-11-23 02:12:01,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:04,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:06,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:08,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:10,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:18,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:20,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:22,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:26,500 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] [2022-11-23 02:12:28,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:31,758 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] [2022-11-23 02:12:37,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:39,745 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] [2022-11-23 02:12:41,767 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] [2022-11-23 02:12:43,831 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] [2022-11-23 02:12:46,198 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] [2022-11-23 02:12:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:12:53,674 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] [2022-11-23 02:13:13,863 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:13:35,983 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, 1] [2022-11-23 02:13:39,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:13:49,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:13:51,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]