./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:24:34,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:24:34,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:24:34,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:24:34,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:24:34,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:24:34,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:24:34,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:24:34,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:24:34,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:24:34,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:24:34,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:24:34,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:24:34,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:24:34,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:24:34,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:24:34,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:24:34,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:24:34,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:24:34,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:24:34,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:24:34,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:24:34,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:24:34,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:24:34,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:24:34,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:24:34,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:24:34,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:24:34,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:24:34,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:24:34,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:24:34,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:24:34,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:24:34,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:24:34,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:24:34,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:24:34,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:24:34,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:24:34,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:24:34,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:24:34,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:24:34,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:24:34,720 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:24:34,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:24:34,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:24:34,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:24:34,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:24:34,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:24:34,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:24:34,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:24:34,728 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:24:34,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:24:34,729 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:24:34,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:24:34,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:24:34,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:24:34,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:24:34,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:24:34,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:24:34,730 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:24:34,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:24:34,731 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:24:34,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:24:34,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:24:34,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:24:34,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:24:34,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:24:34,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:24:34,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:24:34,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:24:34,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:24:34,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:24:34,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:24:34,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:24:34,734 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:24:34,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:24:34,734 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:24:34,734 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:24:35,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:24:35,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:24:35,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:24:35,058 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:24:35,059 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:24:35,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-30 16:24:36,114 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:24:36,401 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:24:36,401 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-08-30 16:24:36,410 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac5d7086/71d4d8db3c204641af49ef5dcc27290c/FLAG3cf637f11 [2023-08-30 16:24:36,421 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac5d7086/71d4d8db3c204641af49ef5dcc27290c [2023-08-30 16:24:36,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:24:36,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:24:36,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:24:36,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:24:36,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:24:36,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:36,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d5d909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36, skipping insertion in model container [2023-08-30 16:24:36,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:36,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:24:36,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:24:36,802 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-30 16:24:36,811 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-30 16:24:36,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:24:36,829 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:24:36,868 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-08-30 16:24:36,875 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-08-30 16:24:36,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:24:36,932 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:24:36,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36 WrapperNode [2023-08-30 16:24:36,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:24:36,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:24:36,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:24:36,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:24:36,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:36,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,004 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-08-30 16:24:37,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:24:37,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:24:37,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:24:37,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:24:37,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,049 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:24:37,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:24:37,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:24:37,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:24:37,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (1/1) ... [2023-08-30 16:24:37,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:24:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:24:37,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:24:37,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:24:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 16:24:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 16:24:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 16:24:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:24:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:24:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:24:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:24:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:24:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:24:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:24:37,133 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:24:37,283 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:24:37,297 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:24:37,558 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:24:37,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:24:37,800 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 16:24:37,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:24:37 BoogieIcfgContainer [2023-08-30 16:24:37,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:24:37,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:24:37,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:24:37,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:24:37,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:24:36" (1/3) ... [2023-08-30 16:24:37,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4835251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:24:37, skipping insertion in model container [2023-08-30 16:24:37,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:24:36" (2/3) ... [2023-08-30 16:24:37,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4835251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:24:37, skipping insertion in model container [2023-08-30 16:24:37,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:24:37" (3/3) ... [2023-08-30 16:24:37,818 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-08-30 16:24:37,826 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:24:37,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:24:37,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:24:37,832 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:24:37,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:24:37,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,043 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 16:24:38,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:24:38,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 16:24:38,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,059 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:24:38,069 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,071 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:24:38,089 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 16:24:38,089 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:24:38,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 16:24:38,091 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-30 16:24:40,990 INFO L134 LiptonReduction]: Checked pairs total: 2354 [2023-08-30 16:24:40,990 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-30 16:24:41,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:24:41,018 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;@22906a4c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:24:41,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 16:24:41,027 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2023-08-30 16:24:41,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:24:41,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:24:41,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 16:24:41,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:24:41,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:24:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 147060846, now seen corresponding path program 1 times [2023-08-30 16:24:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:24:41,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733367155] [2023-08-30 16:24:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:24:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:24:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:24:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:24:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:24:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733367155] [2023-08-30 16:24:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733367155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:24:41,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:24:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:24:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482493321] [2023-08-30 16:24:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:24:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:24:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:24:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:24:41,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:24:41,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 182 [2023-08-30 16:24:41,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:41,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:24:41,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 182 [2023-08-30 16:24:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:24:41,360 INFO L130 PetriNetUnfolder]: 43/91 cut-off events. [2023-08-30 16:24:41,361 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:24:41,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 91 events. 43/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 28 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 174. Up to 91 conditions per place. [2023-08-30 16:24:41,364 INFO L137 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 0 changer transitions 7/24 dead transitions. [2023-08-30 16:24:41,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow [2023-08-30 16:24:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:24:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:24:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-30 16:24:41,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-08-30 16:24:41,379 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-30 16:24:41,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-30 16:24:41,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:24:41,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-30 16:24:41,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:41,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:41,393 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:41,394 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 200 transitions. [2023-08-30 16:24:41,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow [2023-08-30 16:24:41,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:24:41,398 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 39 flow [2023-08-30 16:24:41,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=39, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-30 16:24:41,402 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-08-30 16:24:41,403 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 39 flow [2023-08-30 16:24:41,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:41,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:24:41,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:24:41,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:24:41,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:24:41,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:24:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -405140658, now seen corresponding path program 1 times [2023-08-30 16:24:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:24:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460478931] [2023-08-30 16:24:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:24:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:24:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:24:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:24:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:24:42,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460478931] [2023-08-30 16:24:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460478931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:24:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:24:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:24:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041861954] [2023-08-30 16:24:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:24:42,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:24:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:24:42,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:24:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:24:42,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 182 [2023-08-30 16:24:42,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 39 flow. Second operand has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:42,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:24:42,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 182 [2023-08-30 16:24:42,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:24:42,551 INFO L130 PetriNetUnfolder]: 25/71 cut-off events. [2023-08-30 16:24:42,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:24:42,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 71 events. 25/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2023-08-30 16:24:42,552 INFO L137 encePairwiseOnDemand]: 175/182 looper letters, 20 selfloop transitions, 7 changer transitions 1/29 dead transitions. [2023-08-30 16:24:42,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 29 transitions, 119 flow [2023-08-30 16:24:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:24:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:24:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 506 transitions. [2023-08-30 16:24:42,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39717425431711145 [2023-08-30 16:24:42,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 506 transitions. [2023-08-30 16:24:42,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 506 transitions. [2023-08-30 16:24:42,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:24:42,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 506 transitions. [2023-08-30 16:24:42,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:42,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:42,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:42,561 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 39 flow. Second operand 7 states and 506 transitions. [2023-08-30 16:24:42,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 29 transitions, 119 flow [2023-08-30 16:24:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:24:42,563 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 64 flow [2023-08-30 16:24:42,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-08-30 16:24:42,564 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-08-30 16:24:42,564 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 64 flow [2023-08-30 16:24:42,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:24:42,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:24:42,564 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:24:42,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:24:42,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:24:42,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:24:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -42027423, now seen corresponding path program 1 times [2023-08-30 16:24:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:24:42,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880312431] [2023-08-30 16:24:42,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:24:42,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:24:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:24:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:24:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:24:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880312431] [2023-08-30 16:24:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880312431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:24:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110094496] [2023-08-30 16:24:43,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:24:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:24:43,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:24:43,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:24:43,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 16:24:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:24:43,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-30 16:24:43,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:24:43,420 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 16:24:43,421 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 [2023-08-30 16:24:43,502 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 [2023-08-30 16:24:43,603 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 16:24:43,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 16:24:43,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:24:43,818 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-08-30 16:24:43,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2023-08-30 16:24:43,845 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 14 treesize of output 11 [2023-08-30 16:24:43,871 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 8 treesize of output 7 [2023-08-30 16:24:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:24:43,956 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-30 16:24:43,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 33 [2023-08-30 16:24:44,080 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 [2023-08-30 16:24:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:24:44,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:24:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:24:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110094496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:24:48,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:24:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-08-30 16:24:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080890333] [2023-08-30 16:24:48,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:24:48,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 16:24:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:24:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 16:24:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=270, Unknown=10, NotChecked=0, Total=342 [2023-08-30 16:24:50,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] [2023-08-30 16:24:53,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:24:55,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:24:57,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] [2023-08-30 16:25:00,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:02,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:04,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:06,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:08,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:11,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:11,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 182 [2023-08-30 16:25:11,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 64 flow. Second operand has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:11,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:11,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 182 [2023-08-30 16:25:11,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:18,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:20,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:22,632 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] [2023-08-30 16:25:24,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:25:25,773 INFO L130 PetriNetUnfolder]: 31/93 cut-off events. [2023-08-30 16:25:25,773 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 16:25:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 93 events. 31/93 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 258 event pairs, 0 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 244. Up to 31 conditions per place. [2023-08-30 16:25:25,777 INFO L137 encePairwiseOnDemand]: 176/182 looper letters, 21 selfloop transitions, 13 changer transitions 4/39 dead transitions. [2023-08-30 16:25:25,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 204 flow [2023-08-30 16:25:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:25:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:25:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 591 transitions. [2023-08-30 16:25:25,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2952047952047952 [2023-08-30 16:25:25,782 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 591 transitions. [2023-08-30 16:25:25,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 591 transitions. [2023-08-30 16:25:25,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:25,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 591 transitions. [2023-08-30 16:25:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 53.72727272727273) internal successors, (591), 11 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:25,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:25,791 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:25,791 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 64 flow. Second operand 11 states and 591 transitions. [2023-08-30 16:25:25,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 204 flow [2023-08-30 16:25:25,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:25:25,793 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 137 flow [2023-08-30 16:25:25,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-30 16:25:25,794 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2023-08-30 16:25:25,794 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 137 flow [2023-08-30 16:25:25,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:25,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:25,796 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:25:25,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 16:25:26,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:26,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:25:26,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2049480105, now seen corresponding path program 1 times [2023-08-30 16:25:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121335274] [2023-08-30 16:25:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:25:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121335274] [2023-08-30 16:25:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121335274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:25:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291552233] [2023-08-30 16:25:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:25:28,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:25:28,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:25:28,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 16:25:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:25:28,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-30 16:25:28,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:25:28,579 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:25:28,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 16:25:29,565 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-08-30 16:25:29,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2023-08-30 16:25:29,598 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 8 treesize of output 7 [2023-08-30 16:25:29,634 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 8 treesize of output 7 [2023-08-30 16:25:29,664 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 8 treesize of output 7 [2023-08-30 16:25:30,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:25:30,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-08-30 16:25:30,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 5 [2023-08-30 16:25:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:25:31,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:25:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291552233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:25:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:25:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-08-30 16:25:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253578080] [2023-08-30 16:25:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:25:31,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:25:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:25:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:25:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2023-08-30 16:25:31,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 182 [2023-08-30 16:25:31,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:25:31,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 182 [2023-08-30 16:25:31,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:25:31,649 INFO L130 PetriNetUnfolder]: 7/33 cut-off events. [2023-08-30 16:25:31,649 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-30 16:25:31,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 33 events. 7/33 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 114. Up to 10 conditions per place. [2023-08-30 16:25:31,650 INFO L137 encePairwiseOnDemand]: 176/182 looper letters, 0 selfloop transitions, 0 changer transitions 19/19 dead transitions. [2023-08-30 16:25:31,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 19 transitions, 132 flow [2023-08-30 16:25:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:25:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:25:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 479 transitions. [2023-08-30 16:25:31,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43864468864468864 [2023-08-30 16:25:31,653 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 479 transitions. [2023-08-30 16:25:31,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 479 transitions. [2023-08-30 16:25:31,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:25:31,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 479 transitions. [2023-08-30 16:25:31,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,656 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,656 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 137 flow. Second operand 6 states and 479 transitions. [2023-08-30 16:25:31,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 19 transitions, 132 flow [2023-08-30 16:25:31,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 94 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-08-30 16:25:31,657 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2023-08-30 16:25:31,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2023-08-30 16:25:31,658 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2023-08-30 16:25:31,658 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2023-08-30 16:25:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:25:31,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 16:25:31,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-30 16:25:31,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-30 16:25:31,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-30 16:25:31,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 16:25:31,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-30 16:25:31,865 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-30 16:25:31,867 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-30 16:25:31,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,878 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 16:25:31,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:31,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 16:25:31,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,880 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:31,880 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,880 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-08-30 16:25:31,887 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-08-30 16:25:31,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-30 16:25:31,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-08-30 16:25:45,680 INFO L134 LiptonReduction]: Checked pairs total: 2357 [2023-08-30 16:25:45,680 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-30 16:25:45,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:25:45,683 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;@22906a4c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:25:45,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:25:45,685 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-08-30 16:25:45,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:25:45,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:25:45,686 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 16:25:45,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:25:45,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:25:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1668209586, now seen corresponding path program 1 times [2023-08-30 16:25:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:25:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438247546] [2023-08-30 16:25:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:25:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:25:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:45,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:25:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:25:45,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:25:45,728 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:25:45,729 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:25:45,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:25:45,729 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:25:45,730 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:25:45,730 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:25:45,730 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 16:25:45,770 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:25:45,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,788 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-08-30 16:25:45,788 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:45,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-30 16:25:45,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,791 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:25:45,791 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,791 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-08-30 16:25:45,812 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-08-30 16:25:45,812 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:25:45,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-08-30 16:25:45,818 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-08-30 16:26:07,786 INFO L134 LiptonReduction]: Checked pairs total: 17927 [2023-08-30 16:26:07,786 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-30 16:26:07,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:26:07,788 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;@22906a4c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:26:07,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:26:07,790 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-08-30 16:26:07,791 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 16:26:07,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:07,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 16:26:07,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:26:07,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 742142752, now seen corresponding path program 1 times [2023-08-30 16:26:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473264639] [2023-08-30 16:26:07,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:26:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473264639] [2023-08-30 16:26:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473264639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:26:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886558349] [2023-08-30 16:26:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 16:26:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 16:26:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 16:26:07,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-08-30 16:26:07,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:07,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:07,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-08-30 16:26:07,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:08,214 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2023-08-30 16:26:08,215 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-30 16:26:08,216 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 8582 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. [2023-08-30 16:26:08,222 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-30 16:26:08,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-08-30 16:26:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 16:26:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 16:26:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-30 16:26:08,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-08-30 16:26:08,224 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-30 16:26:08,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-30 16:26:08,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:08,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-30 16:26:08,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:08,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:08,226 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:08,227 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-08-30 16:26:08,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-08-30 16:26:08,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 16:26:08,229 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-08-30 16:26:08,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, 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} [2023-08-30 16:26:08,231 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-30 16:26:08,231 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-08-30 16:26:08,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:08,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:08,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:08,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:26:08,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:26:08,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash 240118255, now seen corresponding path program 1 times [2023-08-30 16:26:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533936191] [2023-08-30 16:26:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:26:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533936191] [2023-08-30 16:26:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533936191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:26:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:26:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:26:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478706013] [2023-08-30 16:26:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:26:09,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:26:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:26:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:26:11,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 306 [2023-08-30 16:26:11,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:11,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:11,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 306 [2023-08-30 16:26:11,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:13,508 INFO L130 PetriNetUnfolder]: 1507/2362 cut-off events. [2023-08-30 16:26:13,508 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-30 16:26:13,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 2362 events. 1507/2362 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 13319 event pairs, 223 based on Foata normal form. 0/1734 useless extension candidates. Maximal degree in co-relation 4777. Up to 1356 conditions per place. [2023-08-30 16:26:13,521 INFO L137 encePairwiseOnDemand]: 288/306 looper letters, 125 selfloop transitions, 35 changer transitions 8/171 dead transitions. [2023-08-30 16:26:13,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 171 transitions, 718 flow [2023-08-30 16:26:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 16:26:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 16:26:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1635 transitions. [2023-08-30 16:26:13,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452614379084967 [2023-08-30 16:26:13,526 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1635 transitions. [2023-08-30 16:26:13,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1635 transitions. [2023-08-30 16:26:13,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:26:13,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1635 transitions. [2023-08-30 16:26:13,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.25) internal successors, (1635), 12 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:13,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:13,536 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:13,536 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 12 states and 1635 transitions. [2023-08-30 16:26:13,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 171 transitions, 718 flow [2023-08-30 16:26:13,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 171 transitions, 718 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:26:13,539 INFO L231 Difference]: Finished difference. Result has 61 places, 86 transitions, 351 flow [2023-08-30 16:26:13,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=86} [2023-08-30 16:26:13,540 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-30 16:26:13,540 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 86 transitions, 351 flow [2023-08-30 16:26:13,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:13,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:26:13,541 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:26:13,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:26:13,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:26:13,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:26:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2055155924, now seen corresponding path program 1 times [2023-08-30 16:26:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:26:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800850548] [2023-08-30 16:26:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:26:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:26:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:26:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800850548] [2023-08-30 16:26:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800850548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:26:14,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937529731] [2023-08-30 16:26:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:26:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:26:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:26:14,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:26:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 16:26:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:26:14,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-30 16:26:14,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:26:14,859 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 16:26:14,860 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 [2023-08-30 16:26:15,157 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 [2023-08-30 16:26:15,375 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 16:26:15,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 16:26:15,844 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:26:15,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2023-08-30 16:26:15,864 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 14 treesize of output 11 [2023-08-30 16:26:16,191 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 [2023-08-30 16:26:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:26:16,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:26:16,941 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse2 (= .cse1 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_270) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_265) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_271))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse2)) (or (forall ((v_ArrVal_271 (Array Int Int)) (v_ArrVal_267 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_271))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse2)))) is different from false [2023-08-30 16:26:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:26:19,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937529731] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:26:19,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:26:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-08-30 16:26:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909703283] [2023-08-30 16:26:19,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:26:19,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 16:26:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:26:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 16:26:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=242, Unknown=7, NotChecked=32, Total=342 [2023-08-30 16:26:20,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 306 [2023-08-30 16:26:20,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 86 transitions, 351 flow. Second operand has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:26:20,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:26:20,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 306 [2023-08-30 16:26:20,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:26:41,463 WARN L222 SmtUtils]: Spent 14.20s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:26:43,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:26:44,007 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296)) (.cse2 (+ 1 .cse4))) (and (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_270) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_265) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_271))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| Int)) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_270) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_265) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| v_ArrVal_269) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_271))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse0 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65|) 0))))))) is different from false [2023-08-30 16:26:46,097 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] [2023-08-30 16:26:48,114 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] [2023-08-30 16:26:52,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:04,323 WARN L222 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:27:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:16,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:18,324 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] [2023-08-30 16:27:20,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:22,436 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] [2023-08-30 16:27:32,152 WARN L222 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 74 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:27:33,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:36,429 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] [2023-08-30 16:27:38,443 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] [2023-08-30 16:27:42,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:43,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:45,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:46,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:49,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:27:51,288 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] [2023-08-30 16:27:53,297 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] [2023-08-30 16:27:57,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:07,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:09,558 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] [2023-08-30 16:28:11,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:17,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:19,065 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] [2023-08-30 16:28:21,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:24,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:29,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 [1] [2023-08-30 16:28:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:34,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:36,080 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] [2023-08-30 16:28:38,099 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] [2023-08-30 16:28:40,112 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] [2023-08-30 16:28:42,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:44,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:46,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:51,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:53,375 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] [2023-08-30 16:28:55,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:28:58,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:00,144 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] [2023-08-30 16:29:12,076 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] [2023-08-30 16:29:14,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:17,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:19,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:21,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:24,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:27,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:29,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:31,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:33,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:36,285 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] [2023-08-30 16:29:52,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:29:54,720 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] [2023-08-30 16:29:55,301 INFO L130 PetriNetUnfolder]: 2735/4499 cut-off events. [2023-08-30 16:29:55,301 INFO L131 PetriNetUnfolder]: For 4098/4111 co-relation queries the response was YES. [2023-08-30 16:29:55,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13027 conditions, 4499 events. 2735/4499 cut-off events. For 4098/4111 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 29609 event pairs, 206 based on Foata normal form. 168/4112 useless extension candidates. Maximal degree in co-relation 13014. Up to 1638 conditions per place. [2023-08-30 16:29:55,325 INFO L137 encePairwiseOnDemand]: 275/306 looper letters, 233 selfloop transitions, 230 changer transitions 35/501 dead transitions. [2023-08-30 16:29:55,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 501 transitions, 3014 flow [2023-08-30 16:29:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-30 16:29:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-30 16:29:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4382 transitions. [2023-08-30 16:29:55,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580065359477124 [2023-08-30 16:29:55,337 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 4382 transitions. [2023-08-30 16:29:55,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 4382 transitions. [2023-08-30 16:29:55,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:29:55,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4382 transitions. [2023-08-30 16:29:55,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 109.55) internal successors, (4382), 40 states have internal predecessors, (4382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:29:55,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 306.0) internal successors, (12546), 41 states have internal predecessors, (12546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:29:55,362 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 306.0) internal successors, (12546), 41 states have internal predecessors, (12546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:29:55,362 INFO L175 Difference]: Start difference. First operand has 61 places, 86 transitions, 351 flow. Second operand 40 states and 4382 transitions. [2023-08-30 16:29:55,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 501 transitions, 3014 flow [2023-08-30 16:29:55,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 501 transitions, 3014 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:29:55,383 INFO L231 Difference]: Finished difference. Result has 128 places, 299 transitions, 2472 flow [2023-08-30 16:29:55,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2472, PETRI_PLACES=128, PETRI_TRANSITIONS=299} [2023-08-30 16:29:55,383 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2023-08-30 16:29:55,384 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 299 transitions, 2472 flow [2023-08-30 16:29:55,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:29:55,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:29:55,385 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:29:55,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 16:29:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:29:55,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:29:55,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:29:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash 272482645, now seen corresponding path program 1 times [2023-08-30 16:29:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:29:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742263453] [2023-08-30 16:29:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:29:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:29:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:29:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:29:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:29:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742263453] [2023-08-30 16:29:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742263453] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:29:56,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559153239] [2023-08-30 16:29:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:29:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:29:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:29:56,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:29:56,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 16:29:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:29:56,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-30 16:29:56,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:29:56,969 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 16:29:56,970 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 [2023-08-30 16:29:57,181 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 [2023-08-30 16:29:57,540 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 [2023-08-30 16:29:57,843 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 16:29:57,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 16:29:58,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:29:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:29:58,681 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-30 16:29:58,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-30 16:29:58,723 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 22 treesize of output 18 [2023-08-30 16:29:58,755 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 [2023-08-30 16:29:58,795 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 25 treesize of output 19 [2023-08-30 16:29:58,824 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 [2023-08-30 16:30:00,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:30:00,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:30:00,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:30:00,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 132 [2023-08-30 16:30:00,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:30:00,437 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 101 treesize of output 75 [2023-08-30 16:30:00,466 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 9 treesize of output 7 [2023-08-30 16:30:00,495 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-30 16:30:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:30:01,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:30:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:30:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559153239] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:30:03,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:30:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 16:30:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207066856] [2023-08-30 16:30:03,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:30:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 16:30:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:30:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 16:30:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=304, Unknown=2, NotChecked=0, Total=380 [2023-08-30 16:30:08,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:08,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-08-30 16:30:08,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 299 transitions, 2472 flow. Second operand has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:30:08,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:30:08,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-08-30 16:30:08,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:30:22,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] [2023-08-30 16:30:26,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:30,160 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] [2023-08-30 16:30:36,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:37,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:40,786 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] [2023-08-30 16:30:47,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:50,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:30:53,329 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] [2023-08-30 16:31:04,637 INFO L130 PetriNetUnfolder]: 5269/8732 cut-off events. [2023-08-30 16:31:04,637 INFO L131 PetriNetUnfolder]: For 54516/54559 co-relation queries the response was YES. [2023-08-30 16:31:04,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42452 conditions, 8732 events. 5269/8732 cut-off events. For 54516/54559 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 63255 event pairs, 366 based on Foata normal form. 203/8236 useless extension candidates. Maximal degree in co-relation 42411. Up to 4456 conditions per place. [2023-08-30 16:31:04,725 INFO L137 encePairwiseOnDemand]: 280/306 looper letters, 603 selfloop transitions, 455 changer transitions 65/1126 dead transitions. [2023-08-30 16:31:04,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 1126 transitions, 10992 flow [2023-08-30 16:31:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 16:31:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 16:31:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3748 transitions. [2023-08-30 16:31:04,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602460592079969 [2023-08-30 16:31:04,734 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3748 transitions. [2023-08-30 16:31:04,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3748 transitions. [2023-08-30 16:31:04,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:31:04,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3748 transitions. [2023-08-30 16:31:04,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 110.23529411764706) internal successors, (3748), 34 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:04,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 306.0) internal successors, (10710), 35 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:04,755 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 306.0) internal successors, (10710), 35 states have internal predecessors, (10710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:04,755 INFO L175 Difference]: Start difference. First operand has 128 places, 299 transitions, 2472 flow. Second operand 34 states and 3748 transitions. [2023-08-30 16:31:04,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 1126 transitions, 10992 flow [2023-08-30 16:31:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1126 transitions, 10150 flow, removed 393 selfloop flow, removed 4 redundant places. [2023-08-30 16:31:05,158 INFO L231 Difference]: Finished difference. Result has 185 places, 735 transitions, 7248 flow [2023-08-30 16:31:05,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7248, PETRI_PLACES=185, PETRI_TRANSITIONS=735} [2023-08-30 16:31:05,161 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places. [2023-08-30 16:31:05,161 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 735 transitions, 7248 flow [2023-08-30 16:31:05,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:05,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:31:05,162 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:31:05,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 16:31:05,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:31:05,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:31:05,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:31:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1135812296, now seen corresponding path program 1 times [2023-08-30 16:31:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:31:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817587744] [2023-08-30 16:31:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:31:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:31:06,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:31:06,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817587744] [2023-08-30 16:31:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817587744] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:31:06,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40077610] [2023-08-30 16:31:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:31:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:31:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:31:06,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:31:06,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 16:31:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:31:06,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 89 conjunts are in the unsatisfiable core [2023-08-30 16:31:06,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:31:06,934 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 16:31:06,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 16:31:07,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 16:31:07,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 16:31:07,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 16:31:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:07,543 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-08-30 16:31:07,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 171 [2023-08-30 16:31:07,569 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 8 treesize of output 7 [2023-08-30 16:31:07,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-08-30 16:31:08,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:08,532 INFO L321 Elim1Store]: treesize reduction 134, result has 24.3 percent of original size [2023-08-30 16:31:08,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 132 treesize of output 395 [2023-08-30 16:31:08,836 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 14 treesize of output 11 [2023-08-30 16:31:09,031 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 14 treesize of output 11 [2023-08-30 16:31:09,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:09,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:09,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:09,469 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-30 16:31:09,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 104 [2023-08-30 16:31:09,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:09,570 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:09,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2023-08-30 16:31:10,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 33 [2023-08-30 16:31:10,082 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-08-30 16:31:10,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 5 [2023-08-30 16:31:10,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:10,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:10,295 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-08-30 16:31:10,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 66 [2023-08-30 16:31:11,185 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 16:31:11,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-08-30 16:31:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:11,635 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-30 16:31:11,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 358 [2023-08-30 16:31:11,658 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 22 treesize of output 18 [2023-08-30 16:31:11,685 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 [2023-08-30 16:31:11,718 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 [2023-08-30 16:31:11,751 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 [2023-08-30 16:31:13,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:31:13,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 50 [2023-08-30 16:31:13,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 16:31:13,142 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-30 16:31:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:31:13,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:31:14,195 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (= .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_ArrVal_431 (Array Int Int))) (or (< .cse0 (mod (select (select (store .cse1 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (not (= .cse0 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse0 (mod (select (select (store (store (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse2 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-08-30 16:31:14,414 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse2 4294967296))) (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (not (= .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse0 (mod (select (select (store (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse2))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (= .cse0 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_ArrVal_431 (Array Int Int))) (or (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store .cse3 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-08-30 16:31:14,829 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 0)))) (let ((.cse2 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse2 4294967296))) (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse0 (mod (select (select (store (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse2))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (forall ((v_ArrVal_431 (Array Int Int))) (or (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store .cse4 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse0 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-08-30 16:31:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 16:31:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40077610] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:31:16,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:31:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-08-30 16:31:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127530313] [2023-08-30 16:31:16,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:31:16,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-30 16:31:16,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:31:16,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-30 16:31:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=442, Unknown=7, NotChecked=138, Total=702 [2023-08-30 16:31:17,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 306 [2023-08-30 16:31:17,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 735 transitions, 7248 flow. Second operand has 27 states, 27 states have (on average 99.33333333333333) internal successors, (2682), 27 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:31:17,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:31:17,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 306 [2023-08-30 16:31:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:31:31,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:31:37,784 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] [2023-08-30 16:31:39,804 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] [2023-08-30 16:31:41,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:31:43,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:31:43,557 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store .cse16 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 0)))) (let ((.cse14 (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse12 (mod .cse14 4294967296))) (and (forall ((v_ArrVal_413 (Array Int Int)) (|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413))) (store .cse4 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select .cse4 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0))))) (let ((.cse2 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (mod .cse2 4294967296)) (.cse1 (store .cse3 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse0 (mod (select (select (store (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse2 1))) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select (store (store .cse1 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)))) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0)))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422)) (.cse5 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_ArrVal_431 (Array Int Int))) (or (= 0 (mod (select v_ArrVal_431 0) 4294967296)) (< .cse5 (mod (select (select (store .cse6 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5))))))) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0)))) (let ((.cse10 (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse9 (mod .cse10 4294967296)) (.cse8 (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (not (= (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse9)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse9 (mod (select (select (store (store (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse10 1))) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select (store (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse12 (mod (select (select (store (store (store .cse13 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse13 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse14))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse13 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= .cse12 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (< 0 (mod (select .cse16 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (let ((.cse19 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse17 (mod .cse19 4294967296))) (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (not (= .cse17 (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse17 (mod (select (select (store (store (store .cse18 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse18 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse19))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse18 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (= .cse17 (mod (select (select .cse20 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_ArrVal_431 (Array Int Int))) (or (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse17 (mod (select (select (store .cse20 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (forall ((v_ArrVal_413 (Array Int Int)) (|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413))) (store .cse24 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select .cse24 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0))))) (let ((.cse21 (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (.cse22 (store .cse23 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (= .cse21 (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_ArrVal_431 (Array Int Int))) (or (< .cse21 (mod (select (select (store .cse22 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 0 (mod (select v_ArrVal_431 0) 4294967296)))))))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse25 (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (forall ((v_ArrVal_431 (Array Int Int))) (or (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse12 (mod (select (select (store .cse25 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= .cse12 (mod (select (select .cse25 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-08-30 16:32:07,481 WARN L222 SmtUtils]: Spent 19.82s on a formula simplification. DAG size of input: 204 DAG size of output: 167 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:32:08,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:14,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:17,000 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] [2023-08-30 16:32:19,010 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] [2023-08-30 16:32:21,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:33,547 WARN L222 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:32:41,678 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] [2023-08-30 16:32:42,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:45,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:47,126 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] [2023-08-30 16:32:50,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:32:52,331 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] [2023-08-30 16:32:52,592 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse8 (= .cse7 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0)))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422)) (.cse0 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (forall ((v_ArrVal_431 (Array Int Int))) (or (= 0 (mod (select v_ArrVal_431 0) 4294967296)) (< .cse0 (mod (select (select (store .cse1 |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0))))))) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select |c_#memory_int| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 0)))) (let ((.cse5 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (mod .cse5 4294967296)) (.cse3 (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (or (not (= (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse4)) (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse4 (mod (select (select (store (store (store .cse3 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store .cse3 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse5 1))) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68| (store (select (store (store .cse3 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_68|) 0)))) (or (forall ((v_ArrVal_431 (Array Int Int))) (or (< .cse7 (mod (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_431) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_431 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))) .cse8) (or (forall ((v_ArrVal_425 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| Int) (v_ArrVal_423 (Array Int Int))) (< .cse7 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_428) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_429) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_14| v_ArrVal_423) |c_~#value~0.base| v_ArrVal_425) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse8))))) is different from false [2023-08-30 16:32:54,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:02,353 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] [2023-08-30 16:33:03,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:05,447 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] [2023-08-30 16:33:07,634 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] [2023-08-30 16:33:09,640 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] [2023-08-30 16:33:11,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:15,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:17,088 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] [2023-08-30 16:33:19,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 16:33:33,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:51,981 WARN L222 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 188 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:33:54,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:57,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:33:59,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:01,751 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] [2023-08-30 16:34:04,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:32,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:34,886 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] [2023-08-30 16:34:36,898 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] [2023-08-30 16:34:38,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:41,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:43,299 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] [2023-08-30 16:34:45,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:47,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:52,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:54,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:34:56,983 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] [2023-08-30 16:35:00,877 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] [2023-08-30 16:35:02,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:35:10,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:35:31,422 WARN L222 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 16:35:44,017 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] [2023-08-30 16:35:56,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:00,749 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] [2023-08-30 16:36:05,857 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] [2023-08-30 16:36:07,868 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] [2023-08-30 16:36:09,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 16:36:18,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:20,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:22,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:24,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:27,771 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] [2023-08-30 16:36:30,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:34,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:36,834 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] [2023-08-30 16:36:38,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:40,893 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] [2023-08-30 16:36:42,913 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] [2023-08-30 16:36:44,938 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] [2023-08-30 16:36:46,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:50,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 16:36:51,259 INFO L130 PetriNetUnfolder]: 8198/13693 cut-off events. [2023-08-30 16:36:51,259 INFO L131 PetriNetUnfolder]: For 165212/165305 co-relation queries the response was YES. [2023-08-30 16:36:51,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84092 conditions, 13693 events. 8198/13693 cut-off events. For 165212/165305 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 107052 event pairs, 576 based on Foata normal form. 237/13548 useless extension candidates. Maximal degree in co-relation 84023. Up to 5782 conditions per place. [2023-08-30 16:36:51,443 INFO L137 encePairwiseOnDemand]: 272/306 looper letters, 981 selfloop transitions, 1003 changer transitions 134/2121 dead transitions. [2023-08-30 16:36:51,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2121 transitions, 26419 flow [2023-08-30 16:36:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-30 16:36:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-30 16:36:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 6558 transitions. [2023-08-30 16:36:51,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36324360252575605 [2023-08-30 16:36:51,455 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 6558 transitions. [2023-08-30 16:36:51,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 6558 transitions. [2023-08-30 16:36:51,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:36:51,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 6558 transitions. [2023-08-30 16:36:51,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 111.15254237288136) internal successors, (6558), 59 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:51,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 306.0) internal successors, (18360), 60 states have internal predecessors, (18360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 306.0) internal successors, (18360), 60 states have internal predecessors, (18360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:51,513 INFO L175 Difference]: Start difference. First operand has 185 places, 735 transitions, 7248 flow. Second operand 59 states and 6558 transitions. [2023-08-30 16:36:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 2121 transitions, 26419 flow [2023-08-30 16:36:52,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 2121 transitions, 25112 flow, removed 629 selfloop flow, removed 2 redundant places. [2023-08-30 16:36:52,757 INFO L231 Difference]: Finished difference. Result has 278 places, 1405 transitions, 17144 flow [2023-08-30 16:36:52,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=6429, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=17144, PETRI_PLACES=278, PETRI_TRANSITIONS=1405} [2023-08-30 16:36:52,758 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 235 predicate places. [2023-08-30 16:36:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1405 transitions, 17144 flow [2023-08-30 16:36:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 99.33333333333333) internal successors, (2682), 27 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:36:52,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:36:52,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:36:52,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 16:36:52,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-30 16:36:52,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 16:36:52,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:36:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 827144045, now seen corresponding path program 1 times [2023-08-30 16:36:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:36:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541235750] [2023-08-30 16:36:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:36:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:36:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:36:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:36:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:36:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541235750] [2023-08-30 16:36:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541235750] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:36:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9444967] [2023-08-30 16:36:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:36:54,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:36:54,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:36:54,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:36:54,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 16:36:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:36:54,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 127 conjunts are in the unsatisfiable core [2023-08-30 16:36:54,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:36:54,790 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 16:36:54,790 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 [2023-08-30 16:36:55,010 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 [2023-08-30 16:36:55,361 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-08-30 16:36:55,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-08-30 16:36:56,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-08-30 16:36:56,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:36:56,095 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-30 16:36:56,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 49 [2023-08-30 16:36:56,218 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-08-30 16:36:56,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2023-08-30 16:36:56,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-08-30 16:36:56,255 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 8 treesize of output 7 [2023-08-30 16:36:56,348 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 16:36:56,348 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 1 case distinctions, treesize of input 14 treesize of output 18 [2023-08-30 16:36:56,394 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 14 treesize of output 11 [2023-08-30 16:36:57,584 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 16:36:57,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 50 [2023-08-30 16:36:59,166 INFO L321 Elim1Store]: treesize reduction 8, result has 94.5 percent of original size [2023-08-30 16:36:59,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 92 treesize of output 214 [2023-08-30 16:37:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:35,153 INFO L321 Elim1Store]: treesize reduction 330, result has 21.8 percent of original size [2023-08-30 16:37:35,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 143 treesize of output 311 [2023-08-30 16:37:35,184 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 8 treesize of output 7 [2023-08-30 16:37:36,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:36,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:36,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:36,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:36,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:36,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2023-08-30 16:37:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 16:37:37,320 INFO L321 Elim1Store]: treesize reduction 65, result has 42.5 percent of original size [2023-08-30 16:37:37,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 114 [2023-08-30 16:37:37,335 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 21 treesize of output 19 [2023-08-30 16:37:38,340 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 8 treesize of output 7 [2023-08-30 16:37:38,503 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 8 treesize of output 7 [2023-08-30 16:37:38,961 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 8 treesize of output 7 [2023-08-30 16:37:39,096 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 8 treesize of output 7 [2023-08-30 16:37:46,256 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 8 treesize of output 7 [2023-08-30 16:37:54,850 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 20 treesize of output 16 Killed by 15