./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --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-29 19:29:47,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:29:47,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:29:47,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:29:47,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:29:47,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:29:47,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:29:47,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:29:47,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:29:47,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:29:47,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:29:47,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:29:47,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:29:47,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:29:47,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:29:47,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:29:47,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:29:47,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:29:47,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:29:47,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:29:47,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:29:47,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:29:47,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:29:47,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:29:47,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:29:47,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:29:47,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:29:47,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:29:47,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:29:47,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:29:47,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:29:47,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:29:47,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:29:47,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:29:47,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:29:47,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:29:47,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:29:47,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:29:47,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:29:47,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:29:47,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:29:47,138 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:29:47,170 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:29:47,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:29:47,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:29:47,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:29:47,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:29:47,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:29:47,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:29:47,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:29:47,174 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:29:47,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:29:47,175 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:29:47,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:29:47,176 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:29:47,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:29:47,177 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:29:47,177 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:29:47,177 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:29:47,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:29:47,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:29:47,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:29:47,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:47,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:29:47,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:29:47,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:29:47,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:29:47,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:29:47,179 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:29:47,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:29:47,180 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:29:47,180 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a 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-29 19:29:47,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:29:47,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:29:47,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:29:47,497 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:29:47,498 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:29:47,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-29 19:29:48,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:29:49,021 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:29:49,024 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2023-08-29 19:29:49,039 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c5aa3b5/0a79bd8aa0214f1ebf9334580504aea7/FLAG13d1574b8 [2023-08-29 19:29:49,054 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c5aa3b5/0a79bd8aa0214f1ebf9334580504aea7 [2023-08-29 19:29:49,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:29:49,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:29:49,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:49,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:29:49,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:29:49,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69862e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49, skipping insertion in model container [2023-08-29 19:29:49,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:29:49,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:29:49,559 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/queue_ok_longer.i[43272,43285] [2023-08-29 19:29:49,566 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/queue_ok_longer.i[43545,43558] [2023-08-29 19:29:49,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:49,583 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:29:49,643 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/queue_ok_longer.i[43272,43285] [2023-08-29 19:29:49,649 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/queue_ok_longer.i[43545,43558] [2023-08-29 19:29:49,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:49,793 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:29:49,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49 WrapperNode [2023-08-29 19:29:49,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:49,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:49,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:29:49,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:29:49,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,855 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-29 19:29:49,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:49,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:29:49,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:29:49,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:29:49,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,914 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:29:49,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:29:49,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:29:49,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:29:49,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (1/1) ... [2023-08-29 19:29:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:49,959 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-29 19:29:49,990 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-29 19:29:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-29 19:29:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-29 19:29:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-29 19:29:50,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-29 19:29:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:29:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:29:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:29:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:29:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 19:29:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:29:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:29:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:29:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:29:50,008 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:29:50,182 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:29:50,184 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:29:50,581 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:29:50,589 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:29:50,589 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 19:29:50,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:50 BoogieIcfgContainer [2023-08-29 19:29:50,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:29:50,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:29:50,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:29:50,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:29:50,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:29:49" (1/3) ... [2023-08-29 19:29:50,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b910c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:50, skipping insertion in model container [2023-08-29 19:29:50,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:49" (2/3) ... [2023-08-29 19:29:50,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b910c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:50, skipping insertion in model container [2023-08-29 19:29:50,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:50" (3/3) ... [2023-08-29 19:29:50,596 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-08-29 19:29:50,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:29:50,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-29 19:29:50,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:29:50,828 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 19:29:50,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:29:51,031 INFO L130 PetriNetUnfolder]: 13/276 cut-off events. [2023-08-29 19:29:51,032 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:51,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 276 events. 13/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-29 19:29:51,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 278 transitions, 572 flow [2023-08-29 19:29:51,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:51,051 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:29:51,060 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:51,063 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:51,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 272 transitions, 556 flow [2023-08-29 19:29:51,120 INFO L130 PetriNetUnfolder]: 13/272 cut-off events. [2023-08-29 19:29:51,120 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:51,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 13/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 660 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 185. Up to 3 conditions per place. [2023-08-29 19:29:51,133 INFO L119 LiptonReduction]: Number of co-enabled transitions 17820 [2023-08-29 19:30:03,953 INFO L134 LiptonReduction]: Checked pairs total: 64286 [2023-08-29 19:30:03,953 INFO L136 LiptonReduction]: Total number of compositions: 358 [2023-08-29 19:30:03,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:30:03,971 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7f1f3584, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:30:03,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-29 19:30:03,973 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:30:03,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:30:03,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:03,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:30:03,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:03,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1161, now seen corresponding path program 1 times [2023-08-29 19:30:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711398878] [2023-08-29 19:30:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:04,104 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-29 19:30:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711398878] [2023-08-29 19:30:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711398878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:04,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:04,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:30:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072836775] [2023-08-29 19:30:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:04,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:30:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:30:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:30:04,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 636 [2023-08-29 19:30:04,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:30:04,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:04,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 636 [2023-08-29 19:30:04,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:04,800 INFO L130 PetriNetUnfolder]: 3797/6059 cut-off events. [2023-08-29 19:30:04,801 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-08-29 19:30:04,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11913 conditions, 6059 events. 3797/6059 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34868 event pairs, 3185 based on Foata normal form. 0/3159 useless extension candidates. Maximal degree in co-relation 11458. Up to 5786 conditions per place. [2023-08-29 19:30:04,838 INFO L137 encePairwiseOnDemand]: 600/636 looper letters, 61 selfloop transitions, 0 changer transitions 0/70 dead transitions. [2023-08-29 19:30:04,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 274 flow [2023-08-29 19:30:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:30:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:30:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 631 transitions. [2023-08-29 19:30:04,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960691823899371 [2023-08-29 19:30:04,860 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 631 transitions. [2023-08-29 19:30:04,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 631 transitions. [2023-08-29 19:30:04,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:04,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 631 transitions. [2023-08-29 19:30:04,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 315.5) internal successors, (631), 2 states have internal predecessors, (631), 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-29 19:30:04,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 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-29 19:30:04,879 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 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-29 19:30:04,880 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 224 flow. Second operand 2 states and 631 transitions. [2023-08-29 19:30:04,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 274 flow [2023-08-29 19:30:04,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:30:04,898 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 144 flow [2023-08-29 19:30:04,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-29 19:30:04,904 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:30:04,905 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 144 flow [2023-08-29 19:30:04,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 267.5) internal successors, (535), 2 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:30:04,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:04,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:30:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:30:04,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:04,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1154497, now seen corresponding path program 1 times [2023-08-29 19:30:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587710760] [2023-08-29 19:30:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:05,187 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-29 19:30:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:05,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587710760] [2023-08-29 19:30:05,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587710760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:05,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629347645] [2023-08-29 19:30:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:05,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:05,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:05,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 636 [2023-08-29 19:30:05,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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-29 19:30:05,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:05,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 636 [2023-08-29 19:30:05,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:05,883 INFO L130 PetriNetUnfolder]: 3749/5963 cut-off events. [2023-08-29 19:30:05,883 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:30:05,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11680 conditions, 5963 events. 3749/5963 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 34055 event pairs, 3144 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 11677. Up to 5693 conditions per place. [2023-08-29 19:30:05,921 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 57 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-29 19:30:05,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 258 flow [2023-08-29 19:30:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-08-29 19:30:05,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43763102725366876 [2023-08-29 19:30:05,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-08-29 19:30:05,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-08-29 19:30:05,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:05,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-08-29 19:30:05,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-29 19:30:05,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:05,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:05,934 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 144 flow. Second operand 3 states and 835 transitions. [2023-08-29 19:30:05,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 258 flow [2023-08-29 19:30:05,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:30:05,937 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 144 flow [2023-08-29 19:30:05,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-29 19:30:05,939 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -39 predicate places. [2023-08-29 19:30:05,939 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 144 flow [2023-08-29 19:30:05,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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-29 19:30:05,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:05,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:30:05,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:30:05,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:05,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1154498, now seen corresponding path program 1 times [2023-08-29 19:30:05,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:05,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364562012] [2023-08-29 19:30:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:06,075 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-29 19:30:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364562012] [2023-08-29 19:30:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364562012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823468427] [2023-08-29 19:30:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:06,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:06,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:30:06,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-29 19:30:06,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:06,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:30:06,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:06,701 INFO L130 PetriNetUnfolder]: 3701/5867 cut-off events. [2023-08-29 19:30:06,702 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:30:06,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 5867 events. 3701/5867 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33381 event pairs, 3103 based on Foata normal form. 0/3097 useless extension candidates. Maximal degree in co-relation 11492. Up to 5602 conditions per place. [2023-08-29 19:30:06,731 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 55 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:30:06,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 254 flow [2023-08-29 19:30:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2023-08-29 19:30:06,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44287211740041926 [2023-08-29 19:30:06,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 845 transitions. [2023-08-29 19:30:06,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 845 transitions. [2023-08-29 19:30:06,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:06,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 845 transitions. [2023-08-29 19:30:06,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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-29 19:30:06,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:06,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:06,742 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 144 flow. Second operand 3 states and 845 transitions. [2023-08-29 19:30:06,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 254 flow [2023-08-29 19:30:06,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:06,744 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 140 flow [2023-08-29 19:30:06,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-29 19:30:06,745 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -41 predicate places. [2023-08-29 19:30:06,745 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 140 flow [2023-08-29 19:30:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-29 19:30:06,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:06,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:30:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:30:06,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:06,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496233, now seen corresponding path program 1 times [2023-08-29 19:30:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776803708] [2023-08-29 19:30:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:07,160 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-29 19:30:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776803708] [2023-08-29 19:30:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776803708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722734566] [2023-08-29 19:30:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:07,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:07,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:30:07,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-29 19:30:07,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:07,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:30:07,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:07,880 INFO L130 PetriNetUnfolder]: 3800/6080 cut-off events. [2023-08-29 19:30:07,880 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-29 19:30:07,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11915 conditions, 6080 events. 3800/6080 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 35011 event pairs, 2674 based on Foata normal form. 0/3121 useless extension candidates. Maximal degree in co-relation 11911. Up to 5801 conditions per place. [2023-08-29 19:30:07,903 INFO L137 encePairwiseOnDemand]: 630/636 looper letters, 63 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-29 19:30:07,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 292 flow [2023-08-29 19:30:07,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-29 19:30:07,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:30:07,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-29 19:30:07,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-29 19:30:07,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:07,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-29 19:30:07,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-29 19:30:07,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:07,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:07,914 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 140 flow. Second operand 3 states and 831 transitions. [2023-08-29 19:30:07,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 292 flow [2023-08-29 19:30:07,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:07,916 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2023-08-29 19:30:07,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2023-08-29 19:30:07,917 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -40 predicate places. [2023-08-29 19:30:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2023-08-29 19:30:07,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-29 19:30:07,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:07,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:30:07,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:30:07,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:07,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1109496236, now seen corresponding path program 1 times [2023-08-29 19:30:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318998285] [2023-08-29 19:30:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:07,964 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-29 19:30:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318998285] [2023-08-29 19:30:07,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318998285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:07,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767919713] [2023-08-29 19:30:07,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:07,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:08,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 636 [2023-08-29 19:30:08,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 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-29 19:30:08,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:08,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 636 [2023-08-29 19:30:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:08,488 INFO L130 PetriNetUnfolder]: 3253/5163 cut-off events. [2023-08-29 19:30:08,489 INFO L131 PetriNetUnfolder]: For 213/296 co-relation queries the response was YES. [2023-08-29 19:30:08,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10409 conditions, 5163 events. 3253/5163 cut-off events. For 213/296 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28741 event pairs, 2677 based on Foata normal form. 0/2957 useless extension candidates. Maximal degree in co-relation 10404. Up to 4914 conditions per place. [2023-08-29 19:30:08,511 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 54 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:30:08,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 270 flow [2023-08-29 19:30:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-08-29 19:30:08,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449685534591195 [2023-08-29 19:30:08,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-08-29 19:30:08,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-08-29 19:30:08,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:08,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-08-29 19:30:08,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-29 19:30:08,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:08,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:08,523 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 849 transitions. [2023-08-29 19:30:08,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 270 flow [2023-08-29 19:30:08,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:30:08,526 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 158 flow [2023-08-29 19:30:08,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-08-29 19:30:08,529 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:30:08,529 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 158 flow [2023-08-29 19:30:08,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 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-29 19:30:08,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:08,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:30:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:30:08,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:08,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495978, now seen corresponding path program 1 times [2023-08-29 19:30:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:08,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98168787] [2023-08-29 19:30:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:08,617 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-29 19:30:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98168787] [2023-08-29 19:30:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98168787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:08,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510719708] [2023-08-29 19:30:08,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:08,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:08,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:30:08,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-29 19:30:08,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:08,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:30:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:09,051 INFO L130 PetriNetUnfolder]: 2363/3821 cut-off events. [2023-08-29 19:30:09,051 INFO L131 PetriNetUnfolder]: For 169/231 co-relation queries the response was YES. [2023-08-29 19:30:09,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 3821 events. 2363/3821 cut-off events. For 169/231 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 20578 event pairs, 1925 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 7704. Up to 3628 conditions per place. [2023-08-29 19:30:09,065 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-29 19:30:09,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 266 flow [2023-08-29 19:30:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-08-29 19:30:09,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2023-08-29 19:30:09,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-08-29 19:30:09,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-08-29 19:30:09,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:09,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-08-29 19:30:09,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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-29 19:30:09,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:09,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:09,076 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 158 flow. Second operand 3 states and 840 transitions. [2023-08-29 19:30:09,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 266 flow [2023-08-29 19:30:09,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:09,080 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 156 flow [2023-08-29 19:30:09,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-29 19:30:09,082 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:30:09,083 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 156 flow [2023-08-29 19:30:09,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-29 19:30:09,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:09,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:30:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:30:09,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:09,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:09,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1109495977, now seen corresponding path program 1 times [2023-08-29 19:30:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641765132] [2023-08-29 19:30:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:09,165 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-29 19:30:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641765132] [2023-08-29 19:30:09,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641765132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:09,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:09,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135242977] [2023-08-29 19:30:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:09,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:30:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:30:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:30:09,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 636 [2023-08-29 19:30:09,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 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-29 19:30:09,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:09,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 636 [2023-08-29 19:30:09,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:09,558 INFO L130 PetriNetUnfolder]: 1473/2479 cut-off events. [2023-08-29 19:30:09,558 INFO L131 PetriNetUnfolder]: For 125/166 co-relation queries the response was YES. [2023-08-29 19:30:09,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 2479 events. 1473/2479 cut-off events. For 125/166 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12930 event pairs, 1173 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 5010. Up to 2342 conditions per place. [2023-08-29 19:30:09,569 INFO L137 encePairwiseOnDemand]: 633/636 looper letters, 52 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-29 19:30:09,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 262 flow [2023-08-29 19:30:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2023-08-29 19:30:09,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271488469601677 [2023-08-29 19:30:09,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2023-08-29 19:30:09,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2023-08-29 19:30:09,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:09,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2023-08-29 19:30:09,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 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-29 19:30:09,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:09,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:09,580 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 156 flow. Second operand 3 states and 815 transitions. [2023-08-29 19:30:09,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 262 flow [2023-08-29 19:30:09,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:09,582 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 154 flow [2023-08-29 19:30:09,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2023-08-29 19:30:09,583 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -44 predicate places. [2023-08-29 19:30:09,584 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 154 flow [2023-08-29 19:30:09,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 255.25) internal successors, (1021), 4 states have internal predecessors, (1021), 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-29 19:30:09,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:09,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:30:09,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:30:09,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:09,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 34798183, now seen corresponding path program 1 times [2023-08-29 19:30:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:09,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490955479] [2023-08-29 19:30:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:10,511 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-29 19:30:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490955479] [2023-08-29 19:30:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490955479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:10,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:10,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:10,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045243375] [2023-08-29 19:30:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:10,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:30:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:30:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:30:11,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 636 [2023-08-29 19:30:11,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 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-29 19:30:11,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:11,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 636 [2023-08-29 19:30:11,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:12,591 INFO L130 PetriNetUnfolder]: 1853/3134 cut-off events. [2023-08-29 19:30:12,591 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2023-08-29 19:30:12,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 3134 events. 1853/3134 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17498 event pairs, 443 based on Foata normal form. 25/2258 useless extension candidates. Maximal degree in co-relation 6358. Up to 2495 conditions per place. [2023-08-29 19:30:12,608 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 75 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-29 19:30:12,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 383 flow [2023-08-29 19:30:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:30:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:30:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1094 transitions. [2023-08-29 19:30:12,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4300314465408805 [2023-08-29 19:30:12,613 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1094 transitions. [2023-08-29 19:30:12,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1094 transitions. [2023-08-29 19:30:12,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:12,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1094 transitions. [2023-08-29 19:30:12,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.5) internal successors, (1094), 4 states have internal predecessors, (1094), 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-29 19:30:12,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:12,622 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:12,622 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 154 flow. Second operand 4 states and 1094 transitions. [2023-08-29 19:30:12,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 383 flow [2023-08-29 19:30:12,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:12,627 INFO L231 Difference]: Finished difference. Result has 64 places, 69 transitions, 208 flow [2023-08-29 19:30:12,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2023-08-29 19:30:12,629 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2023-08-29 19:30:12,629 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 208 flow [2023-08-29 19:30:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 253.5) internal successors, (1014), 4 states have internal predecessors, (1014), 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-29 19:30:12,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:12,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:30:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:30:12,630 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:12,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 34645865, now seen corresponding path program 1 times [2023-08-29 19:30:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58157561] [2023-08-29 19:30:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:12,746 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-29 19:30:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58157561] [2023-08-29 19:30:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58157561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:12,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465926754] [2023-08-29 19:30:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:12,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:30:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:30:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:30:12,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 636 [2023-08-29 19:30:12,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 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-29 19:30:12,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:12,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 636 [2023-08-29 19:30:12,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:13,351 INFO L130 PetriNetUnfolder]: 1643/2806 cut-off events. [2023-08-29 19:30:13,351 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-29 19:30:13,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2806 events. 1643/2806 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15124 event pairs, 600 based on Foata normal form. 150/2328 useless extension candidates. Maximal degree in co-relation 5858. Up to 1639 conditions per place. [2023-08-29 19:30:13,366 INFO L137 encePairwiseOnDemand]: 627/636 looper letters, 81 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-29 19:30:13,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 425 flow [2023-08-29 19:30:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:30:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:30:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1108 transitions. [2023-08-29 19:30:13,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43553459119496857 [2023-08-29 19:30:13,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1108 transitions. [2023-08-29 19:30:13,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1108 transitions. [2023-08-29 19:30:13,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:13,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1108 transitions. [2023-08-29 19:30:13,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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-29 19:30:13,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:13,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:13,380 INFO L175 Difference]: Start difference. First operand has 64 places, 69 transitions, 208 flow. Second operand 4 states and 1108 transitions. [2023-08-29 19:30:13,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 425 flow [2023-08-29 19:30:13,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:30:13,383 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 184 flow [2023-08-29 19:30:13,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-29 19:30:13,384 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:30:13,384 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 184 flow [2023-08-29 19:30:13,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 256.5) internal successors, (1026), 4 states have internal predecessors, (1026), 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-29 19:30:13,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:13,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:13,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:30:13,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:13,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843232, now seen corresponding path program 1 times [2023-08-29 19:30:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739516918] [2023-08-29 19:30:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:13,440 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-29 19:30:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739516918] [2023-08-29 19:30:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739516918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:13,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224148666] [2023-08-29 19:30:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:13,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:30:13,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-29 19:30:13,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:13,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:30:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:13,584 INFO L130 PetriNetUnfolder]: 533/1074 cut-off events. [2023-08-29 19:30:13,585 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-29 19:30:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1074 events. 533/1074 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5574 event pairs, 318 based on Foata normal form. 38/941 useless extension candidates. Maximal degree in co-relation 2231. Up to 597 conditions per place. [2023-08-29 19:30:13,589 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 61 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-29 19:30:13,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 339 flow [2023-08-29 19:30:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-29 19:30:13,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44234800838574423 [2023-08-29 19:30:13,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-29 19:30:13,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-29 19:30:13,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:13,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-29 19:30:13,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-29 19:30:13,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:13,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:13,600 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 184 flow. Second operand 3 states and 844 transitions. [2023-08-29 19:30:13,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 339 flow [2023-08-29 19:30:13,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:30:13,604 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 185 flow [2023-08-29 19:30:13,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-29 19:30:13,606 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:30:13,606 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 185 flow [2023-08-29 19:30:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-29 19:30:13,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:13,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:30:13,607 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:13,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781159, now seen corresponding path program 1 times [2023-08-29 19:30:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66162526] [2023-08-29 19:30:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:13,753 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-29 19:30:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66162526] [2023-08-29 19:30:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66162526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:30:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950919288] [2023-08-29 19:30:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:30:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:30:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:30:13,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 636 [2023-08-29 19:30:13,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-29 19:30:13,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:13,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 636 [2023-08-29 19:30:13,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:13,998 INFO L130 PetriNetUnfolder]: 506/1041 cut-off events. [2023-08-29 19:30:13,998 INFO L131 PetriNetUnfolder]: For 131/133 co-relation queries the response was YES. [2023-08-29 19:30:14,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1041 events. 506/1041 cut-off events. For 131/133 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5453 event pairs, 423 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2193. Up to 938 conditions per place. [2023-08-29 19:30:14,002 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:30:14,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 281 flow [2023-08-29 19:30:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:30:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:30:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-29 19:30:14,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-29 19:30:14,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-29 19:30:14,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-29 19:30:14,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:14,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-29 19:30:14,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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-29 19:30:14,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:14,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:30:14,013 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 185 flow. Second operand 3 states and 827 transitions. [2023-08-29 19:30:14,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 281 flow [2023-08-29 19:30:14,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:14,016 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 181 flow [2023-08-29 19:30:14,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-29 19:30:14,016 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -45 predicate places. [2023-08-29 19:30:14,016 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 181 flow [2023-08-29 19:30:14,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-29 19:30:14,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:14,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:14,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:30:14,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:14,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1760781158, now seen corresponding path program 1 times [2023-08-29 19:30:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961668234] [2023-08-29 19:30:14,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:14,219 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-29 19:30:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:14,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961668234] [2023-08-29 19:30:14,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961668234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:14,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:30:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691245697] [2023-08-29 19:30:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:30:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:30:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:30:14,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-29 19:30:14,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 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-29 19:30:14,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:14,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-29 19:30:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:14,523 INFO L130 PetriNetUnfolder]: 354/719 cut-off events. [2023-08-29 19:30:14,523 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-29 19:30:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 719 events. 354/719 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3320 event pairs, 226 based on Foata normal form. 8/652 useless extension candidates. Maximal degree in co-relation 1544. Up to 514 conditions per place. [2023-08-29 19:30:14,526 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-29 19:30:14,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 330 flow [2023-08-29 19:30:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:30:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:30:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1105 transitions. [2023-08-29 19:30:14,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343553459119497 [2023-08-29 19:30:14,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1105 transitions. [2023-08-29 19:30:14,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1105 transitions. [2023-08-29 19:30:14,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:14,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1105 transitions. [2023-08-29 19:30:14,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 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-29 19:30:14,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:14,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 636.0) internal successors, (3180), 5 states have internal predecessors, (3180), 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-29 19:30:14,538 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 181 flow. Second operand 4 states and 1105 transitions. [2023-08-29 19:30:14,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 330 flow [2023-08-29 19:30:14,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:14,541 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 179 flow [2023-08-29 19:30:14,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-29 19:30:14,541 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2023-08-29 19:30:14,541 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 179 flow [2023-08-29 19:30:14,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 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-29 19:30:14,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:14,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:30:14,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:14,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1250363540, now seen corresponding path program 1 times [2023-08-29 19:30:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454823284] [2023-08-29 19:30:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454823284] [2023-08-29 19:30:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454823284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:30:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512344129] [2023-08-29 19:30:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:30:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:30:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:30:15,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 636 [2023-08-29 19:30:15,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 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-29 19:30:15,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:15,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 636 [2023-08-29 19:30:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:15,368 INFO L130 PetriNetUnfolder]: 368/732 cut-off events. [2023-08-29 19:30:15,368 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-29 19:30:15,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 732 events. 368/732 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3372 event pairs, 286 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 1620. Up to 678 conditions per place. [2023-08-29 19:30:15,371 INFO L137 encePairwiseOnDemand]: 629/636 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-29 19:30:15,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 343 flow [2023-08-29 19:30:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:30:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:30:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-29 19:30:15,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106394129979036 [2023-08-29 19:30:15,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-29 19:30:15,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-29 19:30:15,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:15,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-29 19:30:15,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 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-29 19:30:15,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 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-29 19:30:15,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 636.0) internal successors, (4452), 7 states have internal predecessors, (4452), 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-29 19:30:15,387 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 179 flow. Second operand 6 states and 1567 transitions. [2023-08-29 19:30:15,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 343 flow [2023-08-29 19:30:15,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:30:15,390 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 233 flow [2023-08-29 19:30:15,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2023-08-29 19:30:15,392 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2023-08-29 19:30:15,392 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 233 flow [2023-08-29 19:30:15,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 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-29 19:30:15,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:15,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:15,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:30:15,393 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:15,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1718251328, now seen corresponding path program 1 times [2023-08-29 19:30:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663843545] [2023-08-29 19:30:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:30:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663843545] [2023-08-29 19:30:15,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663843545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:30:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:30:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:30:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282127891] [2023-08-29 19:30:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:30:15,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:30:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:30:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:30:16,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 636 [2023-08-29 19:30:16,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 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-29 19:30:16,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:16,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 636 [2023-08-29 19:30:16,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:16,321 INFO L130 PetriNetUnfolder]: 458/907 cut-off events. [2023-08-29 19:30:16,321 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2023-08-29 19:30:16,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 907 events. 458/907 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4423 event pairs, 111 based on Foata normal form. 7/847 useless extension candidates. Maximal degree in co-relation 2121. Up to 593 conditions per place. [2023-08-29 19:30:16,328 INFO L137 encePairwiseOnDemand]: 625/636 looper letters, 69 selfloop transitions, 19 changer transitions 0/95 dead transitions. [2023-08-29 19:30:16,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 493 flow [2023-08-29 19:30:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:30:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:30:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1832 transitions. [2023-08-29 19:30:16,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115004492362983 [2023-08-29 19:30:16,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1832 transitions. [2023-08-29 19:30:16,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1832 transitions. [2023-08-29 19:30:16,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:16,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1832 transitions. [2023-08-29 19:30:16,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 261.7142857142857) internal successors, (1832), 7 states have internal predecessors, (1832), 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-29 19:30:16,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:30:16,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:30:16,345 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 233 flow. Second operand 7 states and 1832 transitions. [2023-08-29 19:30:16,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 493 flow [2023-08-29 19:30:16,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 485 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 19:30:16,348 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 333 flow [2023-08-29 19:30:16,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-29 19:30:16,349 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -29 predicate places. [2023-08-29 19:30:16,349 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 333 flow [2023-08-29 19:30:16,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 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-29 19:30:16,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:16,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:16,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:30:16,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:16,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1250219982, now seen corresponding path program 2 times [2023-08-29 19:30:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435146657] [2023-08-29 19:30:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:16,757 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-29 19:30:16,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435146657] [2023-08-29 19:30:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435146657] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588219341] [2023-08-29 19:30:16,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:30:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:16,761 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-29 19:30:16,773 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-29 19:30:16,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:30:16,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:30:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-29 19:30:16,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:17,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 19:30:17,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:17,141 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 16 treesize of output 18 [2023-08-29 19:30:17,157 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-29 19:30:17,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:30:17,171 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 38 treesize of output 34 [2023-08-29 19:30:17,213 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_460 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_460 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_460) |c_~#queue~0.base|) .cse0) 402)))) is different from false [2023-08-29 19:30:17,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:30:17,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-29 19:30:17,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:30:17,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-08-29 19:30:17,258 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 11 treesize of output 7 [2023-08-29 19:30:17,283 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-08-29 19:30:17,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-08-29 19:30:17,355 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-29 19:30:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588219341] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:30:17,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:30:17,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-29 19:30:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614487850] [2023-08-29 19:30:17,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:30:17,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 19:30:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 19:30:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2023-08-29 19:30:17,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 636 [2023-08-29 19:30:17,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 333 flow. Second operand has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 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-29 19:30:17,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:17,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 636 [2023-08-29 19:30:17,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:18,104 INFO L130 PetriNetUnfolder]: 590/1180 cut-off events. [2023-08-29 19:30:18,104 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-29 19:30:18,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1180 events. 590/1180 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6356 event pairs, 226 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2983. Up to 727 conditions per place. [2023-08-29 19:30:18,121 INFO L137 encePairwiseOnDemand]: 628/636 looper letters, 96 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-08-29 19:30:18,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 689 flow [2023-08-29 19:30:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:30:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:30:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1315 transitions. [2023-08-29 19:30:18,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953728661275831 [2023-08-29 19:30:18,145 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1315 transitions. [2023-08-29 19:30:18,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1315 transitions. [2023-08-29 19:30:18,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:18,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1315 transitions. [2023-08-29 19:30:18,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 187.85714285714286) internal successors, (1315), 7 states have internal predecessors, (1315), 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-29 19:30:18,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:30:18,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:30:18,155 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 333 flow. Second operand 7 states and 1315 transitions. [2023-08-29 19:30:18,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 689 flow [2023-08-29 19:30:18,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 674 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-29 19:30:18,167 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 402 flow [2023-08-29 19:30:18,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2023-08-29 19:30:18,168 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, -23 predicate places. [2023-08-29 19:30:18,168 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 402 flow [2023-08-29 19:30:18,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.78571428571428) internal successors, (2475), 14 states have internal predecessors, (2475), 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-29 19:30:18,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:18,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:18,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:30:18,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-29 19:30:18,375 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:18,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash 99588272, now seen corresponding path program 1 times [2023-08-29 19:30:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:18,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194954984] [2023-08-29 19:30:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:19,253 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-29 19:30:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194954984] [2023-08-29 19:30:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194954984] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179200253] [2023-08-29 19:30:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:19,256 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-29 19:30:19,276 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-29 19:30:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:19,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-29 19:30:19,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:19,506 INFO L321 Elim1Store]: treesize reduction 98, result has 46.4 percent of original size [2023-08-29 19:30:19,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 314 treesize of output 312 [2023-08-29 19:30:19,531 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-29 19:30:19,557 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 12 treesize of output 11 [2023-08-29 19:30:19,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:19,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 19:30:19,637 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-29 19:30:19,637 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 123 treesize of output 122 [2023-08-29 19:30:19,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 19:30:19,739 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 60 treesize of output 23 [2023-08-29 19:30:19,744 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-29 19:30:20,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:20,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:20,271 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 76 treesize of output 70 [2023-08-29 19:30:20,277 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 51 treesize of output 49 [2023-08-29 19:30:20,285 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 49 treesize of output 45 [2023-08-29 19:30:20,443 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 35 treesize of output 30 [2023-08-29 19:30:20,628 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 44 treesize of output 37 [2023-08-29 19:30:20,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:20,697 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 58 treesize of output 60 [2023-08-29 19:30:20,739 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-29 19:30:20,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:30:20,816 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:30:27,448 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-29 19:30:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179200253] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:30:27,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:30:27,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-29 19:30:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443196518] [2023-08-29 19:30:27,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:30:27,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 19:30:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:30:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 19:30:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=286, Unknown=27, NotChecked=38, Total=462 [2023-08-29 19:30:29,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 19:30:30,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 636 [2023-08-29 19:30:30,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 402 flow. Second operand has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 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-29 19:30:30,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:30:30,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 636 [2023-08-29 19:30:30,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:30:33,957 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-29 19:30:44,480 WARN L222 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 90 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:30:46,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 [0, 1] [2023-08-29 19:30:48,871 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-29 19:30:50,912 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-29 19:30:53,256 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-29 19:30:55,458 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4)) .cse2)) (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_555) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))) is different from false [2023-08-29 19:30:57,079 INFO L130 PetriNetUnfolder]: 935/1883 cut-off events. [2023-08-29 19:30:57,079 INFO L131 PetriNetUnfolder]: For 1017/1017 co-relation queries the response was YES. [2023-08-29 19:30:57,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4813 conditions, 1883 events. 935/1883 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11202 event pairs, 558 based on Foata normal form. 16/1787 useless extension candidates. Maximal degree in co-relation 4796. Up to 1161 conditions per place. [2023-08-29 19:30:57,088 INFO L137 encePairwiseOnDemand]: 619/636 looper letters, 147 selfloop transitions, 56 changer transitions 0/209 dead transitions. [2023-08-29 19:30:57,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 209 transitions, 1336 flow [2023-08-29 19:30:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-29 19:30:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-29 19:30:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3947 transitions. [2023-08-29 19:30:57,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2820897655803316 [2023-08-29 19:30:57,099 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3947 transitions. [2023-08-29 19:30:57,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3947 transitions. [2023-08-29 19:30:57,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:30:57,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3947 transitions. [2023-08-29 19:30:57,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 179.4090909090909) internal successors, (3947), 22 states have internal predecessors, (3947), 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-29 19:30:57,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 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-29 19:30:57,127 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 636.0) internal successors, (14628), 23 states have internal predecessors, (14628), 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-29 19:30:57,128 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 402 flow. Second operand 22 states and 3947 transitions. [2023-08-29 19:30:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 209 transitions, 1336 flow [2023-08-29 19:30:57,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 209 transitions, 1300 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-29 19:30:57,135 INFO L231 Difference]: Finished difference. Result has 112 places, 126 transitions, 888 flow [2023-08-29 19:30:57,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=888, PETRI_PLACES=112, PETRI_TRANSITIONS=126} [2023-08-29 19:30:57,135 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 6 predicate places. [2023-08-29 19:30:57,136 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 126 transitions, 888 flow [2023-08-29 19:30:57,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 172.77272727272728) internal successors, (3801), 22 states have internal predecessors, (3801), 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-29 19:30:57,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:30:57,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:30:57,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-29 19:30:57,343 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,SelfDestructingSolverStorable15 [2023-08-29 19:30:57,344 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:30:57,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:30:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1733159420, now seen corresponding path program 1 times [2023-08-29 19:30:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:30:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734078730] [2023-08-29 19:30:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:30:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:58,446 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-29 19:30:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:30:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734078730] [2023-08-29 19:30:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734078730] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:30:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236099455] [2023-08-29 19:30:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:30:58,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:30:58,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:30:58,449 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-29 19:30:58,451 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-29 19:30:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:30:58,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-29 19:30:58,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:30:58,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:58,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:58,622 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:30:58,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-29 19:30:58,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:58,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:30:58,645 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 10 treesize of output 8 [2023-08-29 19:30:58,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-29 19:30:58,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:58,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:30:58,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:58,978 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 21 treesize of output 20 [2023-08-29 19:30:59,104 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 19 treesize of output 18 [2023-08-29 19:30:59,270 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 19 treesize of output 11 [2023-08-29 19:30:59,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:30:59,354 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-29 19:30:59,405 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-29 19:30:59,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:30:59,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-08-29 19:30:59,462 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:30:59,477 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_650 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:30:59,506 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_647) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-29 19:30:59,539 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_645))) (store (store .cse0 .cse1 v_ArrVal_647) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_645))) (store (store .cse6 .cse1 v_ArrVal_647) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:31:01,574 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_645))) (store (store .cse0 .cse1 v_ArrVal_647) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_647 Int) (v_ArrVal_645 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_645))) (store (store .cse5 .cse1 v_ArrVal_647) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_650) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))))) is different from false [2023-08-29 19:31:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 19:31:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236099455] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:02,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2023-08-29 19:31:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530729878] [2023-08-29 19:31:02,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:02,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 19:31:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 19:31:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=277, Unknown=7, NotChecked=234, Total=600 [2023-08-29 19:31:02,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:31:02,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 126 transitions, 888 flow. Second operand has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 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-29 19:31:02,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:02,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:31:02,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:04,797 INFO L130 PetriNetUnfolder]: 1044/2155 cut-off events. [2023-08-29 19:31:04,798 INFO L131 PetriNetUnfolder]: For 3315/3319 co-relation queries the response was YES. [2023-08-29 19:31:04,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 2155 events. 1044/2155 cut-off events. For 3315/3319 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13293 event pairs, 334 based on Foata normal form. 14/2050 useless extension candidates. Maximal degree in co-relation 7221. Up to 1218 conditions per place. [2023-08-29 19:31:04,812 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 151 selfloop transitions, 48 changer transitions 0/205 dead transitions. [2023-08-29 19:31:04,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 205 transitions, 1722 flow [2023-08-29 19:31:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 19:31:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 19:31:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2621 transitions. [2023-08-29 19:31:04,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27473794549266245 [2023-08-29 19:31:04,820 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2621 transitions. [2023-08-29 19:31:04,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2621 transitions. [2023-08-29 19:31:04,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:04,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2621 transitions. [2023-08-29 19:31:04,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 174.73333333333332) internal successors, (2621), 15 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:04,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 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-29 19:31:04,835 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 636.0) internal successors, (10176), 16 states have internal predecessors, (10176), 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-29 19:31:04,835 INFO L175 Difference]: Start difference. First operand has 112 places, 126 transitions, 888 flow. Second operand 15 states and 2621 transitions. [2023-08-29 19:31:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 205 transitions, 1722 flow [2023-08-29 19:31:04,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 205 transitions, 1581 flow, removed 61 selfloop flow, removed 5 redundant places. [2023-08-29 19:31:04,851 INFO L231 Difference]: Finished difference. Result has 129 places, 152 transitions, 1118 flow [2023-08-29 19:31:04,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1118, PETRI_PLACES=129, PETRI_TRANSITIONS=152} [2023-08-29 19:31:04,851 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 23 predicate places. [2023-08-29 19:31:04,852 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 152 transitions, 1118 flow [2023-08-29 19:31:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 167.68) internal successors, (4192), 25 states have internal predecessors, (4192), 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-29 19:31:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:04,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:04,861 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-29 19:31:05,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:05,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:31:05,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1207708666, now seen corresponding path program 2 times [2023-08-29 19:31:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76981817] [2023-08-29 19:31:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:06,064 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-29 19:31:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76981817] [2023-08-29 19:31:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76981817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915504514] [2023-08-29 19:31:06,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:31:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:06,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:06,069 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-29 19:31:06,076 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-29 19:31:06,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:31:06,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:06,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-29 19:31:06,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:06,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:06,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:06,256 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:31:06,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:31:06,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:06,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:31:06,281 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 10 treesize of output 8 [2023-08-29 19:31:06,544 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 36 treesize of output 29 [2023-08-29 19:31:06,707 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 32 treesize of output 27 [2023-08-29 19:31:07,021 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 41 treesize of output 34 [2023-08-29 19:31:07,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:07,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-29 19:31:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:07,236 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 52 treesize of output 54 [2023-08-29 19:31:07,302 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-29 19:31:07,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:18,616 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-29 19:31:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915504514] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:18,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-29 19:31:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509416775] [2023-08-29 19:31:18,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-29 19:31:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-29 19:31:18,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=497, Unknown=18, NotChecked=0, Total=650 [2023-08-29 19:31:24,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:31:24,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 152 transitions, 1118 flow. Second operand has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 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-29 19:31:24,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:24,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:31:24,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:32,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:44,803 WARN L222 SmtUtils]: Spent 12.00s on a formula simplification. DAG size of input: 96 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:31:47,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:49,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:51,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:53,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:56,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:31:58,837 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-29 19:32:00,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:02,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:12,590 WARN L222 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 36 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:32:21,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:32:25,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:32:27,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:32:31,630 INFO L130 PetriNetUnfolder]: 1365/2817 cut-off events. [2023-08-29 19:32:31,630 INFO L131 PetriNetUnfolder]: For 7269/7277 co-relation queries the response was YES. [2023-08-29 19:32:31,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10248 conditions, 2817 events. 1365/2817 cut-off events. For 7269/7277 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18504 event pairs, 449 based on Foata normal form. 14/2681 useless extension candidates. Maximal degree in co-relation 10212. Up to 948 conditions per place. [2023-08-29 19:32:31,651 INFO L137 encePairwiseOnDemand]: 621/636 looper letters, 203 selfloop transitions, 68 changer transitions 0/277 dead transitions. [2023-08-29 19:32:31,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 277 transitions, 2524 flow [2023-08-29 19:32:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 19:32:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 19:32:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3513 transitions. [2023-08-29 19:32:31,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27617924528301885 [2023-08-29 19:32:31,659 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3513 transitions. [2023-08-29 19:32:31,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3513 transitions. [2023-08-29 19:32:31,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:31,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3513 transitions. [2023-08-29 19:32:31,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 175.65) internal successors, (3513), 20 states have internal predecessors, (3513), 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-29 19:32:31,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 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-29 19:32:31,677 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 636.0) internal successors, (13356), 21 states have internal predecessors, (13356), 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-29 19:32:31,677 INFO L175 Difference]: Start difference. First operand has 129 places, 152 transitions, 1118 flow. Second operand 20 states and 3513 transitions. [2023-08-29 19:32:31,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 277 transitions, 2524 flow [2023-08-29 19:32:31,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 277 transitions, 2452 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-08-29 19:32:31,703 INFO L231 Difference]: Finished difference. Result has 151 places, 169 transitions, 1390 flow [2023-08-29 19:32:31,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1390, PETRI_PLACES=151, PETRI_TRANSITIONS=169} [2023-08-29 19:32:31,703 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 45 predicate places. [2023-08-29 19:32:31,704 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 169 transitions, 1390 flow [2023-08-29 19:32:31,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 167.6153846153846) internal successors, (4358), 26 states have internal predecessors, (4358), 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-29 19:32:31,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:31,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:31,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 19:32:31,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-29 19:32:31,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:32:31,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1499155704, now seen corresponding path program 1 times [2023-08-29 19:32:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:32:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774779096] [2023-08-29 19:32:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:32:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:32,037 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-29 19:32:32,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:32:32,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774779096] [2023-08-29 19:32:32,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774779096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:32,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:32,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:32:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894711703] [2023-08-29 19:32:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:32,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:32:32,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:32:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:32:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:32:32,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 636 [2023-08-29 19:32:32,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 169 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-29 19:32:32,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:32,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 636 [2023-08-29 19:32:32,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:32,703 INFO L130 PetriNetUnfolder]: 1356/2821 cut-off events. [2023-08-29 19:32:32,703 INFO L131 PetriNetUnfolder]: For 7382/7392 co-relation queries the response was YES. [2023-08-29 19:32:32,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10567 conditions, 2821 events. 1356/2821 cut-off events. For 7382/7392 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18826 event pairs, 699 based on Foata normal form. 9/2709 useless extension candidates. Maximal degree in co-relation 10527. Up to 1269 conditions per place. [2023-08-29 19:32:32,723 INFO L137 encePairwiseOnDemand]: 632/636 looper letters, 160 selfloop transitions, 3 changer transitions 0/181 dead transitions. [2023-08-29 19:32:32,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 181 transitions, 1808 flow [2023-08-29 19:32:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:32:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:32:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2023-08-29 19:32:32,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418238993710692 [2023-08-29 19:32:32,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 843 transitions. [2023-08-29 19:32:32,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 843 transitions. [2023-08-29 19:32:32,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:32,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 843 transitions. [2023-08-29 19:32:32,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-29 19:32:32,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:32:32,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 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-29 19:32:32,729 INFO L175 Difference]: Start difference. First operand has 151 places, 169 transitions, 1390 flow. Second operand 3 states and 843 transitions. [2023-08-29 19:32:32,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 181 transitions, 1808 flow [2023-08-29 19:32:32,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 181 transitions, 1731 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-29 19:32:32,756 INFO L231 Difference]: Finished difference. Result has 146 places, 166 transitions, 1307 flow [2023-08-29 19:32:32,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1307, PETRI_PLACES=146, PETRI_TRANSITIONS=166} [2023-08-29 19:32:32,757 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 40 predicate places. [2023-08-29 19:32:32,757 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 166 transitions, 1307 flow [2023-08-29 19:32:32,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-29 19:32:32,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:32,758 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:32,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 19:32:32,758 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:32:32,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2042297759, now seen corresponding path program 1 times [2023-08-29 19:32:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:32:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690815740] [2023-08-29 19:32:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:32:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:32:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690815740] [2023-08-29 19:32:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690815740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:32:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111529461] [2023-08-29 19:32:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:33,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:32:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:32:33,097 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-29 19:32:33,099 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-29 19:32:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:33,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:32:33,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:33,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:33,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:33,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:33,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:32:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:33,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:32:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111529461] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:32:34,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:32:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-08-29 19:32:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991878498] [2023-08-29 19:32:34,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:32:34,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:32:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:32:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:32:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:32:38,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-29 19:32:38,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 166 transitions, 1307 flow. Second operand has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 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-29 19:32:38,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:38,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-29 19:32:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:40,241 INFO L130 PetriNetUnfolder]: 1174/2398 cut-off events. [2023-08-29 19:32:40,241 INFO L131 PetriNetUnfolder]: For 9175/9185 co-relation queries the response was YES. [2023-08-29 19:32:40,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10602 conditions, 2398 events. 1174/2398 cut-off events. For 9175/9185 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13219 event pairs, 455 based on Foata normal form. 137/2476 useless extension candidates. Maximal degree in co-relation 10562. Up to 978 conditions per place. [2023-08-29 19:32:40,257 INFO L137 encePairwiseOnDemand]: 631/636 looper letters, 185 selfloop transitions, 18 changer transitions 0/222 dead transitions. [2023-08-29 19:32:40,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 222 transitions, 2241 flow [2023-08-29 19:32:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:32:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:32:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1906 transitions. [2023-08-29 19:32:40,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281221922731357 [2023-08-29 19:32:40,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1906 transitions. [2023-08-29 19:32:40,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1906 transitions. [2023-08-29 19:32:40,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:40,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1906 transitions. [2023-08-29 19:32:40,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 272.2857142857143) internal successors, (1906), 7 states have internal predecessors, (1906), 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-29 19:32:40,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:32:40,268 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 636.0) internal successors, (5088), 8 states have internal predecessors, (5088), 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-29 19:32:40,268 INFO L175 Difference]: Start difference. First operand has 146 places, 166 transitions, 1307 flow. Second operand 7 states and 1906 transitions. [2023-08-29 19:32:40,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 222 transitions, 2241 flow [2023-08-29 19:32:40,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 222 transitions, 2209 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-29 19:32:40,297 INFO L231 Difference]: Finished difference. Result has 151 places, 163 transitions, 1328 flow [2023-08-29 19:32:40,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1328, PETRI_PLACES=151, PETRI_TRANSITIONS=163} [2023-08-29 19:32:40,298 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 45 predicate places. [2023-08-29 19:32:40,298 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 163 transitions, 1328 flow [2023-08-29 19:32:40,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 261.6363636363636) internal successors, (2878), 11 states have internal predecessors, (2878), 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-29 19:32:40,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:40,299 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:40,307 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-29 19:32:40,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:32:40,505 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:32:40,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash 152050041, now seen corresponding path program 1 times [2023-08-29 19:32:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:32:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733920581] [2023-08-29 19:32:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:32:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:32:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733920581] [2023-08-29 19:32:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733920581] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:32:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624822835] [2023-08-29 19:32:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:32:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:32:41,807 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-29 19:32:41,809 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-29 19:32:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:41,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-29 19:32:41,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:41,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:42,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:42,046 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:32:42,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-29 19:32:42,058 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 14 treesize of output 12 [2023-08-29 19:32:42,313 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 36 treesize of output 29 [2023-08-29 19:32:42,490 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 32 treesize of output 27 [2023-08-29 19:32:42,817 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 38 treesize of output 31 [2023-08-29 19:32:42,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:42,941 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 49 treesize of output 51 [2023-08-29 19:32:43,237 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 63 treesize of output 56 [2023-08-29 19:32:43,488 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 59 treesize of output 54 [2023-08-29 19:32:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:43,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:32:44,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1)))))) is different from false [2023-08-29 19:32:44,053 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1)))))) is different from false [2023-08-29 19:32:44,106 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|)))) is different from false [2023-08-29 19:32:44,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99| Int) (v_ArrVal_978 Int) (v_ArrVal_983 (Array Int Int)) (v_ArrVal_985 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_978)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_980) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_983) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_99|) |c_~#queue~0.offset|) v_ArrVal_985) .cse1) 400))))) is different from false [2023-08-29 19:32:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-29 19:32:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624822835] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:32:44,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:32:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2023-08-29 19:32:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408382079] [2023-08-29 19:32:44,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:32:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-29 19:32:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:32:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-29 19:32:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=343, Unknown=7, NotChecked=172, Total=650 [2023-08-29 19:32:45,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 636 [2023-08-29 19:32:45,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 163 transitions, 1328 flow. Second operand has 26 states, 26 states have (on average 199.0) internal successors, (5174), 26 states have internal predecessors, (5174), 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-29 19:32:45,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:45,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 636 [2023-08-29 19:32:45,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:51,557 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-29 19:32:53,567 INFO L130 PetriNetUnfolder]: 1321/2644 cut-off events. [2023-08-29 19:32:53,567 INFO L131 PetriNetUnfolder]: For 10476/10488 co-relation queries the response was YES. [2023-08-29 19:32:53,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11895 conditions, 2644 events. 1321/2644 cut-off events. For 10476/10488 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 14787 event pairs, 711 based on Foata normal form. 26/2590 useless extension candidates. Maximal degree in co-relation 11852. Up to 1761 conditions per place. [2023-08-29 19:32:53,588 INFO L137 encePairwiseOnDemand]: 620/636 looper letters, 154 selfloop transitions, 85 changer transitions 0/244 dead transitions. [2023-08-29 19:32:53,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 244 transitions, 2454 flow [2023-08-29 19:32:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-29 19:32:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-29 19:32:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5682 transitions. [2023-08-29 19:32:53,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3190700808625337 [2023-08-29 19:32:53,596 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5682 transitions. [2023-08-29 19:32:53,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5682 transitions. [2023-08-29 19:32:53,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:53,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5682 transitions. [2023-08-29 19:32:53,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 202.92857142857142) internal successors, (5682), 28 states have internal predecessors, (5682), 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-29 19:32:53,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 636.0) internal successors, (18444), 29 states have internal predecessors, (18444), 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-29 19:32:53,617 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 636.0) internal successors, (18444), 29 states have internal predecessors, (18444), 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-29 19:32:53,617 INFO L175 Difference]: Start difference. First operand has 151 places, 163 transitions, 1328 flow. Second operand 28 states and 5682 transitions. [2023-08-29 19:32:53,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 244 transitions, 2454 flow [2023-08-29 19:32:53,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 244 transitions, 2390 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-29 19:32:53,649 INFO L231 Difference]: Finished difference. Result has 181 places, 190 transitions, 1818 flow [2023-08-29 19:32:53,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1818, PETRI_PLACES=181, PETRI_TRANSITIONS=190} [2023-08-29 19:32:53,650 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 75 predicate places. [2023-08-29 19:32:53,650 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 190 transitions, 1818 flow [2023-08-29 19:32:53,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 199.0) internal successors, (5174), 26 states have internal predecessors, (5174), 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-29 19:32:53,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:53,651 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:53,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 19:32:53,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:32:53,861 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:32:53,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1889929349, now seen corresponding path program 3 times [2023-08-29 19:32:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:32:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969300826] [2023-08-29 19:32:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:32:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:32:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969300826] [2023-08-29 19:32:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969300826] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:32:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415219070] [2023-08-29 19:32:56,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:32:56,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:32:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:32:56,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:32:56,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 19:32:56,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 19:32:56,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:32:56,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 87 conjunts are in the unsatisfiable core [2023-08-29 19:32:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:56,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:56,812 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:32:56,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2023-08-29 19:32:56,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:56,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:32:56,868 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 10 treesize of output 8 [2023-08-29 19:32:56,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-29 19:32:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:57,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:57,496 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 28 treesize of output 30 [2023-08-29 19:32:57,789 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 26 treesize of output 21 [2023-08-29 19:32:58,187 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 19 treesize of output 11 [2023-08-29 19:32:58,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:58,356 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-29 19:32:58,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:58,560 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 21 treesize of output 20 [2023-08-29 19:32:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:58,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:32:58,983 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 19 treesize of output 18 [2023-08-29 19:32:59,263 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 19 treesize of output 11 [2023-08-29 19:32:59,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:59,444 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-29 19:32:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:59,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:32:59,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-29 19:32:59,866 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:33:29,779 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:33:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-29 19:33:30,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415219070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:33:30,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:33:30,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 38 [2023-08-29 19:33:30,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348989891] [2023-08-29 19:33:30,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:33:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-29 19:33:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:33:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-29 19:33:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1129, Unknown=31, NotChecked=146, Total=1560 [2023-08-29 19:33:30,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:33:30,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 190 transitions, 1818 flow. Second operand has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 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-29 19:33:30,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:30,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:33:30,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:42,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:33:44,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:11,950 WARN L222 SmtUtils]: Spent 11.08s on a formula simplification. DAG size of input: 227 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:34:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:23,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:12,436 WARN L222 SmtUtils]: Spent 1.70m on a formula simplification. DAG size of input: 286 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:36:15,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:19,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:21,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:23,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:26,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:28,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:30,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:32,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:38,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:40,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:42,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:44,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 [0, 1] [2023-08-29 19:36:47,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:37:10,867 WARN L222 SmtUtils]: Spent 10.46s on a formula simplification. DAG size of input: 237 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:25,626 WARN L222 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 270 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:28,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:38:43,310 WARN L222 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 268 DAG size of output: 260 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:12,279 WARN L222 SmtUtils]: Spent 16.26s on a formula simplification. DAG size of input: 128 DAG size of output: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:39:14,873 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-29 19:39:16,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-29 19:39:19,013 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-29 19:39:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:39:23,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:39:25,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-29 19:39:36,787 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-29 19:39:38,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:39:40,644 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-29 19:39:47,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:40:17,981 WARN L222 SmtUtils]: Spent 15.62s on a formula simplification. DAG size of input: 118 DAG size of output: 114 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:40:19,456 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-29 19:40:21,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:40:23,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:40:59,970 WARN L222 SmtUtils]: Spent 25.14s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:04,182 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-29 19:41:29,197 WARN L222 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:41:31,334 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-29 19:41:33,551 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-29 19:41:36,515 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-29 19:41:38,543 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-29 19:41:41,457 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-29 19:41:43,462 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-29 19:41:45,919 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-29 19:41:48,373 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-29 19:41:50,388 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-29 19:41:52,618 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-29 19:41:54,694 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-29 19:41:56,706 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-29 19:41:58,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:42:00,267 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-29 19:42:02,852 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-29 19:42:04,985 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-29 19:42:08,149 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-29 19:42:10,739 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-29 19:42:13,083 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-29 19:42:15,089 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-29 19:42:17,922 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-29 19:42:19,966 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-29 19:42:22,236 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-29 19:42:24,246 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-29 19:42:28,177 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-29 19:42:30,579 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-29 19:42:32,585 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-29 19:42:34,595 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-29 19:42:36,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:42:38,336 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-29 19:42:40,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-29 19:42:42,998 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-29 19:42:45,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-29 19:42:47,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-29 19:42:49,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:42:51,503 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-29 19:42:53,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:42:55,463 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-29 19:42:56,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:42:59,253 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-29 19:42:59,553 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_1105 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_1105 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1105) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and (or (and .cse0 .cse1) (< .cse2 0)) .cse0 .cse1)))) is different from false [2023-08-29 19:43:04,617 INFO L130 PetriNetUnfolder]: 1707/3356 cut-off events. [2023-08-29 19:43:04,617 INFO L131 PetriNetUnfolder]: For 26753/27054 co-relation queries the response was YES. [2023-08-29 19:43:04,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18959 conditions, 3356 events. 1707/3356 cut-off events. For 26753/27054 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19373 event pairs, 269 based on Foata normal form. 37/3283 useless extension candidates. Maximal degree in co-relation 18912. Up to 1510 conditions per place. [2023-08-29 19:43:04,635 INFO L137 encePairwiseOnDemand]: 617/636 looper letters, 241 selfloop transitions, 158 changer transitions 0/404 dead transitions. [2023-08-29 19:43:04,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 404 transitions, 5137 flow [2023-08-29 19:43:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-29 19:43:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-29 19:43:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5753 transitions. [2023-08-29 19:43:04,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2741090146750524 [2023-08-29 19:43:04,643 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5753 transitions. [2023-08-29 19:43:04,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5753 transitions. [2023-08-29 19:43:04,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:43:04,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5753 transitions. [2023-08-29 19:43:04,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 174.33333333333334) internal successors, (5753), 33 states have internal predecessors, (5753), 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-29 19:43:04,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 636.0) internal successors, (21624), 34 states have internal predecessors, (21624), 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-29 19:43:04,666 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 636.0) internal successors, (21624), 34 states have internal predecessors, (21624), 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-29 19:43:04,666 INFO L175 Difference]: Start difference. First operand has 181 places, 190 transitions, 1818 flow. Second operand 33 states and 5753 transitions. [2023-08-29 19:43:04,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 404 transitions, 5137 flow [2023-08-29 19:43:04,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 404 transitions, 4981 flow, removed 59 selfloop flow, removed 11 redundant places. [2023-08-29 19:43:04,727 INFO L231 Difference]: Finished difference. Result has 220 places, 289 transitions, 3483 flow [2023-08-29 19:43:04,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3483, PETRI_PLACES=220, PETRI_TRANSITIONS=289} [2023-08-29 19:43:04,727 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 114 predicate places. [2023-08-29 19:43:04,727 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 289 transitions, 3483 flow [2023-08-29 19:43:04,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 167.65) internal successors, (6706), 40 states have internal predecessors, (6706), 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-29 19:43:04,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:43:04,729 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-29 19:43:04,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-29 19:43:04,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:43:04,935 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:43:04,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:43:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -80884552, now seen corresponding path program 4 times [2023-08-29 19:43:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:43:04,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545664920] [2023-08-29 19:43:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:43:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:43:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:43:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:43:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:43:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545664920] [2023-08-29 19:43:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545664920] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:43:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599507228] [2023-08-29 19:43:09,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 19:43:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:43:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:43:09,129 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:43:09,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 19:43:09,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 19:43:09,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:43:09,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-29 19:43:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:43:09,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:43:09,437 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-08-29 19:43:09,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:43:10,547 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 26 treesize of output 14 [2023-08-29 19:43:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:43:10,740 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 15 treesize of output 17 [2023-08-29 19:43:11,151 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:43:11,151 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2023-08-29 19:43:11,420 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 20 treesize of output 19 [2023-08-29 19:43:11,976 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 34 treesize of output 18 [2023-08-29 19:43:12,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:43:12,212 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 23 treesize of output 23 [2023-08-29 19:43:12,597 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:43:12,598 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2023-08-29 19:43:12,939 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 48 treesize of output 35 [2023-08-29 19:43:13,427 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 54 treesize of output 30 [2023-08-29 19:43:13,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:43:13,692 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 41 treesize of output 37 [2023-08-29 19:43:13,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:43:13,983 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 41 treesize of output 37 [2023-08-29 19:43:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:43:14,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:43:14,645 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:43:14,683 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-29 19:43:15,167 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1227 Int)) (<= 0 (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1227) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1227 Int)) (<= (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1227) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-29 19:43:29,033 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse8 (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1216))) (let ((.cse9 (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse5)) |c_~#queue~0.offset|) v_ArrVal_1217)))) (let ((.cse10 (select .cse9 .cse5))) (or (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1219) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1223))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse1 (* (select .cse6 .cse5) 4))) (let ((.cse7 (+ .cse1 |c_~#queue~0.offset|))) (or (< .cse0 (+ .cse1 |c_~#queue~0.offset| 4)) (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1227 Int)) (<= 0 (+ (* 4 (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse7 v_ArrVal_1225))) (store (store .cse3 .cse4 v_ArrVal_1227) .cse5 (+ (select .cse3 .cse5) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))) (< .cse7 0))))))) (= 400 .cse10)))))) (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1217 Int)) (let ((.cse19 (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1216))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* 4 (select .cse21 .cse5)) |c_~#queue~0.offset|) v_ArrVal_1217)))) (let ((.cse13 (select .cse20 .cse5))) (or (= 400 .cse13) (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1219 Int)) (let ((.cse14 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_1219) .cse5 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1223))) (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (let ((.cse18 (* (select .cse16 .cse5) 4))) (let ((.cse17 (+ .cse18 |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1225 Int) (v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1227 Int)) (<= (+ (* 4 (select (select (store (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1225))) (store (store .cse15 .cse4 v_ArrVal_1227) .cse5 (+ (select .cse15 .cse5) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1230) |c_~#stored_elements~0.base| v_ArrVal_1231) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse0)) (< .cse0 (+ .cse18 |c_~#queue~0.offset| 4)) (< .cse17 0)))))))))))))) is different from false [2023-08-29 19:43:30,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:43:30,375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2536 treesize of output 1210 [2023-08-29 19:43:30,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:43:30,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1864 treesize of output 1810 [2023-08-29 19:43:30,493 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 556 treesize of output 552 [2023-08-29 19:43:30,509 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 552 treesize of output 544 [2023-08-29 19:43:30,525 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 544 treesize of output 540 [2023-08-29 19:43:30,542 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 550 treesize of output 538 [2023-08-29 19:43:30,567 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 533 treesize of output 525 [2023-08-29 19:43:30,583 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 525 treesize of output 517 [2023-08-29 19:43:30,598 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 517 treesize of output 509 [2023-08-29 19:43:30,615 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 519 treesize of output 507 [2023-08-29 19:43:30,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-29 19:43:30,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:43:30,982 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 455 treesize of output 331 [2023-08-29 19:43:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 19 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-29 19:43:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599507228] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:43:33,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:43:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 52 [2023-08-29 19:43:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596814170] [2023-08-29 19:43:33,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:43:33,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-29 19:43:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:43:33,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-29 19:43:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2069, Unknown=74, NotChecked=396, Total=2862 [2023-08-29 19:43:33,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 636 [2023-08-29 19:43:33,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 289 transitions, 3483 flow. Second operand has 54 states, 54 states have (on average 167.66666666666666) internal successors, (9054), 54 states have internal predecessors, (9054), 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-29 19:43:33,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:43:33,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 636 [2023-08-29 19:43:33,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:43:50,513 INFO L130 PetriNetUnfolder]: 2433/4868 cut-off events. [2023-08-29 19:43:50,513 INFO L131 PetriNetUnfolder]: For 143507/144577 co-relation queries the response was YES. [2023-08-29 19:43:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40665 conditions, 4868 events. 2433/4868 cut-off events. For 143507/144577 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 27946 event pairs, 492 based on Foata normal form. 117/4773 useless extension candidates. Maximal degree in co-relation 40599. Up to 1985 conditions per place. [2023-08-29 19:43:50,552 INFO L137 encePairwiseOnDemand]: 618/636 looper letters, 379 selfloop transitions, 129 changer transitions 0/513 dead transitions. [2023-08-29 19:43:50,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 513 transitions, 7878 flow [2023-08-29 19:43:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-29 19:43:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-29 19:43:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4606 transitions. [2023-08-29 19:43:50,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2785437832607644 [2023-08-29 19:43:50,562 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4606 transitions. [2023-08-29 19:43:50,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4606 transitions. [2023-08-29 19:43:50,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:43:50,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4606 transitions. [2023-08-29 19:43:50,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 177.15384615384616) internal successors, (4606), 26 states have internal predecessors, (4606), 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-29 19:43:50,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 636.0) internal successors, (17172), 27 states have internal predecessors, (17172), 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-29 19:43:50,581 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 636.0) internal successors, (17172), 27 states have internal predecessors, (17172), 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-29 19:43:50,581 INFO L175 Difference]: Start difference. First operand has 220 places, 289 transitions, 3483 flow. Second operand 26 states and 4606 transitions. [2023-08-29 19:43:50,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 513 transitions, 7878 flow [2023-08-29 19:43:50,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 513 transitions, 7112 flow, removed 343 selfloop flow, removed 12 redundant places. [2023-08-29 19:43:50,745 INFO L231 Difference]: Finished difference. Result has 239 places, 328 transitions, 3764 flow [2023-08-29 19:43:50,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3764, PETRI_PLACES=239, PETRI_TRANSITIONS=328} [2023-08-29 19:43:50,746 INFO L281 CegarLoopForPetriNet]: 106 programPoint places, 133 predicate places. [2023-08-29 19:43:50,746 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 328 transitions, 3764 flow [2023-08-29 19:43:50,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 167.66666666666666) internal successors, (9054), 54 states have internal predecessors, (9054), 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-29 19:43:50,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:43:50,748 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 19:43:50,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:43:50,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-29 19:43:50,958 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-08-29 19:43:50,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:43:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1446876544, now seen corresponding path program 1 times [2023-08-29 19:43:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:43:50,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082053743] [2023-08-29 19:43:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:43:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:43:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15