./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.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/goblint-regression/28-race_reach_74-tricky_address1_racefree.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 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --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 21:51:56,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:51:56,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:51:56,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:51:56,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:51:56,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:51:56,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:51:56,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:51:56,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:51:56,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:51:56,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:51:56,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:51:56,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:51:56,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:51:56,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:51:56,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:51:56,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:51:56,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:51:56,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:51:56,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:51:56,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:51:56,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:51:56,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:51:56,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:51:56,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:51:56,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:51:56,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:51:56,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:51:56,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:51:56,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:51:56,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:51:56,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:51:56,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:51:56,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:51:56,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:51:56,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:51:56,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:51:56,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:51:56,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:51:56,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:51:56,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:51:56,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 21:51:56,293 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:51:56,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:51:56,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:51:56,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:51:56,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:51:56,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:51:56,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:51:56,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:51:56,296 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:51:56,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:51:56,297 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:51:56,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:51:56,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:51:56,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:51:56,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:51:56,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:51:56,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:51:56,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:51:56,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:51:56,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:51:56,299 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:51:56,299 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:51:56,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:51:56,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:51:56,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:51:56,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:51:56,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:51:56,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:51:56,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:51:56,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:51:56,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:51:56,301 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:51:56,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:51:56,302 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:51:56,302 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 -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 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 21:51:56,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:51:56,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:51:56,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:51:56,637 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:51:56,638 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:51:56,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-29 21:51:57,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:51:58,097 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:51:58,097 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-29 21:51:58,110 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cecc88d1/9497dd6f2aee4a37ba8eb62ada552660/FLAGb16dd7aed [2023-08-29 21:51:58,127 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cecc88d1/9497dd6f2aee4a37ba8eb62ada552660 [2023-08-29 21:51:58,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:51:58,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:51:58,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:51:58,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:51:58,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:51:58,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268b2753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58, skipping insertion in model container [2023-08-29 21:51:58,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:51:58,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:51:58,567 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-29 21:51:58,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:51:58,632 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:51:58,666 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2023-08-29 21:51:58,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:51:58,763 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:51:58,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58 WrapperNode [2023-08-29 21:51:58,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:51:58,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:51:58,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:51:58,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:51:58,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,847 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-29 21:51:58,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:51:58,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:51:58,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:51:58,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:51:58,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:51:58,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:51:58,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:51:58,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:51:58,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (1/1) ... [2023-08-29 21:51:58,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:51:58,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:51:58,930 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 21:51:58,932 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 21:51:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:51:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:51:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:51:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:51:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:51:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:51:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 21:51:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 21:51:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:51:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:51:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:51:58,958 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 21:51:59,149 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:51:59,151 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:51:59,487 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:51:59,495 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:51:59,499 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-29 21:51:59,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:51:59 BoogieIcfgContainer [2023-08-29 21:51:59,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:51:59,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:51:59,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:51:59,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:51:59,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:51:58" (1/3) ... [2023-08-29 21:51:59,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a05a778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:51:59, skipping insertion in model container [2023-08-29 21:51:59,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:51:58" (2/3) ... [2023-08-29 21:51:59,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a05a778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:51:59, skipping insertion in model container [2023-08-29 21:51:59,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:51:59" (3/3) ... [2023-08-29 21:51:59,511 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-29 21:51:59,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:51:59,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-08-29 21:51:59,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:51:59,633 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:51:59,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,801 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:51:59,801 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:51:59,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:51:59,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,825 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:51:59,841 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,843 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:51:59,914 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:51:59,915 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:51:59,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:51:59,927 INFO L119 LiptonReduction]: Number of co-enabled transitions 14508 [2023-08-29 21:52:03,812 INFO L134 LiptonReduction]: Checked pairs total: 29354 [2023-08-29 21:52:03,812 INFO L136 LiptonReduction]: Total number of compositions: 201 [2023-08-29 21:52:03,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:52:03,830 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;@77742a2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:52:03,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-08-29 21:52:03,834 INFO L130 PetriNetUnfolder]: 1/5 cut-off events. [2023-08-29 21:52:03,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:03,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:03,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:52:03,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:03,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 862756, now seen corresponding path program 1 times [2023-08-29 21:52:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365865003] [2023-08-29 21:52:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:04,092 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 21:52:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365865003] [2023-08-29 21:52:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365865003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102273165] [2023-08-29 21:52:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:04,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:04,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:04,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 419 [2023-08-29 21:52:04,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:04,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:04,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 419 [2023-08-29 21:52:04,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:04,437 INFO L130 PetriNetUnfolder]: 621/1407 cut-off events. [2023-08-29 21:52:04,437 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:52:04,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 1407 events. 621/1407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9184 event pairs, 570 based on Foata normal form. 104/1008 useless extension candidates. Maximal degree in co-relation 2555. Up to 1225 conditions per place. [2023-08-29 21:52:04,445 INFO L137 encePairwiseOnDemand]: 389/419 looper letters, 54 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-29 21:52:04,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 254 flow [2023-08-29 21:52:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2023-08-29 21:52:04,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035799522673031 [2023-08-29 21:52:04,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2023-08-29 21:52:04,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2023-08-29 21:52:04,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:04,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2023-08-29 21:52:04,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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 21:52:04,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:04,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:04,476 INFO L175 Difference]: Start difference. First operand has 71 places, 93 transitions, 194 flow. Second operand 3 states and 633 transitions. [2023-08-29 21:52:04,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 254 flow [2023-08-29 21:52:04,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:52:04,482 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 152 flow [2023-08-29 21:52:04,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-29 21:52:04,487 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2023-08-29 21:52:04,488 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 152 flow [2023-08-29 21:52:04,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:04,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:04,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:52:04,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:52:04,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:04,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash 26729995, now seen corresponding path program 1 times [2023-08-29 21:52:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955381401] [2023-08-29 21:52:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:04,555 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 21:52:04,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955381401] [2023-08-29 21:52:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955381401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402944992] [2023-08-29 21:52:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:04,560 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 21:52:04,594 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 21:52:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:04,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:52:04,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:04,721 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 21:52:04,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:04,734 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 21:52:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402944992] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:04,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:52:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675329192] [2023-08-29 21:52:04,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:04,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:52:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:52:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:52:04,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:52:04,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 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 21:52:04,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:04,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:52:04,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:05,075 INFO L130 PetriNetUnfolder]: 621/1410 cut-off events. [2023-08-29 21:52:05,075 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:52:05,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 1410 events. 621/1410 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9196 event pairs, 570 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 2644. Up to 1225 conditions per place. [2023-08-29 21:52:05,082 INFO L137 encePairwiseOnDemand]: 416/419 looper letters, 54 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-29 21:52:05,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 282 flow [2023-08-29 21:52:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:52:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:52:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1154 transitions. [2023-08-29 21:52:05,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590294351630867 [2023-08-29 21:52:05,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1154 transitions. [2023-08-29 21:52:05,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1154 transitions. [2023-08-29 21:52:05,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:05,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1154 transitions. [2023-08-29 21:52:05,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 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 21:52:05,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 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 21:52:05,098 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 419.0) internal successors, (2933), 7 states have internal predecessors, (2933), 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 21:52:05,098 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 152 flow. Second operand 6 states and 1154 transitions. [2023-08-29 21:52:05,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 282 flow [2023-08-29 21:52:05,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 278 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:05,102 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 184 flow [2023-08-29 21:52:05,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-29 21:52:05,104 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-08-29 21:52:05,104 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 184 flow [2023-08-29 21:52:05,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 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 21:52:05,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:05,105 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:52:05,116 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 21:52:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:05,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:05,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1728936806, now seen corresponding path program 2 times [2023-08-29 21:52:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806694036] [2023-08-29 21:52:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:52:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806694036] [2023-08-29 21:52:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806694036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:05,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902610540] [2023-08-29 21:52:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:05,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 419 [2023-08-29 21:52:05,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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 21:52:05,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:05,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 419 [2023-08-29 21:52:05,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:05,709 INFO L130 PetriNetUnfolder]: 579/1314 cut-off events. [2023-08-29 21:52:05,709 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 21:52:05,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1314 events. 579/1314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8505 event pairs, 494 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 2459. Up to 1062 conditions per place. [2023-08-29 21:52:05,716 INFO L137 encePairwiseOnDemand]: 414/419 looper letters, 73 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-29 21:52:05,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 370 flow [2023-08-29 21:52:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-29 21:52:05,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48607796340493237 [2023-08-29 21:52:05,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-29 21:52:05,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-29 21:52:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:05,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-29 21:52:05,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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 21:52:05,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:05,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:05,725 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 184 flow. Second operand 3 states and 611 transitions. [2023-08-29 21:52:05,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 370 flow [2023-08-29 21:52:05,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 356 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:05,730 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 172 flow [2023-08-29 21:52:05,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2023-08-29 21:52:05,733 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-29 21:52:05,733 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 172 flow [2023-08-29 21:52:05,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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 21:52:05,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:05,734 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:52:05,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 21:52:05,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:05,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1728936804, now seen corresponding path program 1 times [2023-08-29 21:52:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795033851] [2023-08-29 21:52:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:05,872 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 21:52:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795033851] [2023-08-29 21:52:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795033851] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686707891] [2023-08-29 21:52:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:05,875 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 21:52:05,878 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 21:52:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:05,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:52:05,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:05,959 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 21:52:05,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:06,011 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 21:52:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686707891] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:06,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:52:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495195100] [2023-08-29 21:52:06,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:06,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:52:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:52:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:52:06,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:52:06,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 183.15384615384616) internal successors, (2381), 13 states have internal predecessors, (2381), 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 21:52:06,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:06,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:52:06,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:06,280 INFO L130 PetriNetUnfolder]: 581/1326 cut-off events. [2023-08-29 21:52:06,280 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 21:52:06,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 1326 events. 581/1326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8510 event pairs, 532 based on Foata normal form. 6/906 useless extension candidates. Maximal degree in co-relation 2508. Up to 1145 conditions per place. [2023-08-29 21:52:06,286 INFO L137 encePairwiseOnDemand]: 416/419 looper letters, 52 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-08-29 21:52:06,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 334 flow [2023-08-29 21:52:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:52:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:52:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2253 transitions. [2023-08-29 21:52:06,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448090692124105 [2023-08-29 21:52:06,292 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2253 transitions. [2023-08-29 21:52:06,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2253 transitions. [2023-08-29 21:52:06,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:06,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2253 transitions. [2023-08-29 21:52:06,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.75) internal successors, (2253), 12 states have internal predecessors, (2253), 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 21:52:06,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 419.0) internal successors, (5447), 13 states have internal predecessors, (5447), 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 21:52:06,310 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 419.0) internal successors, (5447), 13 states have internal predecessors, (5447), 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 21:52:06,310 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 172 flow. Second operand 12 states and 2253 transitions. [2023-08-29 21:52:06,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 334 flow [2023-08-29 21:52:06,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:52:06,316 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 250 flow [2023-08-29 21:52:06,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2023-08-29 21:52:06,318 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2023-08-29 21:52:06,318 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 250 flow [2023-08-29 21:52:06,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.15384615384616) internal successors, (2381), 13 states have internal predecessors, (2381), 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 21:52:06,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:06,319 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-29 21:52:06,333 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 21:52:06,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-29 21:52:06,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:06,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash 316868932, now seen corresponding path program 2 times [2023-08-29 21:52:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:06,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127633091] [2023-08-29 21:52:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:06,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127633091] [2023-08-29 21:52:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127633091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070118688] [2023-08-29 21:52:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:06,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:06,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 419 [2023-08-29 21:52:06,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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 21:52:06,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:06,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 419 [2023-08-29 21:52:06,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:06,912 INFO L130 PetriNetUnfolder]: 554/1219 cut-off events. [2023-08-29 21:52:06,912 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2023-08-29 21:52:06,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 1219 events. 554/1219 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8104 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 2360. Up to 1111 conditions per place. [2023-08-29 21:52:06,920 INFO L137 encePairwiseOnDemand]: 415/419 looper letters, 81 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-29 21:52:06,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 456 flow [2023-08-29 21:52:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2023-08-29 21:52:06,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49403341288782815 [2023-08-29 21:52:06,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 621 transitions. [2023-08-29 21:52:06,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 621 transitions. [2023-08-29 21:52:06,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:06,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 621 transitions. [2023-08-29 21:52:06,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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 21:52:06,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:06,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 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 21:52:06,927 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 250 flow. Second operand 3 states and 621 transitions. [2023-08-29 21:52:06,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 456 flow [2023-08-29 21:52:06,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 94 transitions, 408 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:52:06,933 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 212 flow [2023-08-29 21:52:06,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2023-08-29 21:52:06,936 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 16 predicate places. [2023-08-29 21:52:06,936 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 212 flow [2023-08-29 21:52:06,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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 21:52:06,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:06,937 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 21:52:06,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:06,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -495094452, now seen corresponding path program 1 times [2023-08-29 21:52:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309758777] [2023-08-29 21:52:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309758777] [2023-08-29 21:52:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309758777] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615513014] [2023-08-29 21:52:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:07,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:07,089 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 21:52:07,118 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 21:52:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:07,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 21:52:07,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:07,236 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 6 treesize of output 5 [2023-08-29 21:52:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:07,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615513014] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:07,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-29 21:52:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013939879] [2023-08-29 21:52:07,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 21:52:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 21:52:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:52:07,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 419 [2023-08-29 21:52:07,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 180.125) internal successors, (1441), 8 states have internal predecessors, (1441), 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 21:52:07,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:07,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 419 [2023-08-29 21:52:07,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:07,746 INFO L130 PetriNetUnfolder]: 42/134 cut-off events. [2023-08-29 21:52:07,746 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 21:52:07,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 134 events. 42/134 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 444 event pairs, 15 based on Foata normal form. 20/133 useless extension candidates. Maximal degree in co-relation 280. Up to 78 conditions per place. [2023-08-29 21:52:07,747 INFO L137 encePairwiseOnDemand]: 415/419 looper letters, 43 selfloop transitions, 2 changer transitions 11/63 dead transitions. [2023-08-29 21:52:07,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 293 flow [2023-08-29 21:52:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:52:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:52:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-08-29 21:52:07,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528639618138425 [2023-08-29 21:52:07,749 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-08-29 21:52:07,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-08-29 21:52:07,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:07,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-08-29 21:52:07,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 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 21:52:07,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 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 21:52:07,765 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 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 21:52:07,765 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 212 flow. Second operand 4 states and 759 transitions. [2023-08-29 21:52:07,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 293 flow [2023-08-29 21:52:07,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 287 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:52:07,767 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 129 flow [2023-08-29 21:52:07,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-29 21:52:07,768 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -13 predicate places. [2023-08-29 21:52:07,768 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 129 flow [2023-08-29 21:52:07,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.125) internal successors, (1441), 8 states have internal predecessors, (1441), 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 21:52:07,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:07,769 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:07,781 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 21:52:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:07,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:07,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1831967456, now seen corresponding path program 1 times [2023-08-29 21:52:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348712597] [2023-08-29 21:52:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348712597] [2023-08-29 21:52:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348712597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:08,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:52:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145125489] [2023-08-29 21:52:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:08,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:52:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:52:08,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:52:08,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 419 [2023-08-29 21:52:08,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 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 21:52:08,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:08,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 419 [2023-08-29 21:52:08,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:08,467 INFO L130 PetriNetUnfolder]: 23/91 cut-off events. [2023-08-29 21:52:08,467 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-29 21:52:08,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 91 events. 23/91 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 0 based on Foata normal form. 3/82 useless extension candidates. Maximal degree in co-relation 165. Up to 55 conditions per place. [2023-08-29 21:52:08,468 INFO L137 encePairwiseOnDemand]: 413/419 looper letters, 26 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-29 21:52:08,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 36 transitions, 187 flow [2023-08-29 21:52:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:52:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:52:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2023-08-29 21:52:08,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40190930787589496 [2023-08-29 21:52:08,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2023-08-29 21:52:08,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2023-08-29 21:52:08,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:08,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2023-08-29 21:52:08,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 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 21:52:08,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:08,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:08,477 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 129 flow. Second operand 5 states and 842 transitions. [2023-08-29 21:52:08,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 36 transitions, 187 flow [2023-08-29 21:52:08,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 36 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:52:08,479 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 126 flow [2023-08-29 21:52:08,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-29 21:52:08,480 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2023-08-29 21:52:08,480 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 126 flow [2023-08-29 21:52:08,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 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 21:52:08,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:08,481 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:52:08,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:08,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 956412163, now seen corresponding path program 1 times [2023-08-29 21:52:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599818013] [2023-08-29 21:52:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:08,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599818013] [2023-08-29 21:52:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599818013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:52:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725254307] [2023-08-29 21:52:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:08,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:52:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:52:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:52:08,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 419 [2023-08-29 21:52:08,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 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 21:52:08,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:08,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 419 [2023-08-29 21:52:08,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:08,805 INFO L130 PetriNetUnfolder]: 21/74 cut-off events. [2023-08-29 21:52:08,805 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 21:52:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 74 events. 21/74 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 0 based on Foata normal form. 3/74 useless extension candidates. Maximal degree in co-relation 145. Up to 50 conditions per place. [2023-08-29 21:52:08,806 INFO L137 encePairwiseOnDemand]: 412/419 looper letters, 19 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2023-08-29 21:52:08,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 31 transitions, 177 flow [2023-08-29 21:52:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:52:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:52:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 655 transitions. [2023-08-29 21:52:08,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39081145584725535 [2023-08-29 21:52:08,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 655 transitions. [2023-08-29 21:52:08,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 655 transitions. [2023-08-29 21:52:08,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:08,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 655 transitions. [2023-08-29 21:52:08,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 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 21:52:08,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 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 21:52:08,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 419.0) internal successors, (2095), 5 states have internal predecessors, (2095), 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 21:52:08,813 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 126 flow. Second operand 4 states and 655 transitions. [2023-08-29 21:52:08,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 31 transitions, 177 flow [2023-08-29 21:52:08,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 31 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:52:08,815 INFO L231 Difference]: Finished difference. Result has 47 places, 21 transitions, 99 flow [2023-08-29 21:52:08,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=47, PETRI_TRANSITIONS=21} [2023-08-29 21:52:08,816 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-08-29 21:52:08,816 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 21 transitions, 99 flow [2023-08-29 21:52:08,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 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 21:52:08,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:08,817 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:08,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:52:08,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:08,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash 956412340, now seen corresponding path program 1 times [2023-08-29 21:52:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761579035] [2023-08-29 21:52:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:09,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761579035] [2023-08-29 21:52:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761579035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:52:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944062441] [2023-08-29 21:52:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:09,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:52:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:52:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:52:09,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 419 [2023-08-29 21:52:09,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 21 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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 21:52:09,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:09,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 419 [2023-08-29 21:52:09,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:09,283 INFO L130 PetriNetUnfolder]: 4/35 cut-off events. [2023-08-29 21:52:09,283 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 21:52:09,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 35 events. 4/35 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 3/38 useless extension candidates. Maximal degree in co-relation 64. Up to 12 conditions per place. [2023-08-29 21:52:09,283 INFO L137 encePairwiseOnDemand]: 414/419 looper letters, 18 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-08-29 21:52:09,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 24 transitions, 150 flow [2023-08-29 21:52:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:52:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:52:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2023-08-29 21:52:09,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071599045346062 [2023-08-29 21:52:09,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2023-08-29 21:52:09,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2023-08-29 21:52:09,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:09,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2023-08-29 21:52:09,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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 21:52:09,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:09,291 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:09,292 INFO L175 Difference]: Start difference. First operand has 47 places, 21 transitions, 99 flow. Second operand 5 states and 853 transitions. [2023-08-29 21:52:09,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 24 transitions, 150 flow [2023-08-29 21:52:09,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 24 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:52:09,293 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 112 flow [2023-08-29 21:52:09,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2023-08-29 21:52:09,294 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -29 predicate places. [2023-08-29 21:52:09,294 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 112 flow [2023-08-29 21:52:09,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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 21:52:09,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:09,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:09,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 21:52:09,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 21:52:09,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash -700169998, now seen corresponding path program 1 times [2023-08-29 21:52:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:09,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317072722] [2023-08-29 21:52:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317072722] [2023-08-29 21:52:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317072722] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791859618] [2023-08-29 21:52:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:09,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:09,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:09,495 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 21:52:09,523 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 21:52:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:09,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:52:09,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:09,612 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 7 treesize of output 6 [2023-08-29 21:52:09,688 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:52:09,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:52:09,712 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 13 treesize of output 15 [2023-08-29 21:52:09,775 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 13 treesize of output 15 [2023-08-29 21:52:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:09,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:15,845 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 21:52:15,873 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 21:52:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:52:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791859618] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:16,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:16,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-29 21:52:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628424717] [2023-08-29 21:52:16,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:16,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:52:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:52:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=5, NotChecked=38, Total=156 [2023-08-29 21:52:16,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 419 [2023-08-29 21:52:16,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 22 transitions, 112 flow. Second operand has 13 states, 13 states have (on average 125.15384615384616) internal successors, (1627), 13 states have internal predecessors, (1627), 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 21:52:16,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:16,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 419 [2023-08-29 21:52:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:24,082 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:52:26,092 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 21:52:28,096 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 21:52:30,097 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 21:52:32,104 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 21:52:34,108 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 21:52:38,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:52:38,162 INFO L130 PetriNetUnfolder]: 4/34 cut-off events. [2023-08-29 21:52:38,162 INFO L131 PetriNetUnfolder]: For 63/64 co-relation queries the response was YES. [2023-08-29 21:52:38,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 34 events. 4/34 cut-off events. For 63/64 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 1 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2023-08-29 21:52:38,163 INFO L137 encePairwiseOnDemand]: 415/419 looper letters, 0 selfloop transitions, 0 changer transitions 22/22 dead transitions. [2023-08-29 21:52:38,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 22 transitions, 151 flow [2023-08-29 21:52:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:52:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:52:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-29 21:52:38,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29880668257756565 [2023-08-29 21:52:38,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-29 21:52:38,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-29 21:52:38,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:38,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-29 21:52:38,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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 21:52:38,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:38,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 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 21:52:38,171 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 112 flow. Second operand 5 states and 626 transitions. [2023-08-29 21:52:38,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 22 transitions, 151 flow [2023-08-29 21:52:38,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 22 transitions, 145 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:52:38,173 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2023-08-29 21:52:38,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2023-08-29 21:52:38,174 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -29 predicate places. [2023-08-29 21:52:38,174 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2023-08-29 21:52:38,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 125.15384615384616) internal successors, (1627), 13 states have internal predecessors, (1627), 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 21:52:38,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2023-08-29 21:52:38,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (30 of 38 remaining) [2023-08-29 21:52:38,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 38 remaining) [2023-08-29 21:52:38,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-08-29 21:52:38,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-08-29 21:52:38,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-08-29 21:52:38,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-08-29 21:52:38,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-08-29 21:52:38,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-08-29 21:52:38,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-08-29 21:52:38,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-08-29 21:52:38,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-08-29 21:52:38,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-08-29 21:52:38,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-08-29 21:52:38,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-08-29 21:52:38,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-08-29 21:52:38,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-08-29 21:52:38,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (7 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (3 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2023-08-29 21:52:38,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2023-08-29 21:52:38,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 38 remaining) [2023-08-29 21:52:38,193 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 21:52:38,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:38,391 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:38,393 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 21:52:38,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:52:38,422 INFO L130 PetriNetUnfolder]: 45/305 cut-off events. [2023-08-29 21:52:38,422 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-29 21:52:38,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 305 events. 45/305 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1160 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:52:38,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 218 transitions, 444 flow [2023-08-29 21:52:38,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 213 transitions, 431 flow [2023-08-29 21:52:38,426 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:52:38,426 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 213 transitions, 431 flow [2023-08-29 21:52:38,426 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 213 transitions, 431 flow [2023-08-29 21:52:38,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 213 transitions, 431 flow [2023-08-29 21:52:38,449 INFO L130 PetriNetUnfolder]: 44/300 cut-off events. [2023-08-29 21:52:38,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:38,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 44/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1124 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 170. Up to 8 conditions per place. [2023-08-29 21:52:38,456 INFO L119 LiptonReduction]: Number of co-enabled transitions 14508 [2023-08-29 21:52:41,725 INFO L134 LiptonReduction]: Checked pairs total: 25872 [2023-08-29 21:52:41,726 INFO L136 LiptonReduction]: Total number of compositions: 193 [2023-08-29 21:52:41,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 21:52:41,728 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;@77742a2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:52:41,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 21:52:41,733 INFO L130 PetriNetUnfolder]: 11/58 cut-off events. [2023-08-29 21:52:41,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:41,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:41,734 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-29 21:52:41,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:52:41,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1477774259, now seen corresponding path program 1 times [2023-08-29 21:52:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:41,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997824363] [2023-08-29 21:52:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997824363] [2023-08-29 21:52:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997824363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040610623] [2023-08-29 21:52:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:41,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:41,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 411 [2023-08-29 21:52:41,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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 21:52:41,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:41,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 411 [2023-08-29 21:52:41,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:41,952 INFO L130 PetriNetUnfolder]: 621/1396 cut-off events. [2023-08-29 21:52:41,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:41,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 1396 events. 621/1396 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9134 event pairs, 570 based on Foata normal form. 104/996 useless extension candidates. Maximal degree in co-relation 2546. Up to 1223 conditions per place. [2023-08-29 21:52:41,955 INFO L137 encePairwiseOnDemand]: 381/411 looper letters, 27 selfloop transitions, 2 changer transitions 28/65 dead transitions. [2023-08-29 21:52:41,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 243 flow [2023-08-29 21:52:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-29 21:52:41,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117599351175993 [2023-08-29 21:52:41,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-29 21:52:41,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-29 21:52:41,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:41,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-29 21:52:41,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 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 21:52:41,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 411.0) internal successors, (1644), 4 states have internal predecessors, (1644), 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 21:52:41,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 411.0) internal successors, (1644), 4 states have internal predecessors, (1644), 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 21:52:41,975 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 187 flow. Second operand 3 states and 631 transitions. [2023-08-29 21:52:41,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 243 flow [2023-08-29 21:52:41,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:52:41,977 INFO L231 Difference]: Finished difference. Result has 67 places, 37 transitions, 89 flow [2023-08-29 21:52:41,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=67, PETRI_TRANSITIONS=37} [2023-08-29 21:52:41,977 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2023-08-29 21:52:41,979 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 37 transitions, 89 flow [2023-08-29 21:52:41,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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 21:52:41,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:41,979 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 21:52:41,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:52:41,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 420532853, now seen corresponding path program 1 times [2023-08-29 21:52:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633708918] [2023-08-29 21:52:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633708918] [2023-08-29 21:52:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633708918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673025217] [2023-08-29 21:52:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:42,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:42,017 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 21:52:42,021 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 21:52:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:42,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:52:42,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673025217] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:42,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:52:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059536485] [2023-08-29 21:52:42,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:52:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:52:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:52:42,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 411 [2023-08-29 21:52:42,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 37 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 183.57142857142858) internal successors, (1285), 7 states have internal predecessors, (1285), 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 21:52:42,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:42,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 411 [2023-08-29 21:52:42,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:42,198 INFO L130 PetriNetUnfolder]: 102/270 cut-off events. [2023-08-29 21:52:42,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:42,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 270 events. 102/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1159 event pairs, 95 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 501. Up to 223 conditions per place. [2023-08-29 21:52:42,199 INFO L137 encePairwiseOnDemand]: 408/411 looper letters, 27 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-29 21:52:42,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 165 flow [2023-08-29 21:52:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:52:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:52:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1127 transitions. [2023-08-29 21:52:42,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570154095701541 [2023-08-29 21:52:42,203 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1127 transitions. [2023-08-29 21:52:42,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1127 transitions. [2023-08-29 21:52:42,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:42,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1127 transitions. [2023-08-29 21:52:42,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 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 21:52:42,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 411.0) internal successors, (2877), 7 states have internal predecessors, (2877), 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 21:52:42,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 411.0) internal successors, (2877), 7 states have internal predecessors, (2877), 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 21:52:42,209 INFO L175 Difference]: Start difference. First operand has 67 places, 37 transitions, 89 flow. Second operand 6 states and 1127 transitions. [2023-08-29 21:52:42,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 165 flow [2023-08-29 21:52:42,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 161 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:42,211 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 121 flow [2023-08-29 21:52:42,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 21:52:42,212 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2023-08-29 21:52:42,212 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 121 flow [2023-08-29 21:52:42,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.57142857142858) internal successors, (1285), 7 states have internal predecessors, (1285), 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 21:52:42,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:42,214 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-29 21:52:42,223 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 21:52:42,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-29 21:52:42,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:52:42,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1674466253, now seen corresponding path program 2 times [2023-08-29 21:52:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639510688] [2023-08-29 21:52:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:42,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639510688] [2023-08-29 21:52:42,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639510688] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:42,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777751938] [2023-08-29 21:52:42,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:52:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:42,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:42,487 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 21:52:42,489 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 21:52:42,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:52:42,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:52:42,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:52:42,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 21:52:42,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777751938] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:42,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:42,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:52:42,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135312185] [2023-08-29 21:52:42,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:42,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:52:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:42,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:52:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:52:42,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 411 [2023-08-29 21:52:42,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 121 flow. Second operand has 13 states, 13 states have (on average 183.30769230769232) internal successors, (2383), 13 states have internal predecessors, (2383), 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 21:52:42,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:42,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 411 [2023-08-29 21:52:42,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:42,798 INFO L130 PetriNetUnfolder]: 102/276 cut-off events. [2023-08-29 21:52:42,798 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 21:52:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 276 events. 102/276 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1159 event pairs, 95 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 492. Up to 223 conditions per place. [2023-08-29 21:52:42,799 INFO L137 encePairwiseOnDemand]: 408/411 looper letters, 27 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-29 21:52:42,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 233 flow [2023-08-29 21:52:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:52:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:52:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2228 transitions. [2023-08-29 21:52:42,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45174371451743717 [2023-08-29 21:52:42,805 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2228 transitions. [2023-08-29 21:52:42,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2228 transitions. [2023-08-29 21:52:42,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:42,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2228 transitions. [2023-08-29 21:52:42,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 185.66666666666666) internal successors, (2228), 12 states have internal predecessors, (2228), 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 21:52:42,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 411.0) internal successors, (5343), 13 states have internal predecessors, (5343), 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 21:52:42,817 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 411.0) internal successors, (5343), 13 states have internal predecessors, (5343), 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 21:52:42,818 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 121 flow. Second operand 12 states and 2228 transitions. [2023-08-29 21:52:42,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 233 flow [2023-08-29 21:52:42,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 219 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:42,819 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 191 flow [2023-08-29 21:52:42,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-29 21:52:42,820 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-08-29 21:52:42,820 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 191 flow [2023-08-29 21:52:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.30769230769232) internal successors, (2383), 13 states have internal predecessors, (2383), 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 21:52:42,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:42,821 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-29 21:52:42,832 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 21:52:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:43,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 21:52:43,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1044817139, now seen corresponding path program 3 times [2023-08-29 21:52:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506452750] [2023-08-29 21:52:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 21:52:43,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 21:52:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 21:52:43,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 21:52:43,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 21:52:43,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 21:52:43,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 21:52:43,120 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-29 21:52:43,121 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 21:52:43,122 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 21:52:43,122 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 21:52:43,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 21:52:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,221 INFO L130 PetriNetUnfolder]: 75/501 cut-off events. [2023-08-29 21:52:43,221 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 21:52:43,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 501 events. 75/501 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2292 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 307. Up to 12 conditions per place. [2023-08-29 21:52:43,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,233 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:52:43,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,234 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 298 transitions, 614 flow [2023-08-29 21:52:43,299 INFO L130 PetriNetUnfolder]: 75/501 cut-off events. [2023-08-29 21:52:43,299 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-29 21:52:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 501 events. 75/501 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2292 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 307. Up to 12 conditions per place. [2023-08-29 21:52:43,319 INFO L119 LiptonReduction]: Number of co-enabled transitions 42900 [2023-08-29 21:52:47,270 INFO L134 LiptonReduction]: Checked pairs total: 91246 [2023-08-29 21:52:47,270 INFO L136 LiptonReduction]: Total number of compositions: 274 [2023-08-29 21:52:47,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:52:47,274 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;@77742a2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:52:47,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-08-29 21:52:47,275 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2023-08-29 21:52:47,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:52:47,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:47,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:52:47,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:47,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1698028, now seen corresponding path program 1 times [2023-08-29 21:52:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038988123] [2023-08-29 21:52:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:47,316 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 21:52:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038988123] [2023-08-29 21:52:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038988123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285752945] [2023-08-29 21:52:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:47,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:47,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 572 [2023-08-29 21:52:47,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 135 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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 21:52:47,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:47,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 572 [2023-08-29 21:52:47,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:51,054 INFO L130 PetriNetUnfolder]: 28221/45403 cut-off events. [2023-08-29 21:52:51,055 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-29 21:52:51,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86992 conditions, 45403 events. 28221/45403 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 374120 event pairs, 26736 based on Foata normal form. 3624/32165 useless extension candidates. Maximal degree in co-relation 35357. Up to 41457 conditions per place. [2023-08-29 21:52:51,382 INFO L137 encePairwiseOnDemand]: 530/572 looper letters, 77 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2023-08-29 21:52:51,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 370 flow [2023-08-29 21:52:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2023-08-29 21:52:51,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502913752913753 [2023-08-29 21:52:51,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 863 transitions. [2023-08-29 21:52:51,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 863 transitions. [2023-08-29 21:52:51,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:51,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 863 transitions. [2023-08-29 21:52:51,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 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 21:52:51,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:52:51,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:52:51,394 INFO L175 Difference]: Start difference. First operand has 103 places, 135 transitions, 288 flow. Second operand 3 states and 863 transitions. [2023-08-29 21:52:51,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 370 flow [2023-08-29 21:52:51,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:52:51,399 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 222 flow [2023-08-29 21:52:51,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2023-08-29 21:52:51,400 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2023-08-29 21:52:51,400 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 222 flow [2023-08-29 21:52:51,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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 21:52:51,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:51,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:52:51,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 21:52:51,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:51,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 52616612, now seen corresponding path program 1 times [2023-08-29 21:52:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257110188] [2023-08-29 21:52:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:51,440 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 21:52:51,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257110188] [2023-08-29 21:52:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257110188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998856326] [2023-08-29 21:52:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:51,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:51,445 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 21:52:51,456 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 21:52:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:51,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:52:51,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:51,538 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 21:52:51,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:51,549 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 21:52:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998856326] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:51,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:52:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317539794] [2023-08-29 21:52:51,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:51,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:52:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:52:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:52:51,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:52:51,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 248.28571428571428) internal successors, (1738), 7 states have internal predecessors, (1738), 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 21:52:51,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:51,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:52:51,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:54,547 INFO L130 PetriNetUnfolder]: 28221/45406 cut-off events. [2023-08-29 21:52:54,547 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-29 21:52:54,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87008 conditions, 45406 events. 28221/45406 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 373934 event pairs, 26736 based on Foata normal form. 0/28544 useless extension candidates. Maximal degree in co-relation 86995. Up to 41457 conditions per place. [2023-08-29 21:52:54,835 INFO L137 encePairwiseOnDemand]: 569/572 looper letters, 77 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2023-08-29 21:52:54,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 398 flow [2023-08-29 21:52:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:52:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:52:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1567 transitions. [2023-08-29 21:52:54,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565850815850816 [2023-08-29 21:52:54,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1567 transitions. [2023-08-29 21:52:54,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1567 transitions. [2023-08-29 21:52:54,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:54,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1567 transitions. [2023-08-29 21:52:54,845 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 21:52:54,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:52:54,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:52:54,852 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 222 flow. Second operand 6 states and 1567 transitions. [2023-08-29 21:52:54,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 398 flow [2023-08-29 21:52:54,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 100 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:54,856 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 254 flow [2023-08-29 21:52:54,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2023-08-29 21:52:54,857 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 2 predicate places. [2023-08-29 21:52:54,857 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 254 flow [2023-08-29 21:52:54,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 248.28571428571428) internal successors, (1738), 7 states have internal predecessors, (1738), 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 21:52:54,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:54,858 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:52:54,868 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 21:52:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:55,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:55,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -183644373, now seen corresponding path program 2 times [2023-08-29 21:52:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448953017] [2023-08-29 21:52:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:55,123 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 21:52:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448953017] [2023-08-29 21:52:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448953017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22820213] [2023-08-29 21:52:55,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:52:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:55,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:55,126 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 21:52:55,144 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 21:52:55,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 21:52:55,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:52:55,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 21:52:55,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:55,218 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 6 treesize of output 5 [2023-08-29 21:52:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:52:55,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:52:55,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22820213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:55,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:52:55,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-29 21:52:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637645228] [2023-08-29 21:52:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:55,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:52:55,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:52:55,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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 21:52:55,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:55,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:52:55,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:57,935 INFO L130 PetriNetUnfolder]: 27810/44514 cut-off events. [2023-08-29 21:52:57,935 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-29 21:52:58,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86132 conditions, 44514 events. 27810/44514 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 366662 event pairs, 12936 based on Foata normal form. 0/28130 useless extension candidates. Maximal degree in co-relation 86097. Up to 41416 conditions per place. [2023-08-29 21:52:58,231 INFO L137 encePairwiseOnDemand]: 568/572 looper letters, 103 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2023-08-29 21:52:58,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 123 transitions, 510 flow [2023-08-29 21:52:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:52:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:52:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2023-08-29 21:52:58,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49184149184149184 [2023-08-29 21:52:58,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 844 transitions. [2023-08-29 21:52:58,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 844 transitions. [2023-08-29 21:52:58,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:58,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 844 transitions. [2023-08-29 21:52:58,237 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 21:52:58,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:52:58,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:52:58,240 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 254 flow. Second operand 3 states and 844 transitions. [2023-08-29 21:52:58,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 123 transitions, 510 flow [2023-08-29 21:52:58,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 123 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:52:58,243 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 254 flow [2023-08-29 21:52:58,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2023-08-29 21:52:58,244 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2023-08-29 21:52:58,244 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 254 flow [2023-08-29 21:52:58,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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 21:52:58,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:58,245 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:52:58,255 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 21:52:58,451 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,SelfDestructingSolverStorable16 [2023-08-29 21:52:58,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:58,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -183644372, now seen corresponding path program 1 times [2023-08-29 21:52:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937131965] [2023-08-29 21:52:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:52:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937131965] [2023-08-29 21:52:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937131965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:52:58,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:52:58,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:52:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511196334] [2023-08-29 21:52:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:52:58,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:52:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:58,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:52:58,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:52:58,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 572 [2023-08-29 21:52:58,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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 21:52:58,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:58,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 572 [2023-08-29 21:52:58,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:01,470 INFO L130 PetriNetUnfolder]: 26358/41888 cut-off events. [2023-08-29 21:53:01,470 INFO L131 PetriNetUnfolder]: For 1109/1109 co-relation queries the response was YES. [2023-08-29 21:53:01,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82135 conditions, 41888 events. 26358/41888 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 339297 event pairs, 23069 based on Foata normal form. 0/27283 useless extension candidates. Maximal degree in co-relation 82105. Up to 35764 conditions per place. [2023-08-29 21:53:01,766 INFO L137 encePairwiseOnDemand]: 567/572 looper letters, 119 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2023-08-29 21:53:01,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 576 flow [2023-08-29 21:53:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:53:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:53:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2023-08-29 21:53:01,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959207459207459 [2023-08-29 21:53:01,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2023-08-29 21:53:01,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2023-08-29 21:53:01,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:01,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2023-08-29 21:53:01,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:01,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:53:01,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 572.0) internal successors, (2288), 4 states have internal predecessors, (2288), 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 21:53:01,779 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 254 flow. Second operand 3 states and 851 transitions. [2023-08-29 21:53:01,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 576 flow [2023-08-29 21:53:01,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 140 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:01,783 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 254 flow [2023-08-29 21:53:01,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2023-08-29 21:53:01,784 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2023-08-29 21:53:01,785 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 254 flow [2023-08-29 21:53:01,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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 21:53:01,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:01,785 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 21:53:01,786 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:01,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash 276281295, now seen corresponding path program 1 times [2023-08-29 21:53:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245212928] [2023-08-29 21:53:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:01,852 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 21:53:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245212928] [2023-08-29 21:53:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245212928] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504015040] [2023-08-29 21:53:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:01,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:01,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:01,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:02,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 21:53:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:02,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:53:02,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:02,153 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 21:53:02,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:02,195 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 21:53:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504015040] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:02,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:53:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806588436] [2023-08-29 21:53:02,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:02,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:53:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:02,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:53:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:53:02,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:53:02,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 254 flow. Second operand has 13 states, 13 states have (on average 248.46153846153845) internal successors, (3230), 13 states have internal predecessors, (3230), 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 21:53:02,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:02,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:53:02,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:05,401 INFO L130 PetriNetUnfolder]: 26438/42014 cut-off events. [2023-08-29 21:53:05,401 INFO L131 PetriNetUnfolder]: For 1412/1412 co-relation queries the response was YES. [2023-08-29 21:53:05,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83271 conditions, 42014 events. 26438/42014 cut-off events. For 1412/1412 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 339004 event pairs, 24913 based on Foata normal form. 6/27939 useless extension candidates. Maximal degree in co-relation 83217. Up to 38623 conditions per place. [2023-08-29 21:53:05,634 INFO L137 encePairwiseOnDemand]: 569/572 looper letters, 76 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-08-29 21:53:05,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 105 transitions, 464 flow [2023-08-29 21:53:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:53:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:53:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3056 transitions. [2023-08-29 21:53:05,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2023-08-29 21:53:05,642 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3056 transitions. [2023-08-29 21:53:05,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3056 transitions. [2023-08-29 21:53:05,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:05,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3056 transitions. [2023-08-29 21:53:05,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 254.66666666666666) internal successors, (3056), 12 states have internal predecessors, (3056), 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 21:53:05,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 572.0) internal successors, (7436), 13 states have internal predecessors, (7436), 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 21:53:05,659 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 572.0) internal successors, (7436), 13 states have internal predecessors, (7436), 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 21:53:05,659 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 254 flow. Second operand 12 states and 3056 transitions. [2023-08-29 21:53:05,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 105 transitions, 464 flow [2023-08-29 21:53:05,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 105 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:53:05,718 INFO L231 Difference]: Finished difference. Result has 121 places, 105 transitions, 332 flow [2023-08-29 21:53:05,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=121, PETRI_TRANSITIONS=105} [2023-08-29 21:53:05,719 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 18 predicate places. [2023-08-29 21:53:05,719 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 105 transitions, 332 flow [2023-08-29 21:53:05,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 248.46153846153845) internal successors, (3230), 13 states have internal predecessors, (3230), 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 21:53:05,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:05,720 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:05,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:05,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:05,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:05,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1399438033, now seen corresponding path program 2 times [2023-08-29 21:53:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425519452] [2023-08-29 21:53:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:06,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425519452] [2023-08-29 21:53:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425519452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:06,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:06,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:53:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556188454] [2023-08-29 21:53:06,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:53:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:53:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:53:06,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 572 [2023-08-29 21:53:06,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 105 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 230.33333333333334) internal successors, (1382), 6 states have internal predecessors, (1382), 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 21:53:06,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:06,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 572 [2023-08-29 21:53:06,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:09,310 INFO L130 PetriNetUnfolder]: 20359/34156 cut-off events. [2023-08-29 21:53:09,311 INFO L131 PetriNetUnfolder]: For 994/994 co-relation queries the response was YES. [2023-08-29 21:53:09,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66258 conditions, 34156 events. 20359/34156 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 297579 event pairs, 483 based on Foata normal form. 599/24449 useless extension candidates. Maximal degree in co-relation 66180. Up to 27190 conditions per place. [2023-08-29 21:53:09,596 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 183 selfloop transitions, 8 changer transitions 0/208 dead transitions. [2023-08-29 21:53:09,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 208 transitions, 936 flow [2023-08-29 21:53:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:53:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:53:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1565 transitions. [2023-08-29 21:53:09,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.456002331002331 [2023-08-29 21:53:09,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1565 transitions. [2023-08-29 21:53:09,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1565 transitions. [2023-08-29 21:53:09,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:09,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1565 transitions. [2023-08-29 21:53:09,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 260.8333333333333) internal successors, (1565), 6 states have internal predecessors, (1565), 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 21:53:09,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:53:09,616 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:53:09,617 INFO L175 Difference]: Start difference. First operand has 121 places, 105 transitions, 332 flow. Second operand 6 states and 1565 transitions. [2023-08-29 21:53:09,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 208 transitions, 936 flow [2023-08-29 21:53:09,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 208 transitions, 888 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:53:09,835 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 294 flow [2023-08-29 21:53:09,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2023-08-29 21:53:09,835 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 12 predicate places. [2023-08-29 21:53:09,836 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 294 flow [2023-08-29 21:53:09,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.33333333333334) internal successors, (1382), 6 states have internal predecessors, (1382), 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 21:53:09,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:09,836 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:09,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 21:53:09,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:09,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1399892665, now seen corresponding path program 1 times [2023-08-29 21:53:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:09,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287298847] [2023-08-29 21:53:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:09,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287298847] [2023-08-29 21:53:09,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287298847] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:09,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419196659] [2023-08-29 21:53:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:09,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 21:53:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:10,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 21:53:10,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:10,058 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 6 treesize of output 5 [2023-08-29 21:53:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:10,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419196659] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:10,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:10,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:53:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567198835] [2023-08-29 21:53:10,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:10,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:53:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:53:10,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:53:10,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 572 [2023-08-29 21:53:10,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 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 21:53:10,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:10,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 572 [2023-08-29 21:53:10,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:12,500 INFO L130 PetriNetUnfolder]: 18370/29907 cut-off events. [2023-08-29 21:53:12,500 INFO L131 PetriNetUnfolder]: For 1450/1450 co-relation queries the response was YES. [2023-08-29 21:53:12,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60812 conditions, 29907 events. 18370/29907 cut-off events. For 1450/1450 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 244270 event pairs, 208 based on Foata normal form. 18/21698 useless extension candidates. Maximal degree in co-relation 60757. Up to 24425 conditions per place. [2023-08-29 21:53:12,729 INFO L137 encePairwiseOnDemand]: 566/572 looper letters, 170 selfloop transitions, 7 changer transitions 0/195 dead transitions. [2023-08-29 21:53:12,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 195 transitions, 836 flow [2023-08-29 21:53:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:53:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:53:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1388 transitions. [2023-08-29 21:53:12,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853146853146853 [2023-08-29 21:53:12,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1388 transitions. [2023-08-29 21:53:12,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1388 transitions. [2023-08-29 21:53:12,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:12,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1388 transitions. [2023-08-29 21:53:12,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 277.6) internal successors, (1388), 5 states have internal predecessors, (1388), 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 21:53:12,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:53:12,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:53:12,740 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 294 flow. Second operand 5 states and 1388 transitions. [2023-08-29 21:53:12,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 195 transitions, 836 flow [2023-08-29 21:53:12,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 195 transitions, 835 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:12,749 INFO L231 Difference]: Finished difference. Result has 118 places, 101 transitions, 307 flow [2023-08-29 21:53:12,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=118, PETRI_TRANSITIONS=101} [2023-08-29 21:53:12,750 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 15 predicate places. [2023-08-29 21:53:12,750 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 101 transitions, 307 flow [2023-08-29 21:53:12,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 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 21:53:12,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:12,751 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:12,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-29 21:53:12,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-29 21:53:12,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:12,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash -432908712, now seen corresponding path program 1 times [2023-08-29 21:53:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567807670] [2023-08-29 21:53:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:13,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567807670] [2023-08-29 21:53:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567807670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:13,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:53:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919226639] [2023-08-29 21:53:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:53:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:53:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:53:13,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 572 [2023-08-29 21:53:13,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 101 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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 21:53:13,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:13,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 572 [2023-08-29 21:53:13,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:16,100 INFO L130 PetriNetUnfolder]: 17881/28666 cut-off events. [2023-08-29 21:53:16,100 INFO L131 PetriNetUnfolder]: For 3972/3972 co-relation queries the response was YES. [2023-08-29 21:53:16,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59645 conditions, 28666 events. 17881/28666 cut-off events. For 3972/3972 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 223543 event pairs, 4062 based on Foata normal form. 0/22030 useless extension candidates. Maximal degree in co-relation 59589. Up to 22482 conditions per place. [2023-08-29 21:53:16,306 INFO L137 encePairwiseOnDemand]: 557/572 looper letters, 186 selfloop transitions, 12 changer transitions 0/212 dead transitions. [2023-08-29 21:53:16,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 212 transitions, 947 flow [2023-08-29 21:53:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:53:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:53:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1309 transitions. [2023-08-29 21:53:16,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576923076923077 [2023-08-29 21:53:16,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1309 transitions. [2023-08-29 21:53:16,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1309 transitions. [2023-08-29 21:53:16,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:16,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1309 transitions. [2023-08-29 21:53:16,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 261.8) internal successors, (1309), 5 states have internal predecessors, (1309), 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 21:53:16,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:53:16,315 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:53:16,315 INFO L175 Difference]: Start difference. First operand has 118 places, 101 transitions, 307 flow. Second operand 5 states and 1309 transitions. [2023-08-29 21:53:16,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 212 transitions, 947 flow [2023-08-29 21:53:16,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 212 transitions, 929 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 21:53:16,332 INFO L231 Difference]: Finished difference. Result has 122 places, 107 transitions, 377 flow [2023-08-29 21:53:16,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=122, PETRI_TRANSITIONS=107} [2023-08-29 21:53:16,332 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 19 predicate places. [2023-08-29 21:53:16,333 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 107 transitions, 377 flow [2023-08-29 21:53:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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 21:53:16,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:16,333 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:16,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 21:53:16,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:16,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -432908353, now seen corresponding path program 1 times [2023-08-29 21:53:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459236136] [2023-08-29 21:53:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459236136] [2023-08-29 21:53:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459236136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:16,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:53:16,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:53:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039419801] [2023-08-29 21:53:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:16,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:53:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:53:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:53:16,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 572 [2023-08-29 21:53:16,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 107 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 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 21:53:16,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:16,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 572 [2023-08-29 21:53:16,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:20,167 INFO L130 PetriNetUnfolder]: 23922/39589 cut-off events. [2023-08-29 21:53:20,167 INFO L131 PetriNetUnfolder]: For 11581/11999 co-relation queries the response was YES. [2023-08-29 21:53:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89241 conditions, 39589 events. 23922/39589 cut-off events. For 11581/11999 co-relation queries the response was YES. Maximal size of possible extension queue 1503. Compared 335787 event pairs, 5065 based on Foata normal form. 44/30581 useless extension candidates. Maximal degree in co-relation 89181. Up to 20685 conditions per place. [2023-08-29 21:53:20,482 INFO L137 encePairwiseOnDemand]: 558/572 looper letters, 249 selfloop transitions, 32 changer transitions 0/300 dead transitions. [2023-08-29 21:53:20,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 300 transitions, 1490 flow [2023-08-29 21:53:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:53:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:53:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1877 transitions. [2023-08-29 21:53:20,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46878121878121876 [2023-08-29 21:53:20,487 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1877 transitions. [2023-08-29 21:53:20,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1877 transitions. [2023-08-29 21:53:20,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:20,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1877 transitions. [2023-08-29 21:53:20,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 268.14285714285717) internal successors, (1877), 7 states have internal predecessors, (1877), 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 21:53:20,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:53:20,495 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:53:20,495 INFO L175 Difference]: Start difference. First operand has 122 places, 107 transitions, 377 flow. Second operand 7 states and 1877 transitions. [2023-08-29 21:53:20,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 300 transitions, 1490 flow [2023-08-29 21:53:20,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 300 transitions, 1473 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:53:20,573 INFO L231 Difference]: Finished difference. Result has 131 places, 137 transitions, 643 flow [2023-08-29 21:53:20,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=643, PETRI_PLACES=131, PETRI_TRANSITIONS=137} [2023-08-29 21:53:20,574 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 28 predicate places. [2023-08-29 21:53:20,574 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 137 transitions, 643 flow [2023-08-29 21:53:20,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 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 21:53:20,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:20,574 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:20,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 21:53:20,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:20,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2125383658, now seen corresponding path program 1 times [2023-08-29 21:53:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086312860] [2023-08-29 21:53:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:53:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:20,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086312860] [2023-08-29 21:53:20,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086312860] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:20,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980121142] [2023-08-29 21:53:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:20,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:20,877 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:20,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 21:53:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:20,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 21:53:20,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:21,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:53:21,271 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 21:53:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 21:53:21,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 21:53:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980121142] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 21:53:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 12] total 19 [2023-08-29 21:53:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081030611] [2023-08-29 21:53:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:53:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:23,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:53:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-08-29 21:53:24,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 572 [2023-08-29 21:53:24,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 137 transitions, 643 flow. Second operand has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 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 21:53:24,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:24,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 572 [2023-08-29 21:53:24,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:27,559 INFO L130 PetriNetUnfolder]: 21629/35983 cut-off events. [2023-08-29 21:53:27,559 INFO L131 PetriNetUnfolder]: For 22505/22930 co-relation queries the response was YES. [2023-08-29 21:53:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90411 conditions, 35983 events. 21629/35983 cut-off events. For 22505/22930 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 299402 event pairs, 4162 based on Foata normal form. 1176/31155 useless extension candidates. Maximal degree in co-relation 90345. Up to 27034 conditions per place. [2023-08-29 21:53:27,870 INFO L137 encePairwiseOnDemand]: 565/572 looper letters, 206 selfloop transitions, 23 changer transitions 0/247 dead transitions. [2023-08-29 21:53:27,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 247 transitions, 1593 flow [2023-08-29 21:53:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:53:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:53:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1554 transitions. [2023-08-29 21:53:27,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527972027972028 [2023-08-29 21:53:27,872 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1554 transitions. [2023-08-29 21:53:27,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1554 transitions. [2023-08-29 21:53:27,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:27,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1554 transitions. [2023-08-29 21:53:27,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 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 21:53:27,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:53:27,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 572.0) internal successors, (4004), 7 states have internal predecessors, (4004), 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 21:53:27,878 INFO L175 Difference]: Start difference. First operand has 131 places, 137 transitions, 643 flow. Second operand 6 states and 1554 transitions. [2023-08-29 21:53:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 247 transitions, 1593 flow [2023-08-29 21:53:27,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 247 transitions, 1593 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:53:27,933 INFO L231 Difference]: Finished difference. Result has 133 places, 145 transitions, 787 flow [2023-08-29 21:53:27,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=133, PETRI_TRANSITIONS=145} [2023-08-29 21:53:27,934 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 30 predicate places. [2023-08-29 21:53:27,937 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 145 transitions, 787 flow [2023-08-29 21:53:27,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 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 21:53:27,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:27,937 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:27,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-29 21:53:28,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:28,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2051971743, now seen corresponding path program 1 times [2023-08-29 21:53:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714318806] [2023-08-29 21:53:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714318806] [2023-08-29 21:53:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714318806] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932074531] [2023-08-29 21:53:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:28,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:28,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:28,309 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:28,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 21:53:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:28,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:53:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:28,419 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 7 treesize of output 6 [2023-08-29 21:53:28,476 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:53:28,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:53:28,499 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 13 treesize of output 15 [2023-08-29 21:53:28,552 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 13 treesize of output 15 [2023-08-29 21:53:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:28,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:32,591 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_701) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 21:53:34,605 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_701) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 21:53:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:53:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932074531] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:34,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-29 21:53:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398491466] [2023-08-29 21:53:34,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:34,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:53:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:53:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=81, Unknown=4, NotChecked=38, Total=156 [2023-08-29 21:53:34,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 572 [2023-08-29 21:53:34,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 145 transitions, 787 flow. Second operand has 13 states, 13 states have (on average 179.3846153846154) internal successors, (2332), 13 states have internal predecessors, (2332), 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 21:53:34,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:34,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 572 [2023-08-29 21:53:34,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:38,554 INFO L130 PetriNetUnfolder]: 23185/37872 cut-off events. [2023-08-29 21:53:38,554 INFO L131 PetriNetUnfolder]: For 25881/26015 co-relation queries the response was YES. [2023-08-29 21:53:38,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97448 conditions, 37872 events. 23185/37872 cut-off events. For 25881/26015 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 310877 event pairs, 5813 based on Foata normal form. 437/31420 useless extension candidates. Maximal degree in co-relation 97380. Up to 20940 conditions per place. [2023-08-29 21:53:38,910 INFO L137 encePairwiseOnDemand]: 556/572 looper letters, 242 selfloop transitions, 38 changer transitions 0/293 dead transitions. [2023-08-29 21:53:38,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 293 transitions, 1777 flow [2023-08-29 21:53:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:53:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:53:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1476 transitions. [2023-08-29 21:53:38,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36863136863136864 [2023-08-29 21:53:38,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1476 transitions. [2023-08-29 21:53:38,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1476 transitions. [2023-08-29 21:53:38,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:38,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1476 transitions. [2023-08-29 21:53:38,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 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 21:53:38,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:53:38,920 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:53:38,920 INFO L175 Difference]: Start difference. First operand has 133 places, 145 transitions, 787 flow. Second operand 7 states and 1476 transitions. [2023-08-29 21:53:38,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 293 transitions, 1777 flow [2023-08-29 21:53:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 293 transitions, 1776 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:53:39,054 INFO L231 Difference]: Finished difference. Result has 140 places, 148 transitions, 917 flow [2023-08-29 21:53:39,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=917, PETRI_PLACES=140, PETRI_TRANSITIONS=148} [2023-08-29 21:53:39,055 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 37 predicate places. [2023-08-29 21:53:39,055 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 148 transitions, 917 flow [2023-08-29 21:53:39,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 179.3846153846154) internal successors, (2332), 13 states have internal predecessors, (2332), 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 21:53:39,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:39,056 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:39,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:39,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-29 21:53:39,266 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:39,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1462387428, now seen corresponding path program 1 times [2023-08-29 21:53:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:39,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404935123] [2023-08-29 21:53:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404935123] [2023-08-29 21:53:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404935123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707975022] [2023-08-29 21:53:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:39,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:39,416 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:39,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-29 21:53:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:39,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 21:53:39,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:39,596 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 21:53:39,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 21:53:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-29 21:53:39,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:53:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707975022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:53:39,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:53:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-29 21:53:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751784303] [2023-08-29 21:53:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:53:39,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:53:39,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:53:39,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:53:39,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 572 [2023-08-29 21:53:39,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 148 transitions, 917 flow. Second operand has 4 states, 4 states have (on average 241.75) internal successors, (967), 4 states have internal predecessors, (967), 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 21:53:39,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:39,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 572 [2023-08-29 21:53:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:42,484 INFO L130 PetriNetUnfolder]: 16496/27897 cut-off events. [2023-08-29 21:53:42,484 INFO L131 PetriNetUnfolder]: For 29377/29722 co-relation queries the response was YES. [2023-08-29 21:53:42,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75778 conditions, 27897 events. 16496/27897 cut-off events. For 29377/29722 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 230489 event pairs, 1577 based on Foata normal form. 927/24488 useless extension candidates. Maximal degree in co-relation 75707. Up to 19936 conditions per place. [2023-08-29 21:53:42,749 INFO L137 encePairwiseOnDemand]: 563/572 looper letters, 179 selfloop transitions, 22 changer transitions 1/220 dead transitions. [2023-08-29 21:53:42,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 220 transitions, 1594 flow [2023-08-29 21:53:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:53:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:53:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1095 transitions. [2023-08-29 21:53:42,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785839160839161 [2023-08-29 21:53:42,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1095 transitions. [2023-08-29 21:53:42,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1095 transitions. [2023-08-29 21:53:42,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:42,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1095 transitions. [2023-08-29 21:53:42,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 273.75) internal successors, (1095), 4 states have internal predecessors, (1095), 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 21:53:42,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 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 21:53:42,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 572.0) internal successors, (2860), 5 states have internal predecessors, (2860), 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 21:53:42,754 INFO L175 Difference]: Start difference. First operand has 140 places, 148 transitions, 917 flow. Second operand 4 states and 1095 transitions. [2023-08-29 21:53:42,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 220 transitions, 1594 flow [2023-08-29 21:53:42,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 220 transitions, 1540 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 21:53:42,890 INFO L231 Difference]: Finished difference. Result has 141 places, 147 transitions, 936 flow [2023-08-29 21:53:42,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=936, PETRI_PLACES=141, PETRI_TRANSITIONS=147} [2023-08-29 21:53:42,891 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 38 predicate places. [2023-08-29 21:53:42,891 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 147 transitions, 936 flow [2023-08-29 21:53:42,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.75) internal successors, (967), 4 states have internal predecessors, (967), 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 21:53:42,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:42,891 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:42,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 21:53:43,100 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:43,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1462387160, now seen corresponding path program 1 times [2023-08-29 21:53:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236730395] [2023-08-29 21:53:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:53:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236730395] [2023-08-29 21:53:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236730395] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282095332] [2023-08-29 21:53:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:43,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:43,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:43,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:53:43,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-29 21:53:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:43,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:53:43,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:43,369 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 7 treesize of output 6 [2023-08-29 21:53:43,429 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:53:43,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:53:43,446 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 13 treesize of output 15 [2023-08-29 21:53:43,475 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 13 treesize of output 15 [2023-08-29 21:53:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:53:43,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:55,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_829) |c_~#a~0.base|))) is different from false [2023-08-29 21:53:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:53:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282095332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:55,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:55,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-29 21:53:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945195412] [2023-08-29 21:53:55,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:55,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 21:53:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 21:53:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=4, NotChecked=18, Total=132 [2023-08-29 21:53:57,663 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 21:53:57,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 572 [2023-08-29 21:53:57,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 147 transitions, 936 flow. Second operand has 12 states, 12 states have (on average 179.75) internal successors, (2157), 12 states have internal predecessors, (2157), 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 21:53:57,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:57,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 572 [2023-08-29 21:53:57,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:00,929 INFO L130 PetriNetUnfolder]: 18797/31540 cut-off events. [2023-08-29 21:54:00,930 INFO L131 PetriNetUnfolder]: For 34984/35062 co-relation queries the response was YES. [2023-08-29 21:54:01,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86626 conditions, 31540 events. 18797/31540 cut-off events. For 34984/35062 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 257069 event pairs, 3544 based on Foata normal form. 145/27754 useless extension candidates. Maximal degree in co-relation 86554. Up to 18602 conditions per place. [2023-08-29 21:54:01,249 INFO L137 encePairwiseOnDemand]: 556/572 looper letters, 237 selfloop transitions, 48 changer transitions 1/299 dead transitions. [2023-08-29 21:54:01,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 299 transitions, 2132 flow [2023-08-29 21:54:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:54:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:54:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1460 transitions. [2023-08-29 21:54:01,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3646353646353646 [2023-08-29 21:54:01,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1460 transitions. [2023-08-29 21:54:01,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1460 transitions. [2023-08-29 21:54:01,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:01,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1460 transitions. [2023-08-29 21:54:01,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.57142857142858) internal successors, (1460), 7 states have internal predecessors, (1460), 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 21:54:01,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:54:01,254 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 572.0) internal successors, (4576), 8 states have internal predecessors, (4576), 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 21:54:01,255 INFO L175 Difference]: Start difference. First operand has 141 places, 147 transitions, 936 flow. Second operand 7 states and 1460 transitions. [2023-08-29 21:54:01,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 299 transitions, 2132 flow [2023-08-29 21:54:01,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 299 transitions, 2078 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:54:01,501 INFO L231 Difference]: Finished difference. Result has 150 places, 166 transitions, 1240 flow [2023-08-29 21:54:01,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1240, PETRI_PLACES=150, PETRI_TRANSITIONS=166} [2023-08-29 21:54:01,502 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 47 predicate places. [2023-08-29 21:54:01,502 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 166 transitions, 1240 flow [2023-08-29 21:54:01,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 179.75) internal successors, (2157), 12 states have internal predecessors, (2157), 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 21:54:01,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:01,503 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:01,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-29 21:54:01,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:01,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:01,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1476896079, now seen corresponding path program 1 times [2023-08-29 21:54:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027455805] [2023-08-29 21:54:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027455805] [2023-08-29 21:54:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027455805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117172851] [2023-08-29 21:54:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:01,797 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:54:01,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-29 21:54:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:01,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 21:54:01,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:01,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117172851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:01,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:01,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-29 21:54:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825105799] [2023-08-29 21:54:01,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:01,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 21:54:01,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 21:54:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-29 21:54:02,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 572 [2023-08-29 21:54:02,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 166 transitions, 1240 flow. Second operand has 9 states, 9 states have (on average 249.66666666666666) internal successors, (2247), 9 states have internal predecessors, (2247), 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 21:54:02,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:02,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 572 [2023-08-29 21:54:02,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:02,444 INFO L130 PetriNetUnfolder]: 1572/2942 cut-off events. [2023-08-29 21:54:02,445 INFO L131 PetriNetUnfolder]: For 5308/5358 co-relation queries the response was YES. [2023-08-29 21:54:02,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8843 conditions, 2942 events. 1572/2942 cut-off events. For 5308/5358 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18722 event pairs, 322 based on Foata normal form. 333/3126 useless extension candidates. Maximal degree in co-relation 8809. Up to 1877 conditions per place. [2023-08-29 21:54:02,467 INFO L137 encePairwiseOnDemand]: 569/572 looper letters, 92 selfloop transitions, 3 changer transitions 24/129 dead transitions. [2023-08-29 21:54:02,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 951 flow [2023-08-29 21:54:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:54:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:54:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1315 transitions. [2023-08-29 21:54:02,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597902097902098 [2023-08-29 21:54:02,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1315 transitions. [2023-08-29 21:54:02,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1315 transitions. [2023-08-29 21:54:02,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:02,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1315 transitions. [2023-08-29 21:54:02,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.0) internal successors, (1315), 5 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 21:54:02,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:54:02,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:54:02,474 INFO L175 Difference]: Start difference. First operand has 150 places, 166 transitions, 1240 flow. Second operand 5 states and 1315 transitions. [2023-08-29 21:54:02,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 951 flow [2023-08-29 21:54:02,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 129 transitions, 849 flow, removed 32 selfloop flow, removed 15 redundant places. [2023-08-29 21:54:02,485 INFO L231 Difference]: Finished difference. Result has 96 places, 60 transitions, 295 flow [2023-08-29 21:54:02,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=96, PETRI_TRANSITIONS=60} [2023-08-29 21:54:02,486 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -7 predicate places. [2023-08-29 21:54:02,486 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 60 transitions, 295 flow [2023-08-29 21:54:02,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 249.66666666666666) internal successors, (2247), 9 states have internal predecessors, (2247), 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 21:54:02,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:02,487 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:02,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-29 21:54:02,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-29 21:54:02,702 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:02,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1175199290, now seen corresponding path program 1 times [2023-08-29 21:54:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:02,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758382461] [2023-08-29 21:54:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:54:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758382461] [2023-08-29 21:54:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758382461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:54:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:54:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:54:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824756967] [2023-08-29 21:54:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:54:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 21:54:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 21:54:02,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 21:54:03,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 572 [2023-08-29 21:54:03,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 60 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 230.4) internal successors, (1152), 5 states have internal predecessors, (1152), 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 21:54:03,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:03,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 572 [2023-08-29 21:54:03,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:03,327 INFO L130 PetriNetUnfolder]: 736/1461 cut-off events. [2023-08-29 21:54:03,327 INFO L131 PetriNetUnfolder]: For 2531/2531 co-relation queries the response was YES. [2023-08-29 21:54:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4382 conditions, 1461 events. 736/1461 cut-off events. For 2531/2531 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8550 event pairs, 216 based on Foata normal form. 192/1502 useless extension candidates. Maximal degree in co-relation 4355. Up to 684 conditions per place. [2023-08-29 21:54:03,334 INFO L137 encePairwiseOnDemand]: 558/572 looper letters, 61 selfloop transitions, 17 changer transitions 5/90 dead transitions. [2023-08-29 21:54:03,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 601 flow [2023-08-29 21:54:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:54:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:54:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1201 transitions. [2023-08-29 21:54:03,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199300699300699 [2023-08-29 21:54:03,336 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1201 transitions. [2023-08-29 21:54:03,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1201 transitions. [2023-08-29 21:54:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:54:03,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1201 transitions. [2023-08-29 21:54:03,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 240.2) internal successors, (1201), 5 states have internal predecessors, (1201), 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 21:54:03,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:54:03,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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 21:54:03,339 INFO L175 Difference]: Start difference. First operand has 96 places, 60 transitions, 295 flow. Second operand 5 states and 1201 transitions. [2023-08-29 21:54:03,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 601 flow [2023-08-29 21:54:03,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 562 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 21:54:03,344 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 342 flow [2023-08-29 21:54:03,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2023-08-29 21:54:03,349 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -12 predicate places. [2023-08-29 21:54:03,349 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 342 flow [2023-08-29 21:54:03,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 230.4) internal successors, (1152), 5 states have internal predecessors, (1152), 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 21:54:03,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:54:03,350 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:54:03,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 21:54:03,350 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:54:03,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:54:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1667815374, now seen corresponding path program 1 times [2023-08-29 21:54:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:54:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858497108] [2023-08-29 21:54:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:54:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:54:06,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:54:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858497108] [2023-08-29 21:54:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858497108] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:54:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594328028] [2023-08-29 21:54:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:54:06,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:54:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:54:06,881 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:54:06,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-29 21:54:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:54:07,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:54:07,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:54:07,045 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 7 treesize of output 6 [2023-08-29 21:54:07,125 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:07,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:54:07,159 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 13 treesize of output 15 [2023-08-29 21:54:07,186 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 13 treesize of output 15 [2023-08-29 21:54:07,219 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 21:54:07,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:54:07,295 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 19 treesize of output 11 [2023-08-29 21:54:07,361 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 18 treesize of output 13 [2023-08-29 21:54:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:54:07,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:54:07,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 21:54:07,584 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 12 treesize of output 8 [2023-08-29 21:54:25,685 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1012 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_95| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_94| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_95| v_ArrVal_1012) |v_t_funThread2of2ForFork0_~p~0#1.offset_94|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_95| |v_t_funThread2of2ForFork0_~p~0#1.offset_94|))) is different from false [2023-08-29 21:54:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:54:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594328028] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:25,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 28 [2023-08-29 21:54:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258180306] [2023-08-29 21:54:25,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:25,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-29 21:54:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-29 21:54:25,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=661, Unknown=7, NotChecked=54, Total=870 [2023-08-29 21:54:26,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 21:54:26,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 342 flow. Second operand has 30 states, 30 states have (on average 147.96666666666667) internal successors, (4439), 30 states have internal predecessors, (4439), 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 21:54:26,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:26,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 21:54:26,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:48,668 WARN L222 SmtUtils]: Spent 22.04s on a formula simplification. DAG size of input: 36 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:54:50,673 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 21:54:52,675 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 21:54:54,679 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 21:54:56,685 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 21:54:58,748 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 21:55:00,769 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 21:55:02,774 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 21:55:04,776 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 21:55:06,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:55:08,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:55:10,850 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 21:55:12,854 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 21:55:15,073 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 21:55:17,079 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 21:55:19,084 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 21:55:21,798 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 21:55:23,807 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 21:55:25,811 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 21:55:28,270 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 21:55:30,271 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 21:55:32,286 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 21:55:34,346 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 21:55:36,349 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 21:55:38,360 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 21:55:40,365 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 21:55:42,372 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 21:55:44,415 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 21:55:46,417 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 21:55:48,420 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 21:55:50,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:55:52,471 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 21:55:54,476 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 21:55:56,482 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 21:55:58,565 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 21:55:59,529 INFO L130 PetriNetUnfolder]: 1130/2266 cut-off events. [2023-08-29 21:55:59,529 INFO L131 PetriNetUnfolder]: For 3225/3231 co-relation queries the response was YES. [2023-08-29 21:55:59,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 2266 events. 1130/2266 cut-off events. For 3225/3231 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14727 event pairs, 156 based on Foata normal form. 24/2039 useless extension candidates. Maximal degree in co-relation 6978. Up to 780 conditions per place. [2023-08-29 21:55:59,538 INFO L137 encePairwiseOnDemand]: 560/572 looper letters, 99 selfloop transitions, 42 changer transitions 24/171 dead transitions. [2023-08-29 21:55:59,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 171 transitions, 1142 flow [2023-08-29 21:55:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-29 21:55:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-29 21:55:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3799 transitions. [2023-08-29 21:55:59,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26566433566433567 [2023-08-29 21:55:59,543 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3799 transitions. [2023-08-29 21:55:59,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3799 transitions. [2023-08-29 21:55:59,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:55:59,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3799 transitions. [2023-08-29 21:55:59,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.96) internal successors, (3799), 25 states have internal predecessors, (3799), 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 21:55:59,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 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 21:55:59,557 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 572.0) internal successors, (14872), 26 states have internal predecessors, (14872), 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 21:55:59,558 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 342 flow. Second operand 25 states and 3799 transitions. [2023-08-29 21:55:59,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 171 transitions, 1142 flow [2023-08-29 21:55:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 171 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:55:59,565 INFO L231 Difference]: Finished difference. Result has 121 places, 86 transitions, 625 flow [2023-08-29 21:55:59,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=625, PETRI_PLACES=121, PETRI_TRANSITIONS=86} [2023-08-29 21:55:59,566 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 18 predicate places. [2023-08-29 21:55:59,566 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 86 transitions, 625 flow [2023-08-29 21:55:59,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 147.96666666666667) internal successors, (4439), 30 states have internal predecessors, (4439), 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 21:55:59,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:55:59,567 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:55:59,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-29 21:55:59,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:55:59,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:55:59,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:55:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash -741607512, now seen corresponding path program 2 times [2023-08-29 21:55:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:55:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195038716] [2023-08-29 21:55:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:55:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:55:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:56:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:56:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:56:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195038716] [2023-08-29 21:56:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195038716] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:56:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885289525] [2023-08-29 21:56:08,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:56:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:56:08,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:56:08,485 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:56:08,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-29 21:56:08,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:56:08,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:56:08,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 21:56:08,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:56:08,630 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 7 treesize of output 6 [2023-08-29 21:56:08,740 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:56:08,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:56:08,773 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 13 treesize of output 15 [2023-08-29 21:56:08,819 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 13 treesize of output 15 [2023-08-29 21:56:08,864 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 21:56:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:56:08,972 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 21:56:09,010 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 18 treesize of output 13 [2023-08-29 21:56:09,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:56:09,070 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 21:56:09,128 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:56:09,129 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 19 treesize of output 11 [2023-08-29 21:56:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:56:09,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:56:09,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:56:09,440 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 23 treesize of output 24 [2023-08-29 21:56:09,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:56:09,448 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 39 treesize of output 35 [2023-08-29 21:56:09,452 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 22 treesize of output 18 [2023-08-29 21:56:29,627 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1098 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_96| Int) (v_ArrVal_1094 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_97| |v_t_funThread2of2ForFork0_~p~0#1.offset_96|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1094) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_1098) |v_t_funThread2of2ForFork0_~p~0#1.offset_96|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-29 21:56:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:56:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885289525] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:56:31,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:56:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 21:56:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082426480] [2023-08-29 21:56:31,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:56:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 21:56:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:56:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 21:56:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=849, Unknown=7, NotChecked=62, Total=1122 [2023-08-29 21:56:32,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 21:56:32,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 86 transitions, 625 flow. Second operand has 34 states, 34 states have (on average 147.85294117647058) internal successors, (5027), 34 states have internal predecessors, (5027), 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 21:56:32,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:56:32,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 21:56:32,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:56:34,425 INFO L130 PetriNetUnfolder]: 1374/2750 cut-off events. [2023-08-29 21:56:34,426 INFO L131 PetriNetUnfolder]: For 13320/13326 co-relation queries the response was YES. [2023-08-29 21:56:34,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10415 conditions, 2750 events. 1374/2750 cut-off events. For 13320/13326 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18842 event pairs, 195 based on Foata normal form. 12/2469 useless extension candidates. Maximal degree in co-relation 10382. Up to 934 conditions per place. [2023-08-29 21:56:34,441 INFO L137 encePairwiseOnDemand]: 559/572 looper letters, 95 selfloop transitions, 59 changer transitions 25/185 dead transitions. [2023-08-29 21:56:34,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 185 transitions, 1606 flow [2023-08-29 21:56:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-29 21:56:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-29 21:56:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3647 transitions. [2023-08-29 21:56:34,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2656614219114219 [2023-08-29 21:56:34,448 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3647 transitions. [2023-08-29 21:56:34,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3647 transitions. [2023-08-29 21:56:34,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:56:34,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3647 transitions. [2023-08-29 21:56:34,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 151.95833333333334) internal successors, (3647), 24 states have internal predecessors, (3647), 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 21:56:34,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 572.0) internal successors, (14300), 25 states have internal predecessors, (14300), 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 21:56:34,466 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 572.0) internal successors, (14300), 25 states have internal predecessors, (14300), 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 21:56:34,466 INFO L175 Difference]: Start difference. First operand has 121 places, 86 transitions, 625 flow. Second operand 24 states and 3647 transitions. [2023-08-29 21:56:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 185 transitions, 1606 flow [2023-08-29 21:56:34,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 185 transitions, 1450 flow, removed 41 selfloop flow, removed 23 redundant places. [2023-08-29 21:56:34,492 INFO L231 Difference]: Finished difference. Result has 126 places, 114 transitions, 1002 flow [2023-08-29 21:56:34,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1002, PETRI_PLACES=126, PETRI_TRANSITIONS=114} [2023-08-29 21:56:34,493 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 23 predicate places. [2023-08-29 21:56:34,493 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 114 transitions, 1002 flow [2023-08-29 21:56:34,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 147.85294117647058) internal successors, (5027), 34 states have internal predecessors, (5027), 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 21:56:34,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:56:34,494 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:56:34,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-29 21:56:34,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:56:34,700 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:56:34,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:56:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -348525699, now seen corresponding path program 1 times [2023-08-29 21:56:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:56:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190434002] [2023-08-29 21:56:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:56:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:56:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:56:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:56:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:56:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190434002] [2023-08-29 21:56:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190434002] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:56:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971269918] [2023-08-29 21:56:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:56:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:56:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:56:43,722 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:56:43,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-29 21:56:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:56:43,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:56:43,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:56:43,875 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 7 treesize of output 6 [2023-08-29 21:56:43,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:56:43,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:56:43,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 13 treesize of output 15 [2023-08-29 21:56:44,003 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 13 treesize of output 15 [2023-08-29 21:56:44,028 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 21:56:44,077 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:56:44,078 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 19 treesize of output 11 [2023-08-29 21:56:44,132 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 18 treesize of output 13 [2023-08-29 21:56:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:56:44,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:56:44,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 21:56:44,324 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 12 treesize of output 8 [2023-08-29 21:56:58,393 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1184 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_98| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_98|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1181) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_98| v_ArrVal_1184) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0))) is different from false [2023-08-29 21:56:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:56:58,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971269918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:56:58,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:56:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 29 [2023-08-29 21:56:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613169467] [2023-08-29 21:56:58,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:56:58,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-29 21:56:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:56:58,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-29 21:56:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=709, Unknown=5, NotChecked=56, Total=930 [2023-08-29 21:56:58,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 572 [2023-08-29 21:56:58,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 114 transitions, 1002 flow. Second operand has 31 states, 31 states have (on average 149.03225806451613) internal successors, (4620), 31 states have internal predecessors, (4620), 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 21:56:58,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:56:58,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 572 [2023-08-29 21:56:58,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:56:59,481 INFO L130 PetriNetUnfolder]: 1433/2886 cut-off events. [2023-08-29 21:56:59,481 INFO L131 PetriNetUnfolder]: For 17092/17098 co-relation queries the response was YES. [2023-08-29 21:56:59,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11799 conditions, 2886 events. 1433/2886 cut-off events. For 17092/17098 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20263 event pairs, 276 based on Foata normal form. 12/2584 useless extension candidates. Maximal degree in co-relation 11769. Up to 1587 conditions per place. [2023-08-29 21:56:59,492 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 112 selfloop transitions, 33 changer transitions 20/171 dead transitions. [2023-08-29 21:56:59,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 171 transitions, 1615 flow [2023-08-29 21:56:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 21:56:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 21:56:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2903 transitions. [2023-08-29 21:56:59,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26711446448288556 [2023-08-29 21:56:59,498 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2903 transitions. [2023-08-29 21:56:59,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2903 transitions. [2023-08-29 21:56:59,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:56:59,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2903 transitions. [2023-08-29 21:56:59,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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 21:56:59,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 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 21:56:59,509 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 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 21:56:59,509 INFO L175 Difference]: Start difference. First operand has 126 places, 114 transitions, 1002 flow. Second operand 19 states and 2903 transitions. [2023-08-29 21:56:59,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 171 transitions, 1615 flow [2023-08-29 21:56:59,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 171 transitions, 1342 flow, removed 118 selfloop flow, removed 15 redundant places. [2023-08-29 21:56:59,569 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 883 flow [2023-08-29 21:56:59,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=883, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2023-08-29 21:56:59,569 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 29 predicate places. [2023-08-29 21:56:59,570 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 883 flow [2023-08-29 21:56:59,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 149.03225806451613) internal successors, (4620), 31 states have internal predecessors, (4620), 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 21:56:59,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:56:59,571 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:56:59,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-29 21:56:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:56:59,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:56:59,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:56:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash -788866064, now seen corresponding path program 3 times [2023-08-29 21:56:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:56:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112063816] [2023-08-29 21:56:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:56:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:56:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:57:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:57:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:57:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112063816] [2023-08-29 21:57:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112063816] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:57:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477377455] [2023-08-29 21:57:02,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 21:57:02,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:57:02,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:57:02,173 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:57:02,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-29 21:57:02,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-29 21:57:02,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:57:02,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:57:02,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:57:02,320 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 7 treesize of output 6 [2023-08-29 21:57:02,401 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:02,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:57:02,431 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 13 treesize of output 15 [2023-08-29 21:57:02,451 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 13 treesize of output 15 [2023-08-29 21:57:02,489 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 21:57:02,535 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:57:02,535 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 19 treesize of output 11 [2023-08-29 21:57:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-29 21:57:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:57:02,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:57:02,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 21:57:02,771 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 12 treesize of output 8 [2023-08-29 21:57:12,836 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_101| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_100| Int) (v_ArrVal_1266 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1266) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_101| v_ArrVal_1270) |v_t_funThread2of2ForFork0_~p~0#1.offset_100|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_101| |v_t_funThread2of2ForFork0_~p~0#1.offset_100|))) is different from false [2023-08-29 21:57:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:57:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477377455] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:57:12,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:57:12,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 30 [2023-08-29 21:57:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824251230] [2023-08-29 21:57:12,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:57:12,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 21:57:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:57:12,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 21:57:12,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=4, NotChecked=58, Total=992 [2023-08-29 21:57:13,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 21:57:13,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 883 flow. Second operand has 32 states, 32 states have (on average 147.96875) internal successors, (4735), 32 states have internal predecessors, (4735), 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 21:57:13,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:57:13,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 21:57:13,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:57:41,677 WARN L222 SmtUtils]: Spent 28.08s on a formula simplification. DAG size of input: 37 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:57:43,679 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 21:57:45,706 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 21:57:47,727 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 21:57:49,731 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 21:57:51,734 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 21:57:53,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:57:55,761 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 21:57:57,774 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 21:57:59,787 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 21:58:01,801 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 21:58:03,827 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 21:58:05,836 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 21:58:07,895 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 21:58:09,900 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 21:58:11,903 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 21:58:13,935 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 21:58:15,939 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 21:58:17,941 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 21:58:19,943 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 21:58:21,948 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 21:58:23,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:58:25,975 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 21:58:27,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:58:29,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 [1] [2023-08-29 21:58:31,993 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 21:58:33,998 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 21:58:34,904 INFO L130 PetriNetUnfolder]: 1432/2934 cut-off events. [2023-08-29 21:58:34,904 INFO L131 PetriNetUnfolder]: For 8951/8963 co-relation queries the response was YES. [2023-08-29 21:58:34,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10762 conditions, 2934 events. 1432/2934 cut-off events. For 8951/8963 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20860 event pairs, 291 based on Foata normal form. 12/2623 useless extension candidates. Maximal degree in co-relation 10730. Up to 1686 conditions per place. [2023-08-29 21:58:34,917 INFO L137 encePairwiseOnDemand]: 560/572 looper letters, 119 selfloop transitions, 35 changer transitions 20/180 dead transitions. [2023-08-29 21:58:34,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 180 transitions, 1541 flow [2023-08-29 21:58:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 21:58:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 21:58:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3033 transitions. [2023-08-29 21:58:34,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2651223776223776 [2023-08-29 21:58:34,921 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3033 transitions. [2023-08-29 21:58:34,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3033 transitions. [2023-08-29 21:58:34,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:58:34,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3033 transitions. [2023-08-29 21:58:34,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 151.65) internal successors, (3033), 20 states have internal predecessors, (3033), 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 21:58:34,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 21:58:34,933 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 21:58:34,933 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 883 flow. Second operand 20 states and 3033 transitions. [2023-08-29 21:58:34,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 180 transitions, 1541 flow [2023-08-29 21:58:34,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 180 transitions, 1440 flow, removed 23 selfloop flow, removed 15 redundant places. [2023-08-29 21:58:34,963 INFO L231 Difference]: Finished difference. Result has 139 places, 124 transitions, 940 flow [2023-08-29 21:58:34,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=940, PETRI_PLACES=139, PETRI_TRANSITIONS=124} [2023-08-29 21:58:34,964 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 36 predicate places. [2023-08-29 21:58:34,964 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 124 transitions, 940 flow [2023-08-29 21:58:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 147.96875) internal successors, (4735), 32 states have internal predecessors, (4735), 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 21:58:34,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:58:34,965 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:58:34,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-29 21:58:35,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:58:35,171 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:58:35,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:58:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash -798626189, now seen corresponding path program 2 times [2023-08-29 21:58:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:58:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399667349] [2023-08-29 21:58:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:58:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:58:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:58:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:58:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:58:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399667349] [2023-08-29 21:58:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399667349] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:58:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097003070] [2023-08-29 21:58:35,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:58:35,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:58:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:58:35,525 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:58:35,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-29 21:58:35,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:58:35,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:58:35,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:58:35,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:58:35,660 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 7 treesize of output 6 [2023-08-29 21:58:35,719 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:58:35,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:58:35,739 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 13 treesize of output 15 [2023-08-29 21:58:35,760 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 13 treesize of output 15 [2023-08-29 21:58:35,781 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 21:58:35,812 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:58:35,812 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 19 treesize of output 11 [2023-08-29 21:58:35,855 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 18 treesize of output 13 [2023-08-29 21:58:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:58:35,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:58:35,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 21:58:35,949 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 12 treesize of output 8 [2023-08-29 21:58:48,025 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_102| Int) (v_ArrVal_1354 Int) (v_ArrVal_1351 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1351) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_102| v_ArrVal_1354) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_102|))) is different from false [2023-08-29 21:58:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 21:58:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097003070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:58:48,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:58:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2023-08-29 21:58:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529465436] [2023-08-29 21:58:48,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:58:48,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-29 21:58:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:58:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-29 21:58:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=307, Unknown=5, NotChecked=36, Total=420 [2023-08-29 21:58:48,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 572 [2023-08-29 21:58:48,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 124 transitions, 940 flow. Second operand has 21 states, 21 states have (on average 151.52380952380952) internal successors, (3182), 21 states have internal predecessors, (3182), 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 21:58:48,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:58:48,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 572 [2023-08-29 21:58:48,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:59:04,309 WARN L222 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 34 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:06,319 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 21:59:08,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:11,289 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 21:59:21,345 WARN L222 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:23,348 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 21:59:25,361 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 21:59:27,398 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 21:59:29,424 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 21:59:31,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:33,485 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 21:59:35,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:37,493 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 21:59:39,496 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 21:59:41,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:43,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:59:45,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 21:59:47,527 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 21:59:49,529 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 21:59:50,654 INFO L130 PetriNetUnfolder]: 1812/3700 cut-off events. [2023-08-29 21:59:50,654 INFO L131 PetriNetUnfolder]: For 11888/11906 co-relation queries the response was YES. [2023-08-29 21:59:50,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13669 conditions, 3700 events. 1812/3700 cut-off events. For 11888/11906 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 27525 event pairs, 343 based on Foata normal form. 24/3309 useless extension candidates. Maximal degree in co-relation 13633. Up to 1871 conditions per place. [2023-08-29 21:59:50,672 INFO L137 encePairwiseOnDemand]: 559/572 looper letters, 166 selfloop transitions, 47 changer transitions 43/262 dead transitions. [2023-08-29 21:59:50,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 262 transitions, 2167 flow [2023-08-29 21:59:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 21:59:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 21:59:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3305 transitions. [2023-08-29 21:59:50,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2751415251415251 [2023-08-29 21:59:50,676 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3305 transitions. [2023-08-29 21:59:50,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3305 transitions. [2023-08-29 21:59:50,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:59:50,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3305 transitions. [2023-08-29 21:59:50,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 157.38095238095238) internal successors, (3305), 21 states have internal predecessors, (3305), 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 21:59:50,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 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 21:59:50,688 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 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 21:59:50,688 INFO L175 Difference]: Start difference. First operand has 139 places, 124 transitions, 940 flow. Second operand 21 states and 3305 transitions. [2023-08-29 21:59:50,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 262 transitions, 2167 flow [2023-08-29 21:59:50,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 262 transitions, 2053 flow, removed 15 selfloop flow, removed 16 redundant places. [2023-08-29 21:59:50,730 INFO L231 Difference]: Finished difference. Result has 148 places, 150 transitions, 1216 flow [2023-08-29 21:59:50,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1216, PETRI_PLACES=148, PETRI_TRANSITIONS=150} [2023-08-29 21:59:50,731 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 45 predicate places. [2023-08-29 21:59:50,731 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 150 transitions, 1216 flow [2023-08-29 21:59:50,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.52380952380952) internal successors, (3182), 21 states have internal predecessors, (3182), 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 21:59:50,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:59:50,732 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:59:50,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-29 21:59:50,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-29 21:59:50,937 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:59:50,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:59:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1990365534, now seen corresponding path program 4 times [2023-08-29 21:59:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:59:50,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127117977] [2023-08-29 21:59:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:59:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:59:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:59:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:59:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:59:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127117977] [2023-08-29 21:59:53,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127117977] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:59:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909983990] [2023-08-29 21:59:53,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 21:59:53,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:59:53,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:59:53,253 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 21:59:53,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-29 21:59:53,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 21:59:53,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:59:53,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 21:59:53,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:59:53,399 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 7 treesize of output 6 [2023-08-29 21:59:53,481 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:59:53,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:59:53,511 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 13 treesize of output 15 [2023-08-29 21:59:53,528 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 21:59:53,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:59:53,596 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 21:59:53,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 18 treesize of output 13 [2023-08-29 21:59:53,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:59:53,673 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 21:59:53,719 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 21:59:53,774 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:59:53,775 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 19 treesize of output 11 [2023-08-29 21:59:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:59:53,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:59:53,940 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1441) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_104|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0))) is different from false [2023-08-29 21:59:53,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1441) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_104|)) 0)))) is different from false [2023-08-29 21:59:53,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:59:53,998 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 23 treesize of output 24 [2023-08-29 21:59:54,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 21:59:54,007 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 39 treesize of output 35 [2023-08-29 21:59:54,012 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 22 treesize of output 18 [2023-08-29 21:59:54,038 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_105| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_105| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_105| |v_t_funThread2of2ForFork0_~p~0#1.offset_104|))))) is different from false [2023-08-29 21:59:54,092 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105| v_ArrVal_1440))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_104| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105| v_ArrVal_1440))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_104|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_105| |v_t_funThread2of2ForFork0_~p~0#1.offset_104|)))) is different from false [2023-08-29 22:00:02,203 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:00:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-29 22:00:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909983990] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:00:02,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:00:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 33 [2023-08-29 22:00:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003321692] [2023-08-29 22:00:02,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:00:02,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-29 22:00:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:00:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-29 22:00:02,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=788, Unknown=4, NotChecked=244, Total=1190 [2023-08-29 22:00:02,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 22:00:02,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 150 transitions, 1216 flow. Second operand has 35 states, 35 states have (on average 147.8) internal successors, (5173), 35 states have internal predecessors, (5173), 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 22:00:02,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:00:02,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 22:00:02,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:00:04,315 INFO L130 PetriNetUnfolder]: 1732/3549 cut-off events. [2023-08-29 22:00:04,316 INFO L131 PetriNetUnfolder]: For 11960/11984 co-relation queries the response was YES. [2023-08-29 22:00:04,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13388 conditions, 3549 events. 1732/3549 cut-off events. For 11960/11984 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 26368 event pairs, 278 based on Foata normal form. 3/3133 useless extension candidates. Maximal degree in co-relation 13347. Up to 1450 conditions per place. [2023-08-29 22:00:04,335 INFO L137 encePairwiseOnDemand]: 563/572 looper letters, 129 selfloop transitions, 47 changer transitions 14/196 dead transitions. [2023-08-29 22:00:04,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 196 transitions, 1870 flow [2023-08-29 22:00:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 22:00:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 22:00:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2873 transitions. [2023-08-29 22:00:04,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26435406698564595 [2023-08-29 22:00:04,338 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2873 transitions. [2023-08-29 22:00:04,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2873 transitions. [2023-08-29 22:00:04,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:04,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2873 transitions. [2023-08-29 22:00:04,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 151.21052631578948) internal successors, (2873), 19 states have internal predecessors, (2873), 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 22:00:04,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 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 22:00:04,345 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 572.0) internal successors, (11440), 20 states have internal predecessors, (11440), 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 22:00:04,345 INFO L175 Difference]: Start difference. First operand has 148 places, 150 transitions, 1216 flow. Second operand 19 states and 2873 transitions. [2023-08-29 22:00:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 196 transitions, 1870 flow [2023-08-29 22:00:04,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 196 transitions, 1754 flow, removed 53 selfloop flow, removed 3 redundant places. [2023-08-29 22:00:04,383 INFO L231 Difference]: Finished difference. Result has 165 places, 153 transitions, 1245 flow [2023-08-29 22:00:04,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1245, PETRI_PLACES=165, PETRI_TRANSITIONS=153} [2023-08-29 22:00:04,383 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 62 predicate places. [2023-08-29 22:00:04,384 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 153 transitions, 1245 flow [2023-08-29 22:00:04,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 147.8) internal successors, (5173), 35 states have internal predecessors, (5173), 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 22:00:04,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:04,384 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:04,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-29 22:00:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-29 22:00:04,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:04,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:04,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2063981827, now seen corresponding path program 3 times [2023-08-29 22:00:04,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:04,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59565819] [2023-08-29 22:00:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:00:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:00:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:00:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59565819] [2023-08-29 22:00:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59565819] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:00:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499111139] [2023-08-29 22:00:07,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 22:00:07,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:07,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:00:07,685 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:00:07,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-29 22:00:07,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-29 22:00:07,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:00:07,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 22:00:07,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:00:07,822 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 7 treesize of output 6 [2023-08-29 22:00:07,907 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:07,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:00:07,937 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 13 treesize of output 15 [2023-08-29 22:00:07,962 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 13 treesize of output 15 [2023-08-29 22:00:08,000 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 22:00:08,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:08,057 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 22:00:08,080 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 18 treesize of output 13 [2023-08-29 22:00:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:08,118 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 22:00:08,159 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:08,159 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 19 treesize of output 11 [2023-08-29 22:00:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:00:08,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:00:08,269 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_1529 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1529) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_107|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_107|) 0))) is different from false [2023-08-29 22:00:08,278 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_1529 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1529) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_107|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1528)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_107|) 0))) is different from false [2023-08-29 22:00:08,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:08,302 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 23 treesize of output 24 [2023-08-29 22:00:08,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:08,308 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 39 treesize of output 35 [2023-08-29 22:00:08,312 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 22 treesize of output 18 [2023-08-29 22:00:20,457 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1528 Int) (v_ArrVal_1523 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_107| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_106| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1523) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_106| v_ArrVal_1528) |v_t_funThread1of2ForFork0_~p~0#1.offset_107|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_107| |v_t_funThread2of2ForFork0_~p~0#1.offset_106|)))) is different from false [2023-08-29 22:00:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-29 22:00:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499111139] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:00:22,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:00:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2023-08-29 22:00:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858852579] [2023-08-29 22:00:22,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:00:22,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 22:00:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:00:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 22:00:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=764, Unknown=6, NotChecked=180, Total=1122 [2023-08-29 22:00:23,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 572 [2023-08-29 22:00:23,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 153 transitions, 1245 flow. Second operand has 34 states, 34 states have (on average 145.85294117647058) internal successors, (4959), 34 states have internal predecessors, (4959), 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 22:00:23,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:00:23,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 572 [2023-08-29 22:00:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:00:25,113 INFO L130 PetriNetUnfolder]: 1739/3592 cut-off events. [2023-08-29 22:00:25,113 INFO L131 PetriNetUnfolder]: For 10986/10986 co-relation queries the response was YES. [2023-08-29 22:00:25,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13379 conditions, 3592 events. 1739/3592 cut-off events. For 10986/10986 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 26703 event pairs, 324 based on Foata normal form. 3/3173 useless extension candidates. Maximal degree in co-relation 13335. Up to 1805 conditions per place. [2023-08-29 22:00:25,131 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 128 selfloop transitions, 55 changer transitions 15/204 dead transitions. [2023-08-29 22:00:25,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 204 transitions, 1898 flow [2023-08-29 22:00:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-29 22:00:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-29 22:00:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3132 transitions. [2023-08-29 22:00:25,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26073926073926074 [2023-08-29 22:00:25,134 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3132 transitions. [2023-08-29 22:00:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3132 transitions. [2023-08-29 22:00:25,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:25,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3132 transitions. [2023-08-29 22:00:25,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 149.14285714285714) internal successors, (3132), 21 states have internal predecessors, (3132), 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 22:00:25,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 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 22:00:25,152 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 572.0) internal successors, (12584), 22 states have internal predecessors, (12584), 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 22:00:25,152 INFO L175 Difference]: Start difference. First operand has 165 places, 153 transitions, 1245 flow. Second operand 21 states and 3132 transitions. [2023-08-29 22:00:25,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 204 transitions, 1898 flow [2023-08-29 22:00:25,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 1819 flow, removed 1 selfloop flow, removed 17 redundant places. [2023-08-29 22:00:25,186 INFO L231 Difference]: Finished difference. Result has 170 places, 160 transitions, 1383 flow [2023-08-29 22:00:25,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1383, PETRI_PLACES=170, PETRI_TRANSITIONS=160} [2023-08-29 22:00:25,187 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 67 predicate places. [2023-08-29 22:00:25,187 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 160 transitions, 1383 flow [2023-08-29 22:00:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 145.85294117647058) internal successors, (4959), 34 states have internal predecessors, (4959), 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 22:00:25,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:25,187 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:25,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-29 22:00:25,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:25,393 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:25,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -866138912, now seen corresponding path program 5 times [2023-08-29 22:00:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285270302] [2023-08-29 22:00:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:00:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:00:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:00:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285270302] [2023-08-29 22:00:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285270302] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:00:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711803160] [2023-08-29 22:00:27,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 22:00:27,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:27,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:00:28,001 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:00:28,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-29 22:00:28,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 22:00:28,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:00:28,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 22:00:28,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:00:28,458 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 7 treesize of output 6 [2023-08-29 22:00:28,538 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:28,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:00:28,565 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 13 treesize of output 15 [2023-08-29 22:00:28,589 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 13 treesize of output 15 [2023-08-29 22:00:28,607 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 22:00:28,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:28,661 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 22:00:28,727 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:28,727 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 19 treesize of output 11 [2023-08-29 22:00:28,765 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 18 treesize of output 13 [2023-08-29 22:00:28,814 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 22:00:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:00:28,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:00:29,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:29,062 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 23 treesize of output 24 [2023-08-29 22:00:29,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:29,073 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 39 treesize of output 35 [2023-08-29 22:00:29,076 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 22 treesize of output 18 [2023-08-29 22:00:29,472 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_1618)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_108|))) (or (forall ((v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_1618)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-29 22:00:30,036 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1614))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_1618))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1614))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_1618))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0)))) is different from false [2023-08-29 22:00:38,157 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:00:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:00:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711803160] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:00:38,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:00:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-08-29 22:00:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312380008] [2023-08-29 22:00:38,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:00:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-29 22:00:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:00:38,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-29 22:00:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=843, Unknown=28, NotChecked=122, Total=1122 [2023-08-29 22:00:38,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 22:00:38,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 160 transitions, 1383 flow. Second operand has 34 states, 34 states have (on average 147.94117647058823) internal successors, (5030), 34 states have internal predecessors, (5030), 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 22:00:38,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:00:38,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 22:00:38,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:00:39,578 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int) (v_ArrVal_1617 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1618)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1617) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_108|)) 0)))) (exists ((v_ArrVal_1618 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1618) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_1618 Int) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_108| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1618)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_108|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_108|)) 0)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_~#__global_lock~0.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-08-29 22:00:41,084 INFO L130 PetriNetUnfolder]: 1901/3975 cut-off events. [2023-08-29 22:00:41,084 INFO L131 PetriNetUnfolder]: For 14441/14465 co-relation queries the response was YES. [2023-08-29 22:00:41,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15251 conditions, 3975 events. 1901/3975 cut-off events. For 14441/14465 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 30615 event pairs, 366 based on Foata normal form. 15/3535 useless extension candidates. Maximal degree in co-relation 15206. Up to 1816 conditions per place. [2023-08-29 22:00:41,106 INFO L137 encePairwiseOnDemand]: 556/572 looper letters, 143 selfloop transitions, 51 changer transitions 88/288 dead transitions. [2023-08-29 22:00:41,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 288 transitions, 2697 flow [2023-08-29 22:00:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-29 22:00:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-29 22:00:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4257 transitions. [2023-08-29 22:00:41,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2657967032967033 [2023-08-29 22:00:41,110 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4257 transitions. [2023-08-29 22:00:41,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4257 transitions. [2023-08-29 22:00:41,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:41,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4257 transitions. [2023-08-29 22:00:41,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 152.03571428571428) internal successors, (4257), 28 states have internal predecessors, (4257), 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 22:00:41,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 572.0) internal successors, (16588), 29 states have internal predecessors, (16588), 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 22:00:41,122 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 572.0) internal successors, (16588), 29 states have internal predecessors, (16588), 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 22:00:41,122 INFO L175 Difference]: Start difference. First operand has 170 places, 160 transitions, 1383 flow. Second operand 28 states and 4257 transitions. [2023-08-29 22:00:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 288 transitions, 2697 flow [2023-08-29 22:00:41,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 288 transitions, 2606 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-08-29 22:00:41,166 INFO L231 Difference]: Finished difference. Result has 192 places, 162 transitions, 1464 flow [2023-08-29 22:00:41,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1464, PETRI_PLACES=192, PETRI_TRANSITIONS=162} [2023-08-29 22:00:41,167 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 89 predicate places. [2023-08-29 22:00:41,167 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 162 transitions, 1464 flow [2023-08-29 22:00:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 147.94117647058823) internal successors, (5030), 34 states have internal predecessors, (5030), 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 22:00:41,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:41,168 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:41,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-29 22:00:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:41,368 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:41,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1097502662, now seen corresponding path program 6 times [2023-08-29 22:00:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639263748] [2023-08-29 22:00:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:00:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:00:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:00:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639263748] [2023-08-29 22:00:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639263748] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:00:41,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819176953] [2023-08-29 22:00:41,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 22:00:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:00:41,728 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:00:41,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-29 22:00:41,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-29 22:00:41,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:00:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 22:00:41,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:00:41,935 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 7 treesize of output 6 [2023-08-29 22:00:42,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:42,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:00:42,035 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 13 treesize of output 15 [2023-08-29 22:00:42,060 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 13 treesize of output 15 [2023-08-29 22:00:42,075 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 22:00:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:00:42,119 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 22:00:42,167 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:00:42,168 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 19 treesize of output 11 [2023-08-29 22:00:42,196 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 18 treesize of output 13 [2023-08-29 22:00:42,234 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 22:00:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:00:42,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:00:42,284 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 22:00:42,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:42,407 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 23 treesize of output 24 [2023-08-29 22:00:42,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:00:42,417 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 39 treesize of output 35 [2023-08-29 22:00:42,422 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 22 treesize of output 18 [2023-08-29 22:00:42,446 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_111| v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_111| |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_111| v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))))) is different from false [2023-08-29 22:00:42,460 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1705 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1705))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_111| v_ArrVal_1709))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_111| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1705 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_111| |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1705))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_111| v_ArrVal_1709))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0)))) is different from false [2023-08-29 22:00:50,546 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:00:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:00:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819176953] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:00:50,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:00:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-29 22:00:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773501396] [2023-08-29 22:00:50,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:00:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 22:00:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:00:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 22:00:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=12, NotChecked=114, Total=506 [2023-08-29 22:00:50,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 572 [2023-08-29 22:00:50,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 162 transitions, 1464 flow. Second operand has 23 states, 23 states have (on average 153.47826086956522) internal successors, (3530), 23 states have internal predecessors, (3530), 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 22:00:50,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:00:50,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 572 [2023-08-29 22:00:50,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:00:53,683 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 22:00:53,976 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_110|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_110| Int) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1708 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1708) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_110|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1709)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1711) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_110|) 0))) (= |c_~#__global_lock~0.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-08-29 22:00:54,270 INFO L130 PetriNetUnfolder]: 1707/3620 cut-off events. [2023-08-29 22:00:54,270 INFO L131 PetriNetUnfolder]: For 18544/18568 co-relation queries the response was YES. [2023-08-29 22:00:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16622 conditions, 3620 events. 1707/3620 cut-off events. For 18544/18568 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 27787 event pairs, 357 based on Foata normal form. 10/3450 useless extension candidates. Maximal degree in co-relation 16567. Up to 1736 conditions per place. [2023-08-29 22:00:54,294 INFO L137 encePairwiseOnDemand]: 557/572 looper letters, 156 selfloop transitions, 38 changer transitions 54/254 dead transitions. [2023-08-29 22:00:54,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 254 transitions, 2641 flow [2023-08-29 22:00:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 22:00:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 22:00:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2550 transitions. [2023-08-29 22:00:54,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2786276223776224 [2023-08-29 22:00:54,297 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2550 transitions. [2023-08-29 22:00:54,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2550 transitions. [2023-08-29 22:00:54,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:54,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2550 transitions. [2023-08-29 22:00:54,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 159.375) internal successors, (2550), 16 states have internal predecessors, (2550), 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 22:00:54,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 572.0) internal successors, (9724), 17 states have internal predecessors, (9724), 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 22:00:54,306 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 572.0) internal successors, (9724), 17 states have internal predecessors, (9724), 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 22:00:54,306 INFO L175 Difference]: Start difference. First operand has 192 places, 162 transitions, 1464 flow. Second operand 16 states and 2550 transitions. [2023-08-29 22:00:54,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 254 transitions, 2641 flow [2023-08-29 22:00:54,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 254 transitions, 2507 flow, removed 34 selfloop flow, removed 23 redundant places. [2023-08-29 22:00:54,379 INFO L231 Difference]: Finished difference. Result has 184 places, 166 transitions, 1537 flow [2023-08-29 22:00:54,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1537, PETRI_PLACES=184, PETRI_TRANSITIONS=166} [2023-08-29 22:00:54,380 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 81 predicate places. [2023-08-29 22:00:54,380 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 166 transitions, 1537 flow [2023-08-29 22:00:54,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 153.47826086956522) internal successors, (3530), 23 states have internal predecessors, (3530), 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 22:00:54,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:54,381 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:54,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-29 22:00:54,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-29 22:00:54,586 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:54,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -105726363, now seen corresponding path program 4 times [2023-08-29 22:00:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886312643] [2023-08-29 22:00:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:01:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 22:01:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:01:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886312643] [2023-08-29 22:01:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886312643] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:01:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173275104] [2023-08-29 22:01:02,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 22:01:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:01:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:01:02,404 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:01:02,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-29 22:01:02,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 22:01:02,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:01:02,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-29 22:01:02,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:01:02,566 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 7 treesize of output 6 [2023-08-29 22:01:02,637 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:01:02,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:01:02,665 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 13 treesize of output 15 [2023-08-29 22:01:02,684 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 13 treesize of output 15 [2023-08-29 22:01:02,692 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 22:01:02,773 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:01:02,774 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 19 treesize of output 11 [2023-08-29 22:01:02,835 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 18 treesize of output 13 [2023-08-29 22:01:02,887 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 22:01:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 22:01:02,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:01:02,945 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1801) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 22:01:03,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 22:01:03,071 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 12 treesize of output 8 [2023-08-29 22:01:03,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_113| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112| v_ArrVal_1800)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1801) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_113|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_113| |v_t_funThread2of2ForFork0_~p~0#1.offset_112|))) is different from false [2023-08-29 22:01:03,082 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_112| Int) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1796 (Array Int Int)) (v_ArrVal_1800 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_113| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1796))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_112| v_ArrVal_1800))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1801) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_113|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_113| |v_t_funThread2of2ForFork0_~p~0#1.offset_112|))) is different from false [2023-08-29 22:01:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:01:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173275104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:01:03,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:01:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 7] total 31 [2023-08-29 22:01:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756885500] [2023-08-29 22:01:03,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:01:03,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-29 22:01:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:01:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-29 22:01:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=12, NotChecked=174, Total=1056 [2023-08-29 22:01:03,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 572 [2023-08-29 22:01:03,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 166 transitions, 1537 flow. Second operand has 33 states, 33 states have (on average 148.03030303030303) internal successors, (4885), 33 states have internal predecessors, (4885), 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 22:01:03,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:01:03,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 572 [2023-08-29 22:01:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:01:33,677 WARN L222 SmtUtils]: Spent 30.10s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:01:35,679 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 22:01:37,692 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 22:01:40,236 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 22:01:42,239 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 22:01:44,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 [1] [2023-08-29 22:01:46,253 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 22:01:49,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:01:51,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:01:54,268 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 22:01:57,352 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 22:01:59,364 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 22:02:01,378 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 22:02:03,380 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 22:02:05,394 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 22:02:07,413 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 22:02:09,466 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 22:02:11,471 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 22:02:13,476 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 22:02:15,494 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 22:02:17,496 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 22:02:19,977 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 22:02:21,989 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 22:02:24,443 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 22:02:26,450 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 22:02:28,453 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 22:02:30,703 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 22:02:32,717 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 22:02:34,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 [1] [2023-08-29 22:02:36,731 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 22:02:38,735 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 22:02:40,785 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 22:02:42,792 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 22:02:44,794 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 22:02:46,797 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 22:02:48,805 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 22:02:50,808 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 22:02:52,839 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 22:02:54,857 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 22:02:56,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 22:02:58,883 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 22:03:00,885 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 22:03:02,887 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 22:03:04,905 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 22:03:06,907 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 22:03:08,204 INFO L130 PetriNetUnfolder]: 1669/3532 cut-off events. [2023-08-29 22:03:08,204 INFO L131 PetriNetUnfolder]: For 17902/17920 co-relation queries the response was YES. [2023-08-29 22:03:08,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16604 conditions, 3532 events. 1669/3532 cut-off events. For 17902/17920 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 26935 event pairs, 359 based on Foata normal form. 4/3123 useless extension candidates. Maximal degree in co-relation 16547. Up to 1824 conditions per place. [2023-08-29 22:03:08,228 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 132 selfloop transitions, 33 changer transitions 43/214 dead transitions. [2023-08-29 22:03:08,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 214 transitions, 2252 flow [2023-08-29 22:03:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 22:03:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 22:03:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3029 transitions. [2023-08-29 22:03:08,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26477272727272727 [2023-08-29 22:03:08,233 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3029 transitions. [2023-08-29 22:03:08,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3029 transitions. [2023-08-29 22:03:08,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:03:08,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3029 transitions. [2023-08-29 22:03:08,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 151.45) internal successors, (3029), 20 states have internal predecessors, (3029), 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 22:03:08,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 22:03:08,242 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 22:03:08,243 INFO L175 Difference]: Start difference. First operand has 184 places, 166 transitions, 1537 flow. Second operand 20 states and 3029 transitions. [2023-08-29 22:03:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 214 transitions, 2252 flow [2023-08-29 22:03:08,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 214 transitions, 2154 flow, removed 19 selfloop flow, removed 14 redundant places. [2023-08-29 22:03:08,293 INFO L231 Difference]: Finished difference. Result has 188 places, 156 transitions, 1407 flow [2023-08-29 22:03:08,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1407, PETRI_PLACES=188, PETRI_TRANSITIONS=156} [2023-08-29 22:03:08,293 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 85 predicate places. [2023-08-29 22:03:08,293 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 156 transitions, 1407 flow [2023-08-29 22:03:08,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 148.03030303030303) internal successors, (4885), 33 states have internal predecessors, (4885), 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 22:03:08,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:03:08,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:03:08,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-29 22:03:08,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-29 22:03:08,495 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:03:08,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:03:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 463363634, now seen corresponding path program 7 times [2023-08-29 22:03:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:03:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015393414] [2023-08-29 22:03:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:03:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:03:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-29 22:03:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:03:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015393414] [2023-08-29 22:03:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015393414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:03:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859084877] [2023-08-29 22:03:10,982 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-29 22:03:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:03:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:03:10,983 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:03:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-29 22:03:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:03:11,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-29 22:03:11,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:03:11,145 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 7 treesize of output 6 [2023-08-29 22:03:11,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:11,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:03:11,258 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 13 treesize of output 15 [2023-08-29 22:03:11,284 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 13 treesize of output 15 [2023-08-29 22:03:11,313 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 22:03:11,376 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:03:11,376 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 19 treesize of output 11 [2023-08-29 22:03:11,455 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 18 treesize of output 13 [2023-08-29 22:03:11,497 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 22:03:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:03:11,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:11,572 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1891 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1891) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 22:03:11,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 22:03:11,686 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 12 treesize of output 8 [2023-08-29 22:03:11,691 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1890 Int) (v_ArrVal_1891 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_114| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_115| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_115| |v_t_funThread2of2ForFork0_~p~0#1.offset_114|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_115| v_ArrVal_1890)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1891) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_114|)))) is different from false [2023-08-29 22:03:11,877 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1890 Int) (v_ArrVal_1891 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_114| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_115| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_115| |v_t_funThread2of2ForFork0_~p~0#1.offset_114|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1886))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_115| v_ArrVal_1890))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1891) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_114|) 0))) is different from false [2023-08-29 22:03:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:03:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859084877] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:03:12,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:03:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 7] total 30 [2023-08-29 22:03:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497806349] [2023-08-29 22:03:12,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:03:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 22:03:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:03:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 22:03:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=684, Unknown=9, NotChecked=168, Total=992 [2023-08-29 22:03:12,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 572 [2023-08-29 22:03:12,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 156 transitions, 1407 flow. Second operand has 32 states, 32 states have (on average 147.03125) internal successors, (4705), 32 states have internal predecessors, (4705), 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 22:03:12,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:03:12,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 572 [2023-08-29 22:03:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:03:34,311 WARN L222 SmtUtils]: Spent 22.14s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:03:36,321 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 22:03:38,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:03:40,326 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 22:03:42,328 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 22:03:44,331 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 22:03:46,333 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 22:03:48,335 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 22:03:50,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:03:52,339 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 22:03:54,340 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 22:03:56,342 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 22:03:58,354 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 22:04:00,357 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 22:04:02,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:04,444 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 22:04:06,446 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 22:04:08,449 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 22:04:10,457 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 22:04:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:14,461 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 22:04:16,463 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 22:04:18,504 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 22:04:20,513 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 22:04:22,626 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 22:04:24,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:26,664 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 22:04:28,666 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 22:04:30,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:04:32,680 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 22:04:34,682 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 22:04:36,706 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 22:04:38,731 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 22:04:40,736 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 22:04:42,742 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 22:04:46,352 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 22:04:48,514 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 22:04:50,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 22:04:52,570 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 22:04:54,590 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 22:04:56,591 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 22:04:58,594 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 22:05:00,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 22:05:02,606 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 22:05:04,608 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 22:05:06,859 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 22:05:08,861 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 22:05:10,863 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 22:05:12,041 INFO L130 PetriNetUnfolder]: 1513/3235 cut-off events. [2023-08-29 22:05:12,042 INFO L131 PetriNetUnfolder]: For 15512/15530 co-relation queries the response was YES. [2023-08-29 22:05:12,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15220 conditions, 3235 events. 1513/3235 cut-off events. For 15512/15530 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24433 event pairs, 373 based on Foata normal form. 4/2860 useless extension candidates. Maximal degree in co-relation 15166. Up to 1624 conditions per place. [2023-08-29 22:05:12,062 INFO L137 encePairwiseOnDemand]: 561/572 looper letters, 122 selfloop transitions, 32 changer transitions 48/208 dead transitions. [2023-08-29 22:05:12,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 208 transitions, 2189 flow [2023-08-29 22:05:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 22:05:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 22:05:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3009 transitions. [2023-08-29 22:05:12,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2630244755244755 [2023-08-29 22:05:12,065 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3009 transitions. [2023-08-29 22:05:12,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3009 transitions. [2023-08-29 22:05:12,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:05:12,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3009 transitions. [2023-08-29 22:05:12,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 150.45) internal successors, (3009), 20 states have internal predecessors, (3009), 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 22:05:12,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 22:05:12,074 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 572.0) internal successors, (12012), 21 states have internal predecessors, (12012), 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 22:05:12,074 INFO L175 Difference]: Start difference. First operand has 188 places, 156 transitions, 1407 flow. Second operand 20 states and 3009 transitions. [2023-08-29 22:05:12,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 208 transitions, 2189 flow [2023-08-29 22:05:12,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 208 transitions, 2084 flow, removed 12 selfloop flow, removed 24 redundant places. [2023-08-29 22:05:12,116 INFO L231 Difference]: Finished difference. Result has 180 places, 147 transitions, 1291 flow [2023-08-29 22:05:12,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1291, PETRI_PLACES=180, PETRI_TRANSITIONS=147} [2023-08-29 22:05:12,116 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 77 predicate places. [2023-08-29 22:05:12,117 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 147 transitions, 1291 flow [2023-08-29 22:05:12,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 147.03125) internal successors, (4705), 32 states have internal predecessors, (4705), 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 22:05:12,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:05:12,118 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:05:12,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-29 22:05:12,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-29 22:05:12,318 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:05:12,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:05:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash 58784315, now seen corresponding path program 5 times [2023-08-29 22:05:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:05:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061217030] [2023-08-29 22:05:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:05:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:05:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:05:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061217030] [2023-08-29 22:05:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061217030] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:05:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628165659] [2023-08-29 22:05:12,755 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 22:05:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:05:12,757 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:05:12,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-29 22:05:13,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-29 22:05:13,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:05:13,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-29 22:05:13,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:05:13,119 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 7 treesize of output 6 [2023-08-29 22:05:13,172 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:05:13,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:05:13,188 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 13 treesize of output 15 [2023-08-29 22:05:13,206 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 13 treesize of output 15 [2023-08-29 22:05:13,239 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 22:05:13,273 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:05:13,273 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 19 treesize of output 11 [2023-08-29 22:05:13,331 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 18 treesize of output 13 [2023-08-29 22:05:13,374 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 22:05:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:05:13,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:05:13,401 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1981) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 22:05:13,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-29 22:05:13,492 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 12 treesize of output 8 [2023-08-29 22:05:13,498 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 Int) (v_ArrVal_1981 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_117| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_117| |v_t_funThread2of2ForFork0_~p~0#1.offset_116|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1980)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1981) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_117|)))) is different from false [2023-08-29 22:05:13,523 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1981 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_117| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_116| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_117| |v_t_funThread2of2ForFork0_~p~0#1.offset_116|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1976))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_116| v_ArrVal_1980))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1981) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_117|) 0))) is different from false [2023-08-29 22:05:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:05:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628165659] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:05:13,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:05:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2023-08-29 22:05:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158024667] [2023-08-29 22:05:13,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:05:13,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 22:05:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:05:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 22:05:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=278, Unknown=5, NotChecked=108, Total=462 [2023-08-29 22:05:13,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 572 [2023-08-29 22:05:13,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 147 transitions, 1291 flow. Second operand has 22 states, 22 states have (on average 151.5) internal successors, (3333), 22 states have internal predecessors, (3333), 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 22:05:13,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:05:13,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 572 [2023-08-29 22:05:13,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:05:15,867 INFO L130 PetriNetUnfolder]: 1430/3130 cut-off events. [2023-08-29 22:05:15,868 INFO L131 PetriNetUnfolder]: For 14042/14054 co-relation queries the response was YES. [2023-08-29 22:05:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14131 conditions, 3130 events. 1430/3130 cut-off events. For 14042/14054 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23857 event pairs, 377 based on Foata normal form. 9/2775 useless extension candidates. Maximal degree in co-relation 14081. Up to 1236 conditions per place. [2023-08-29 22:05:15,885 INFO L137 encePairwiseOnDemand]: 556/572 looper letters, 117 selfloop transitions, 20 changer transitions 94/237 dead transitions. [2023-08-29 22:05:15,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 237 transitions, 2259 flow [2023-08-29 22:05:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-29 22:05:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-29 22:05:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2825 transitions. [2023-08-29 22:05:15,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27437839937839936 [2023-08-29 22:05:15,888 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2825 transitions. [2023-08-29 22:05:15,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2825 transitions. [2023-08-29 22:05:15,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:05:15,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2825 transitions. [2023-08-29 22:05:15,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 156.94444444444446) internal successors, (2825), 18 states have internal predecessors, (2825), 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 22:05:15,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 572.0) internal successors, (10868), 19 states have internal predecessors, (10868), 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 22:05:15,897 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 572.0) internal successors, (10868), 19 states have internal predecessors, (10868), 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 22:05:15,897 INFO L175 Difference]: Start difference. First operand has 180 places, 147 transitions, 1291 flow. Second operand 18 states and 2825 transitions. [2023-08-29 22:05:15,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 237 transitions, 2259 flow [2023-08-29 22:05:15,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 2155 flow, removed 13 selfloop flow, removed 24 redundant places. [2023-08-29 22:05:15,941 INFO L231 Difference]: Finished difference. Result has 174 places, 132 transitions, 1131 flow [2023-08-29 22:05:15,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1131, PETRI_PLACES=174, PETRI_TRANSITIONS=132} [2023-08-29 22:05:15,941 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 71 predicate places. [2023-08-29 22:05:15,942 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 132 transitions, 1131 flow [2023-08-29 22:05:15,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.5) internal successors, (3333), 22 states have internal predecessors, (3333), 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 22:05:15,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:05:15,942 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:05:15,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-29 22:05:16,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:16,149 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:05:16,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:05:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -411737115, now seen corresponding path program 6 times [2023-08-29 22:05:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:05:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670751937] [2023-08-29 22:05:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:05:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:05:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:05:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670751937] [2023-08-29 22:05:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670751937] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:05:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969955608] [2023-08-29 22:05:16,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 22:05:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:05:16,761 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:05:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-29 22:05:17,116 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-29 22:05:17,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:05:17,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-29 22:05:17,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:05:17,127 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 7 treesize of output 6 [2023-08-29 22:05:17,286 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-29 22:05:17,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-29 22:05:17,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 15 [2023-08-29 22:05:17,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 15 [2023-08-29 22:05:17,434 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 22:05:17,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:05:17,519 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 22:05:17,553 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 18 treesize of output 13 [2023-08-29 22:05:17,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 22:05:17,601 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 22:05:17,650 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:05:17,650 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 19 treesize of output 11 [2023-08-29 22:05:17,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 18 [2023-08-29 22:05:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-29 22:05:17,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:05:17,771 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-29 22:05:17,863 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2072 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_119| Int) (v_ArrVal_2070 Int) (v_ArrVal_2073 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2072) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_119|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2070)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_119|) 0))) is different from false [2023-08-29 22:05:17,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:05:17,903 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 23 treesize of output 24 [2023-08-29 22:05:17,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 22:05:17,913 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 39 treesize of output 35 [2023-08-29 22:05:17,918 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 22 treesize of output 18 [2023-08-29 22:05:18,258 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_119| Int) (v_ArrVal_2070 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2070)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_119|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_119| |v_t_funThread2of2ForFork0_~p~0#1.offset_118|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_119| Int) (v_ArrVal_2070 Int) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2070)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_119|) 0))))) is different from false [2023-08-29 22:05:18,300 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2066 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_119| Int) (v_ArrVal_2070 Int) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2070))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_119|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_119| |v_t_funThread2of2ForFork0_~p~0#1.offset_118|))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_118| Int) (v_ArrVal_2066 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_119| Int) (v_ArrVal_2070 Int) (v_ArrVal_2073 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_118| v_ArrVal_2070))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2073) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_119|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-29 22:05:26,428 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:05:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-29 22:05:26,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969955608] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 22:05:26,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 22:05:26,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 23 [2023-08-29 22:05:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281711417] [2023-08-29 22:05:26,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 22:05:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 22:05:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 22:05:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 22:05:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=342, Unknown=9, NotChecked=164, Total=600 [2023-08-29 22:05:26,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 572 [2023-08-29 22:05:26,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 132 transitions, 1131 flow. Second operand has 25 states, 25 states have (on average 150.2) internal successors, (3755), 25 states have internal predecessors, (3755), 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 22:05:26,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 22:05:26,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 572 [2023-08-29 22:05:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 22:05:27,895 INFO L130 PetriNetUnfolder]: 1097/2347 cut-off events. [2023-08-29 22:05:27,895 INFO L131 PetriNetUnfolder]: For 12206/12206 co-relation queries the response was YES. [2023-08-29 22:05:27,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11726 conditions, 2347 events. 1097/2347 cut-off events. For 12206/12206 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16409 event pairs, 245 based on Foata normal form. 2/2083 useless extension candidates. Maximal degree in co-relation 11675. Up to 1135 conditions per place. [2023-08-29 22:05:27,911 INFO L137 encePairwiseOnDemand]: 557/572 looper letters, 121 selfloop transitions, 31 changer transitions 19/177 dead transitions. [2023-08-29 22:05:27,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 177 transitions, 1820 flow [2023-08-29 22:05:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 22:05:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 22:05:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1718 transitions. [2023-08-29 22:05:27,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2730451366815003 [2023-08-29 22:05:27,913 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1718 transitions. [2023-08-29 22:05:27,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1718 transitions. [2023-08-29 22:05:27,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:05:27,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1718 transitions. [2023-08-29 22:05:27,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 156.1818181818182) internal successors, (1718), 11 states have internal predecessors, (1718), 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 22:05:27,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 572.0) internal successors, (6864), 12 states have internal predecessors, (6864), 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 22:05:27,917 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 572.0) internal successors, (6864), 12 states have internal predecessors, (6864), 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 22:05:27,917 INFO L175 Difference]: Start difference. First operand has 174 places, 132 transitions, 1131 flow. Second operand 11 states and 1718 transitions. [2023-08-29 22:05:27,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 177 transitions, 1820 flow [2023-08-29 22:05:27,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 177 transitions, 1722 flow, removed 29 selfloop flow, removed 15 redundant places. [2023-08-29 22:05:27,943 INFO L231 Difference]: Finished difference. Result has 154 places, 140 transitions, 1212 flow [2023-08-29 22:05:27,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=572, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1212, PETRI_PLACES=154, PETRI_TRANSITIONS=140} [2023-08-29 22:05:27,943 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 51 predicate places. [2023-08-29 22:05:27,943 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 140 transitions, 1212 flow [2023-08-29 22:05:27,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 150.2) internal successors, (3755), 25 states have internal predecessors, (3755), 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 22:05:27,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:05:27,944 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:05:27,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-29 22:05:28,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:28,145 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:05:28,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:05:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -978506476, now seen corresponding path program 1 times [2023-08-29 22:05:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:05:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655839537] [2023-08-29 22:05:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:05:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:05:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:05:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655839537] [2023-08-29 22:05:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655839537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:05:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090538296] [2023-08-29 22:05:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:05:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:05:28,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:05:28,445 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 22:05:28,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-29 22:05:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:05:28,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-29 22:05:28,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:05:28,652 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 7 treesize of output 6 [2023-08-29 22:05:28,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 22:05:28,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 22:05:28,739 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 13 treesize of output 15 [2023-08-29 22:05:28,828 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 13 treesize of output 15 [2023-08-29 22:05:28,887 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 24 treesize of output 17 [2023-08-29 22:05:28,981 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 25 [2023-08-29 22:05:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:05:29,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... Killed by 15