./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 16:58:38,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:58:38,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:58:38,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:58:38,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:58:38,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:58:38,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:58:38,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:58:38,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:58:38,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:58:38,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:58:38,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:58:38,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:58:38,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:58:38,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:58:38,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:58:38,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:58:38,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:58:38,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:58:38,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:58:38,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:58:38,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:58:38,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:58:38,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:58:38,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:58:38,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:58:38,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:58:38,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:58:38,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:58:38,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:58:38,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:58:38,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:58:38,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:58:38,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:58:38,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:58:38,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:58:38,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:58:38,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:58:38,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:58:38,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:58:38,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:58:38,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:58:38,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:58:38,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:58:38,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:58:38,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:58:38,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:58:38,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:58:38,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:58:38,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:58:38,934 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:58:38,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:58:38,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:58:38,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:58:38,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:58:38,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:58:38,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:58:38,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:58:38,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:58:38,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:58:38,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:58:38,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:58:38,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:58:38,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:58:38,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:58:38,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:58:38,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:38,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:58:38,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:58:38,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:58:38,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:58:38,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:58:38,938 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:58:38,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:58:38,939 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:58:38,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:58:38,939 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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R 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-25 16:58:39,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:58:39,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:58:39,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:58:39,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:58:39,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:58:39,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-25 16:58:42,486 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:58:42,804 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:58:42,810 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/sv-benchmarks/c/pthread-ext/04_incdec_cas.i [2022-11-25 16:58:42,823 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/data/bbe1218bf/3d6e0576e75e4b53b748c082d0112975/FLAG0f5a0054d [2022-11-25 16:58:42,838 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/data/bbe1218bf/3d6e0576e75e4b53b748c082d0112975 [2022-11-25 16:58:42,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:58:42,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:58:42,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:42,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:58:42,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:58:42,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:42" (1/1) ... [2022-11-25 16:58:42,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71403ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:42, skipping insertion in model container [2022-11-25 16:58:42,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:58:42" (1/1) ... [2022-11-25 16:58:42,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:58:42,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:58:43,352 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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-25 16:58:43,365 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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-25 16:58:43,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:43,389 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:58:43,432 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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30285,30298] [2022-11-25 16:58:43,437 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_d1b8fbc4-ce66-48c9-882a-506c5ba67977/sv-benchmarks/c/pthread-ext/04_incdec_cas.i[30729,30742] [2022-11-25 16:58:43,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:58:43,482 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:58:43,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43 WrapperNode [2022-11-25 16:58:43,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:58:43,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:43,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:58:43,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:58:43,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,567 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2022-11-25 16:58:43,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:58:43,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:58:43,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:58:43,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:58:43,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:58:43,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:58:43,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:58:43,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:58:43,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (1/1) ... [2022-11-25 16:58:43,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:58:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:58:43,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:58:43,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:58:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:58:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 16:58:43,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 16:58:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:58:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:58:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:58:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:58:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:58:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:58:43,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:58:43,779 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:58:44,000 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:58:44,016 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:58:44,372 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:58:44,647 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:58:44,648 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 16:58:44,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:44 BoogieIcfgContainer [2022-11-25 16:58:44,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:58:44,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:58:44,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:58:44,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:58:44,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:58:42" (1/3) ... [2022-11-25 16:58:44,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcb5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:44, skipping insertion in model container [2022-11-25 16:58:44,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:58:43" (2/3) ... [2022-11-25 16:58:44,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dcb5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:58:44, skipping insertion in model container [2022-11-25 16:58:44,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:58:44" (3/3) ... [2022-11-25 16:58:44,660 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2022-11-25 16:58:44,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:58:44,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:58:44,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:58:44,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:58:44,795 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:58:44,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:44,949 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2022-11-25 16:58:44,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:44,960 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-25 16:58:44,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:44,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:44,975 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:58:44,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:45,002 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:45,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 215 flow [2022-11-25 16:58:45,038 INFO L130 PetriNetUnfolder]: 9/116 cut-off events. [2022-11-25 16:58:45,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:45,040 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-25 16:58:45,042 INFO L119 LiptonReduction]: Number of co-enabled transitions 1904 [2022-11-25 16:58:52,317 INFO L134 LiptonReduction]: Checked pairs total: 2376 [2022-11-25 16:58:52,317 INFO L136 LiptonReduction]: Total number of compositions: 97 [2022-11-25 16:58:52,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:58:52,343 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;@76664ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:58:52,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 16:58:52,348 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-11-25 16:58:52,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:58:52,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:58:52,350 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 16:58:52,350 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-25 16:58:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:58:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1261550843, now seen corresponding path program 1 times [2022-11-25 16:58:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:58:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717364904] [2022-11-25 16:58:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:58:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:58:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:52,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:58:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:58:52,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:58:52,540 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:58:52,542 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-25 16:58:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-25 16:58:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-11-25 16:58:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-25 16:58:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-25 16:58:52,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:58:52,546 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 16:58:52,550 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 16:58:52,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 16:58:52,617 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:58:52,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,673 INFO L130 PetriNetUnfolder]: 17/198 cut-off events. [2022-11-25 16:58:52,674 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 16:58:52,677 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-25 16:58:52,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,680 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:58:52,680 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,680 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 174 transitions, 360 flow [2022-11-25 16:58:52,722 INFO L130 PetriNetUnfolder]: 17/198 cut-off events. [2022-11-25 16:58:52,723 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 16:58:52,726 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-25 16:58:52,734 INFO L119 LiptonReduction]: Number of co-enabled transitions 13192 [2022-11-25 16:59:13,354 INFO L134 LiptonReduction]: Checked pairs total: 20237 [2022-11-25 16:59:13,354 INFO L136 LiptonReduction]: Total number of compositions: 151 [2022-11-25 16:59:13,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:59:13,359 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;@76664ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:59:13,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 16:59:13,364 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-11-25 16:59:13,365 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 16:59:13,365 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:13,365 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:59:13,366 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-25 16:59:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 30023301, now seen corresponding path program 1 times [2022-11-25 16:59:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215642038] [2022-11-25 16:59:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:13,465 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-25 16:59:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215642038] [2022-11-25 16:59:13,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215642038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:13,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:59:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238537412] [2022-11-25 16:59:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:13,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:59:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:59:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:59:13,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 325 [2022-11-25 16:59:13,507 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-25 16:59:13,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:13,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 325 [2022-11-25 16:59:13,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:14,190 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2022-11-25 16:59:14,190 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-25 16:59:14,195 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-25 16:59:14,209 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-11-25 16:59:14,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2022-11-25 16:59:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:59:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:59:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 357 transitions. [2022-11-25 16:59:14,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5492307692307692 [2022-11-25 16:59:14,238 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 357 transitions. [2022-11-25 16:59:14,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 357 transitions. [2022-11-25 16:59:14,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:14,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 357 transitions. [2022-11-25 16:59:14,253 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-25 16:59:14,260 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-25 16:59:14,261 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-25 16:59:14,263 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 357 transitions. [2022-11-25 16:59:14,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2022-11-25 16:59:14,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:14,271 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2022-11-25 16:59:14,274 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-25 16:59:14,280 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2022-11-25 16:59:14,280 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2022-11-25 16:59:14,281 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-25 16:59:14,281 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:14,281 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:14,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:59:14,282 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-25 16:59:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1202523955, now seen corresponding path program 1 times [2022-11-25 16:59:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546770616] [2022-11-25 16:59:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:15,414 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-25 16:59:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:15,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546770616] [2022-11-25 16:59:15,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546770616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:15,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:59:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698779657] [2022-11-25 16:59:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:15,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:59:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:15,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:59:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:59:16,386 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 325 [2022-11-25 16:59:16,387 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-25 16:59:16,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:16,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 325 [2022-11-25 16:59:16,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:17,808 INFO L130 PetriNetUnfolder]: 989/1555 cut-off events. [2022-11-25 16:59:17,809 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-25 16:59:17,811 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-25 16:59:17,820 INFO L137 encePairwiseOnDemand]: 319/325 looper letters, 62 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-11-25 16:59:17,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 281 flow [2022-11-25 16:59:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:59:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:59:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-25 16:59:17,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-11-25 16:59:17,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-25 16:59:17,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-25 16:59:17,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:17,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-25 16:59:17,828 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-25 16:59:17,832 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-25 16:59:17,833 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-25 16:59:17,834 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 3 states and 500 transitions. [2022-11-25 16:59:17,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 281 flow [2022-11-25 16:59:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 281 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:59:17,837 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 127 flow [2022-11-25 16:59:17,838 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-25 16:59:17,838 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-11-25 16:59:17,839 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 127 flow [2022-11-25 16:59:17,839 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-25 16:59:17,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:17,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:59:17,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:59:17,840 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-25 16:59:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1207921244, now seen corresponding path program 1 times [2022-11-25 16:59:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:17,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206482941] [2022-11-25 16:59:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:59:19,380 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-25 16:59:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:59:19,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206482941] [2022-11-25 16:59:19,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206482941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:59:19,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:59:19,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:59:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594232476] [2022-11-25 16:59:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:59:19,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:59:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:59:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:59:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:59:22,908 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 325 [2022-11-25 16:59:22,910 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-25 16:59:22,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:59:22,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 325 [2022-11-25 16:59:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:59:27,461 INFO L130 PetriNetUnfolder]: 1704/2686 cut-off events. [2022-11-25 16:59:27,462 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-11-25 16:59:27,467 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-25 16:59:27,482 INFO L137 encePairwiseOnDemand]: 308/325 looper letters, 163 selfloop transitions, 39 changer transitions 0/205 dead transitions. [2022-11-25 16:59:27,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 205 transitions, 913 flow [2022-11-25 16:59:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:59:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 16:59:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1777 transitions. [2022-11-25 16:59:27,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45564102564102565 [2022-11-25 16:59:27,488 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1777 transitions. [2022-11-25 16:59:27,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1777 transitions. [2022-11-25 16:59:27,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:59:27,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1777 transitions. [2022-11-25 16:59:27,495 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-25 16:59:27,503 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-25 16:59:27,505 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-25 16:59:27,506 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 127 flow. Second operand 12 states and 1777 transitions. [2022-11-25 16:59:27,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 205 transitions, 913 flow [2022-11-25 16:59:27,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 205 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:59:27,511 INFO L231 Difference]: Finished difference. Result has 64 places, 92 transitions, 427 flow [2022-11-25 16:59:27,512 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-25 16:59:27,512 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-11-25 16:59:27,513 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 92 transitions, 427 flow [2022-11-25 16:59:27,514 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-25 16:59:27,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:59:27,514 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 16:59:27,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:59:27,515 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-25 16:59:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:59:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1709169059, now seen corresponding path program 1 times [2022-11-25 16:59:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:59:27,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488802622] [2022-11-25 16:59:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:59:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:59:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:27,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:59:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:59:27,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:59:27,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:59:27,545 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-25 16:59:27,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 16:59:27,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-11-25 16:59:27,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-25 16:59:27,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-25 16:59:27,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-25 16:59:27,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 16:59:27,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:59:27,547 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-25 16:59:27,548 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 16:59:27,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 16:59:27,628 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:59:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,684 INFO L130 PetriNetUnfolder]: 25/280 cut-off events. [2022-11-25 16:59:27,684 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 16:59:27,688 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-25 16:59:27,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,692 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:59:27,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 507 flow [2022-11-25 16:59:27,741 INFO L130 PetriNetUnfolder]: 25/280 cut-off events. [2022-11-25 16:59:27,741 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 16:59:27,746 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-25 16:59:27,763 INFO L119 LiptonReduction]: Number of co-enabled transitions 33864 [2022-11-25 17:00:26,585 INFO L134 LiptonReduction]: Checked pairs total: 51171 [2022-11-25 17:00:26,585 INFO L136 LiptonReduction]: Total number of compositions: 216 [2022-11-25 17:00:26,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:00:26,589 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;@76664ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:00:26,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-25 17:00:26,593 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-11-25 17:00:26,593 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 17:00:26,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:00:26,594 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:00:26,594 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-25 17:00:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1586234543, now seen corresponding path program 1 times [2022-11-25 17:00:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550977554] [2022-11-25 17:00:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:26,613 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-25 17:00:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550977554] [2022-11-25 17:00:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550977554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:26,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:26,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:00:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604554584] [2022-11-25 17:00:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:00:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:00:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:00:26,617 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 459 [2022-11-25 17:00:26,618 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-25 17:00:26,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:00:26,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 459 [2022-11-25 17:00:26,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:00:32,163 INFO L130 PetriNetUnfolder]: 26335/34997 cut-off events. [2022-11-25 17:00:32,163 INFO L131 PetriNetUnfolder]: For 1906/1906 co-relation queries the response was YES. [2022-11-25 17:00:32,220 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-25 17:00:32,398 INFO L137 encePairwiseOnDemand]: 452/459 looper letters, 64 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2022-11-25 17:00:32,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 283 flow [2022-11-25 17:00:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:00:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:00:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 499 transitions. [2022-11-25 17:00:32,401 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5435729847494554 [2022-11-25 17:00:32,401 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 499 transitions. [2022-11-25 17:00:32,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 499 transitions. [2022-11-25 17:00:32,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:00:32,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 499 transitions. [2022-11-25 17:00:32,403 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-25 17:00:32,405 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-25 17:00:32,405 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-25 17:00:32,406 INFO L175 Difference]: Start difference. First operand has 60 places, 74 transitions, 169 flow. Second operand 2 states and 499 transitions. [2022-11-25 17:00:32,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 283 flow [2022-11-25 17:00:32,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 277 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 17:00:32,411 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 149 flow [2022-11-25 17:00:32,412 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-25 17:00:32,415 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2022-11-25 17:00:32,416 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 149 flow [2022-11-25 17:00:32,416 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-25 17:00:32,416 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:00:32,416 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:32,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:00:32,417 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-25 17:00:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 346054488, now seen corresponding path program 1 times [2022-11-25 17:00:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:32,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196093187] [2022-11-25 17:00:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:34,506 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-25 17:00:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196093187] [2022-11-25 17:00:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196093187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:34,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:34,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:00:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812388933] [2022-11-25 17:00:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:00:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:00:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:00:38,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 459 [2022-11-25 17:00:38,224 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-25 17:00:38,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:00:38,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 459 [2022-11-25 17:00:38,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:00:53,375 INFO L130 PetriNetUnfolder]: 46302/61766 cut-off events. [2022-11-25 17:00:53,376 INFO L131 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2022-11-25 17:00:53,482 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-25 17:00:53,741 INFO L137 encePairwiseOnDemand]: 440/459 looper letters, 299 selfloop transitions, 46 changer transitions 0/348 dead transitions. [2022-11-25 17:00:53,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 348 transitions, 1451 flow [2022-11-25 17:00:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 17:00:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 17:00:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2621 transitions. [2022-11-25 17:00:53,750 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4758533042846768 [2022-11-25 17:00:53,750 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2621 transitions. [2022-11-25 17:00:53,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2621 transitions. [2022-11-25 17:00:53,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:00:53,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2621 transitions. [2022-11-25 17:00:53,757 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-25 17:00:53,767 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-25 17:00:53,769 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-25 17:00:53,769 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 149 flow. Second operand 12 states and 2621 transitions. [2022-11-25 17:00:53,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 348 transitions, 1451 flow [2022-11-25 17:00:53,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 1451 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:00:53,779 INFO L231 Difference]: Finished difference. Result has 76 places, 118 transitions, 440 flow [2022-11-25 17:00:53,779 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-25 17:00:53,781 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2022-11-25 17:00:53,781 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 118 transitions, 440 flow [2022-11-25 17:00:53,782 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-25 17:00:53,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:00:53,782 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:53,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:00:53,783 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-25 17:00:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash 348023022, now seen corresponding path program 1 times [2022-11-25 17:00:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:53,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051562126] [2022-11-25 17:00:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:55,268 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-25 17:00:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051562126] [2022-11-25 17:00:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051562126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:55,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:55,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:00:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339683825] [2022-11-25 17:00:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:55,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:00:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:00:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:00:58,949 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 459 [2022-11-25 17:00:58,950 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-25 17:00:58,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:00:58,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 459 [2022-11-25 17:00:58,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:01:16,104 INFO L130 PetriNetUnfolder]: 67046/89255 cut-off events. [2022-11-25 17:01:16,104 INFO L131 PetriNetUnfolder]: For 41067/41139 co-relation queries the response was YES. [2022-11-25 17:01:16,321 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-25 17:01:16,739 INFO L137 encePairwiseOnDemand]: 441/459 looper letters, 309 selfloop transitions, 52 changer transitions 0/364 dead transitions. [2022-11-25 17:01:16,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 364 transitions, 1855 flow [2022-11-25 17:01:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:01:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-25 17:01:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2950 transitions. [2022-11-25 17:01:16,750 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4590725178960473 [2022-11-25 17:01:16,750 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2950 transitions. [2022-11-25 17:01:16,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2950 transitions. [2022-11-25 17:01:16,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:01:16,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2950 transitions. [2022-11-25 17:01:16,762 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-25 17:01:16,771 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-25 17:01:16,773 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-25 17:01:16,774 INFO L175 Difference]: Start difference. First operand has 76 places, 118 transitions, 440 flow. Second operand 14 states and 2950 transitions. [2022-11-25 17:01:16,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 364 transitions, 1855 flow [2022-11-25 17:01:17,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 364 transitions, 1855 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:01:17,259 INFO L231 Difference]: Finished difference. Result has 95 places, 168 transitions, 816 flow [2022-11-25 17:01:17,260 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-25 17:01:17,260 INFO L288 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2022-11-25 17:01:17,260 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 168 transitions, 816 flow [2022-11-25 17:01:17,261 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-25 17:01:17,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:01:17,262 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:17,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:01:17,262 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-25 17:01:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -669661749, now seen corresponding path program 1 times [2022-11-25 17:01:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:01:17,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278195956] [2022-11-25 17:01:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:01:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:21,892 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-25 17:01:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278195956] [2022-11-25 17:01:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278195956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:01:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981584057] [2022-11-25 17:01:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:01:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:01:21,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:01:21,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1b8fbc4-ce66-48c9-882a-506c5ba67977/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:01:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:22,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 17:01:22,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:22,475 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 17:01:22,476 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-25 17:01:23,134 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-25 17:01:23,928 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 17:01:23,928 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-25 17:01:25,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:25,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:25,802 INFO L321 Elim1Store]: treesize reduction 124, result has 28.3 percent of original size [2022-11-25 17:01:25,802 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-25 17:01:25,878 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-25 17:01:25,946 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-25 17:01:26,016 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-25 17:01:29,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:29,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:29,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:29,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:29,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:29,465 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-25 17:01:29,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:29,509 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-25 17:01:29,633 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-25 17:01:30,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:30,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:30,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:30,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:30,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:30,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:30,178 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-25 17:01:30,217 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-25 17:01:30,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:01:30,963 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-25 17:01:30,982 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-25 17:01:31,003 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-25 17:01:32,423 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-25 17:01:33,111 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-25 17:01:33,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:38,412 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-25 17:01:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981584057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:38,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:01:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-11-25 17:01:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035149419] [2022-11-25 17:01:38,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 17:01:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 17:01:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=360, Unknown=21, NotChecked=0, Total=462 [2022-11-25 17:01:43,694 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-25 17:01:46,072 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-25 17:01:49,700 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 459 [2022-11-25 17:01:49,702 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-25 17:01:49,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:01:49,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 459 [2022-11-25 17:01:49,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:02:24,260 WARN L233 SmtUtils]: Spent 23.03s 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-25 17:02:26,596 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-25 17:02:41,684 WARN L233 SmtUtils]: Spent 6.96s 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-25 17:02:44,224 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-25 17:02:46,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:48,495 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-25 17:02:51,007 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-25 17:02:53,491 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-25 17:02:54,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:57,572 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-25 17:03:24,059 WARN L233 SmtUtils]: Spent 21.60s 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-25 17:03:26,755 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-25 17:03:28,899 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-25 17:03:30,593 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-25 17:03:33,358 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-25 17:03:35,784 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-25 17:03:47,988 WARN L233 SmtUtils]: Spent 6.85s 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-25 17:03:50,511 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-25 17:05:24,226 WARN L233 SmtUtils]: Spent 1.55m on a formula simplification. DAG size of input: 157 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:05:26,404 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-25 17:05:28,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:05:31,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:05:31,282 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-25 17:05:32,488 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)) (.cse10 (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 .cse10)) (.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|) (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 ((.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| (+ 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 .cse9 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= 0 (mod (select (select .cse9 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (< .cse10 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2022-11-25 17:05:33,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:05:36,005 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-25 17:05:38,071 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-25 17:05:40,711 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-25 17:05:46,554 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-25 17:05:48,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:05:51,232 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-25 17:05:53,459 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-25 17:05:55,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:05:57,728 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-25 17:05:59,826 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-25 17:06:05,844 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-25 17:06:08,819 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-25 17:06:12,597 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-25 17:06:15,120 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-25 17:07:22,653 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-25 17:07:24,669 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-25 17:07:26,918 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-25 17:07:30,069 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-25 17:07:32,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 [0, 1] [2022-11-25 17:07:34,151 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-25 17:07:36,923 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-25 17:07:38,951 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-25 17:07:41,134 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-25 17:07:43,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-25 17:07:45,483 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-25 17:07:52,633 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-25 17:07:56,911 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-25 17:07:58,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:08:01,108 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-25 17:08:03,386 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-25 17:08:05,576 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-25 17:08:08,003 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-25 17:08:12,188 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 [0, 1] [2022-11-25 17:08:15,100 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-25 17:08:17,479 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-25 17:08:19,486 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-25 17:08:21,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:08:28,402 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-25 17:08:30,683 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 [0, 1] [2022-11-25 17:08:32,704 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 [0, 1] [2022-11-25 17:08:34,709 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-25 17:08:36,753 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 [0, 1] [2022-11-25 17:08:37,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:08:39,929 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 [0, 1] [2022-11-25 17:08:41,947 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 [0, 1] [2022-11-25 17:08:43,965 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 [0, 1] [2022-11-25 17:08:45,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-25 17:08:48,168 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-25 17:08:50,174 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-25 17:08:52,180 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-25 17:08:54,817 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-25 17:08:57,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 [0, 1] [2022-11-25 17:08:59,314 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-25 17:09:01,616 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-25 17:09:05,234 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-25 17:09:07,317 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-25 17:09:09,321 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-25 17:09:11,324 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-25 17:09:16,485 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-25 17:09:18,495 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-25 17:09:23,302 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-25 17:09:26,813 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-25 17:09:29,707 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-25 17:09:31,806 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-25 17:09:34,642 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-25 17:09:38,666 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-25 17:09:41,098 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-25 17:09:46,123 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-25 17:09:48,325 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-25 17:09:50,602 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-25 17:09:52,702 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-25 17:09:54,836 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-25 17:09:57,163 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-25 17:09:59,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-25 17:10:01,423 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-25 17:10:04,710 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-25 17:10:06,951 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-25 17:10:08,970 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-25 17:10:11,377 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-25 17:10:13,853 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-25 17:10:15,870 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-25 17:10:18,536 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-25 17:10:24,499 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-25 17:10:28,541 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-25 17:10:30,557 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-25 17:10:33,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 [0, 1] [2022-11-25 17:10:35,556 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-25 17:10:37,659 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-25 17:10:39,716 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-25 17:10:41,777 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-25 17:10:43,835 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-25 17:10:46,012 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-25 17:10:48,371 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-25 17:10:50,534 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-25 17:10:53,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:10:55,272 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-25 17:10:57,496 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-25 17:10:59,510 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-25 17:11:01,587 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-25 17:11:03,704 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-25 17:11:08,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:11:10,820 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-25 17:11:12,926 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-25 17:11:18,458 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-25 17:11:19,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:11:21,696 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-25 17:11:26,046 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-25 17:11:28,473 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-25 17:12:19,130 WARN L233 SmtUtils]: Spent 35.10s on a formula simplification. DAG size of input: 141 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:12:31,471 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 82 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:12:35,089 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-25 17:12:52,391 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-25 17:12:57,163 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-25 17:12:59,960 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-25 17:13:06,221 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-25 17:13:08,536 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-25 17:13:10,613 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-25 17:13:12,636 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-25 17:13:15,116 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]