./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_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_73-funloop_hard_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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --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:49:50,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:49:50,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:49:50,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:49:50,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:49:50,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:49:50,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:49:50,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:49:50,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:49:50,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:49:50,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:49:50,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:49:50,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:49:50,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:49:50,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:49:50,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:49:50,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:49:50,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:49:50,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:49:50,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:49:50,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:49:50,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:49:50,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:49:50,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:49:50,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:49:50,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:49:50,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:49:50,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:49:50,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:49:50,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:49:50,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:49:50,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:49:50,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:49:50,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:49:50,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:49:50,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:49:50,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:49:50,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:49:50,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:49:50,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:49:50,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:49:50,777 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:49:50,812 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:49:50,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:49:50,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:49:50,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:49:50,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:49:50,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:49:50,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:49:50,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:49:50,815 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:49:50,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:49:50,816 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:49:50,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:49:50,817 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:49:50,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:49:50,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:49:50,818 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:49:50,818 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:49:50,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:49:50,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:49:50,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:49:50,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:49:50,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:49:50,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:49:50,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:49:50,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:49:50,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:49:50,820 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:49:50,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:49:50,821 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:49:50,821 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 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:49:51,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:49:51,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:49:51,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:49:51,136 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:49:51,137 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:49:51,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-29 21:49:52,248 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:49:52,548 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:49:52,549 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-29 21:49:52,564 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09e40806/a0bca38e9bbf466cbdfe286784d40dbf/FLAG3d52a41cc [2023-08-29 21:49:52,578 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09e40806/a0bca38e9bbf466cbdfe286784d40dbf [2023-08-29 21:49:52,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:49:52,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:49:52,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:49:52,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:49:52,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:49:52,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:49:52" (1/1) ... [2023-08-29 21:49:52,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2f3698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:52, skipping insertion in model container [2023-08-29 21:49:52,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:49:52" (1/1) ... [2023-08-29 21:49:52,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:49:52,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:49:52,961 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_73-funloop_hard_racefree.i[41323,41336] [2023-08-29 21:49:53,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:49:53,023 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:49:53,060 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_73-funloop_hard_racefree.i[41323,41336] [2023-08-29 21:49:53,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:49:53,127 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:49:53,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53 WrapperNode [2023-08-29 21:49:53,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:49:53,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:49:53,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:49:53,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:49:53,135 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:49:53" (1/1) ... [2023-08-29 21:49:53,162 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:49:53" (1/1) ... [2023-08-29 21:49:53,202 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-08-29 21:49:53,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:49:53,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:49:53,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:49:53,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:49:53,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:49:53,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:49:53,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:49:53,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:49:53,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (1/1) ... [2023-08-29 21:49:53,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:49:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:49:53,309 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:49:53,331 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:49:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:49:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:49:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:49:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:49:53,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:49:53,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:49:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 21:49:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 21:49:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:49:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:49:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:49:53,351 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:49:53,508 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:49:53,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:49:53,887 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:49:53,895 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:49:53,896 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-29 21:49:53,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:49:53 BoogieIcfgContainer [2023-08-29 21:49:53,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:49:53,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:49:53,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:49:53,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:49:53,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:49:52" (1/3) ... [2023-08-29 21:49:53,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b07da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:49:53, skipping insertion in model container [2023-08-29 21:49:53,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:53" (2/3) ... [2023-08-29 21:49:53,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b07da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:49:53, skipping insertion in model container [2023-08-29 21:49:53,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:49:53" (3/3) ... [2023-08-29 21:49:53,905 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-08-29 21:49:53,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:49:53,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-08-29 21:49:53,920 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:49:54,024 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:49:54,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,190 INFO L130 PetriNetUnfolder]: 73/446 cut-off events. [2023-08-29 21:49:54,190 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:49:54,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 446 events. 73/446 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2298 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-29 21:49:54,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,213 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:49:54,223 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,226 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 284 transitions, 576 flow [2023-08-29 21:49:54,288 INFO L130 PetriNetUnfolder]: 73/446 cut-off events. [2023-08-29 21:49:54,288 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:49:54,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 446 events. 73/446 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2298 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-29 21:49:54,303 INFO L119 LiptonReduction]: Number of co-enabled transitions 26544 [2023-08-29 21:49:58,511 INFO L134 LiptonReduction]: Checked pairs total: 53426 [2023-08-29 21:49:58,511 INFO L136 LiptonReduction]: Total number of compositions: 259 [2023-08-29 21:49:58,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:49:58,542 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;@63c3a305, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:49:58,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-08-29 21:49:58,546 INFO L130 PetriNetUnfolder]: 1/5 cut-off events. [2023-08-29 21:49:58,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:49:58,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:49:58,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:49:58,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:49:58,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:49:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1105630, now seen corresponding path program 1 times [2023-08-29 21:49:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:49:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996081631] [2023-08-29 21:49:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:49:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:49:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:49:58,777 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:49:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:49:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996081631] [2023-08-29 21:49:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996081631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:49:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:49:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:49:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936660444] [2023-08-29 21:49:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:49:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:49:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:49:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:49:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:49:58,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 543 [2023-08-29 21:49:58,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:49:58,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:49:58,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 543 [2023-08-29 21:49:58,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:49:59,170 INFO L130 PetriNetUnfolder]: 1102/2408 cut-off events. [2023-08-29 21:49:59,170 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:49:59,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 2408 events. 1102/2408 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17546 event pairs, 940 based on Foata normal form. 184/1699 useless extension candidates. Maximal degree in co-relation 4358. Up to 2070 conditions per place. [2023-08-29 21:49:59,184 INFO L137 encePairwiseOnDemand]: 499/543 looper letters, 74 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-29 21:49:59,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 348 flow [2023-08-29 21:49:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:49:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:49:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2023-08-29 21:49:59,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089011663597299 [2023-08-29 21:49:59,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 829 transitions. [2023-08-29 21:49:59,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 829 transitions. [2023-08-29 21:49:59,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:49:59,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 829 transitions. [2023-08-29 21:49:59,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have 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:49:59,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:49:59,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:49:59,227 INFO L175 Difference]: Start difference. First operand has 99 places, 134 transitions, 276 flow. Second operand 3 states and 829 transitions. [2023-08-29 21:49:59,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 348 flow [2023-08-29 21:49:59,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:49:59,234 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 206 flow [2023-08-29 21:49:59,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-08-29 21:49:59,239 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 21:49:59,240 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 206 flow [2023-08-29 21:49:59,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have 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:49:59,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:49:59,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:49:59,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:49:59,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:49:59,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:49:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 34306258, now seen corresponding path program 1 times [2023-08-29 21:49:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:49:59,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905729617] [2023-08-29 21:49:59,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:49:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:49:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:49:59,327 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:49:59,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:49:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905729617] [2023-08-29 21:49:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905729617] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:49:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412421520] [2023-08-29 21:49:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:49:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:49:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:49:59,332 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:49:59,370 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:49:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:49:59,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:49:59,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:49:59,451 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:49:59,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:49:59,463 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:49:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412421520] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:49:59,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:49:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:49:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792524856] [2023-08-29 21:49:59,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:49:59,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:49:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:49:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:49:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:49:59,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:49:59,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have 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:49:59,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:49:59,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:49:59,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:49:59,900 INFO L130 PetriNetUnfolder]: 1102/2411 cut-off events. [2023-08-29 21:49:59,900 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:49:59,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 2411 events. 1102/2411 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17503 event pairs, 940 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 4490. Up to 2070 conditions per place. [2023-08-29 21:49:59,911 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-29 21:49:59,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 376 flow [2023-08-29 21:49:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:49:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:49:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1498 transitions. [2023-08-29 21:49:59,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597912829957029 [2023-08-29 21:49:59,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1498 transitions. [2023-08-29 21:49:59,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1498 transitions. [2023-08-29 21:49:59,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:49:59,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1498 transitions. [2023-08-29 21:49:59,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.66666666666666) internal successors, (1498), 6 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have 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:49:59,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:59,927 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:59,927 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 206 flow. Second operand 6 states and 1498 transitions. [2023-08-29 21:49:59,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 376 flow [2023-08-29 21:49:59,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:49:59,931 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 238 flow [2023-08-29 21:49:59,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-29 21:49:59,932 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:49:59,932 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 238 flow [2023-08-29 21:49:59,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have 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:49:59,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:49:59,933 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:49:59,943 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:50:00,139 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:50:00,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:00,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -152978466, now seen corresponding path program 2 times [2023-08-29 21:50:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:00,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295101806] [2023-08-29 21:50:00,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:00,226 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:50:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295101806] [2023-08-29 21:50:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295101806] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270525881] [2023-08-29 21:50:00,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:50:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:00,233 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:50:00,253 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:50:00,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 21:50:00,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:50:00,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 21:50:00,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:00,343 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:50:00,356 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:50:00,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:50:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270525881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:50:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-29 21:50:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559188094] [2023-08-29 21:50:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:00,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:50:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:50:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:50:00,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:50:00,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have 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:50:00,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:00,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:50:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:00,778 INFO L130 PetriNetUnfolder]: 1053/2271 cut-off events. [2023-08-29 21:50:00,778 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 21:50:00,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 2271 events. 1053/2271 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16982 event pairs, 0 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 4320. Up to 2009 conditions per place. [2023-08-29 21:50:00,789 INFO L137 encePairwiseOnDemand]: 539/543 looper letters, 100 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-08-29 21:50:00,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 488 flow [2023-08-29 21:50:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:50:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:50:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2023-08-29 21:50:00,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960098219766728 [2023-08-29 21:50:00,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2023-08-29 21:50:00,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2023-08-29 21:50:00,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:00,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2023-08-29 21:50:00,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have 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:50:00,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:50:00,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:50:00,799 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 238 flow. Second operand 3 states and 808 transitions. [2023-08-29 21:50:00,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 488 flow [2023-08-29 21:50:00,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 120 transitions, 474 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:50:00,805 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 234 flow [2023-08-29 21:50:00,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2023-08-29 21:50:00,806 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2023-08-29 21:50:00,806 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 234 flow [2023-08-29 21:50:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have 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:50:00,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:00,807 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:50:00,819 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:50:01,013 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,SelfDestructingSolverStorable2 [2023-08-29 21:50:01,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:01,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -152978465, now seen corresponding path program 1 times [2023-08-29 21:50:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367284865] [2023-08-29 21:50:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:01,101 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:50:01,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367284865] [2023-08-29 21:50:01,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367284865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:50:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:50:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416142199] [2023-08-29 21:50:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:01,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:50:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:50:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:50:01,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 543 [2023-08-29 21:50:01,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have 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:50:01,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:01,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 543 [2023-08-29 21:50:01,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:01,462 INFO L130 PetriNetUnfolder]: 1050/2235 cut-off events. [2023-08-29 21:50:01,463 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 21:50:01,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 2235 events. 1050/2235 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15923 event pairs, 860 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 4264. Up to 1855 conditions per place. [2023-08-29 21:50:01,473 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 95 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-29 21:50:01,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 468 flow [2023-08-29 21:50:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:50:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:50:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2023-08-29 21:50:01,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880294659300184 [2023-08-29 21:50:01,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2023-08-29 21:50:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2023-08-29 21:50:01,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:01,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2023-08-29 21:50:01,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:01,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:50:01,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 543.0) internal successors, (2172), 4 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have 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:50:01,482 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 234 flow. Second operand 3 states and 795 transitions. [2023-08-29 21:50:01,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 468 flow [2023-08-29 21:50:01,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 116 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:50:01,488 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 232 flow [2023-08-29 21:50:01,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2023-08-29 21:50:01,490 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:50:01,490 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 232 flow [2023-08-29 21:50:01,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have 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:50:01,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:01,491 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 21:50:01,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:01,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -420381068, now seen corresponding path program 1 times [2023-08-29 21:50:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625389285] [2023-08-29 21:50:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:50:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625389285] [2023-08-29 21:50:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625389285] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566581672] [2023-08-29 21:50:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:01,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:01,595 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:50:01,620 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:50:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:01,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:50:01,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:50:01,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:50:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566581672] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:01,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:01,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:50:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785642632] [2023-08-29 21:50:01,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:50:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:50:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:50:01,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:50:01,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 232 flow. Second operand has 13 states, 13 states have (on average 237.3846153846154) internal successors, (3086), 13 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have 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:50:01,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:01,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:50:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:02,094 INFO L130 PetriNetUnfolder]: 1052/2243 cut-off events. [2023-08-29 21:50:02,095 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 21:50:02,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4342 conditions, 2243 events. 1052/2243 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15945 event pairs, 900 based on Foata normal form. 6/1514 useless extension candidates. Maximal degree in co-relation 4289. Up to 1944 conditions per place. [2023-08-29 21:50:02,107 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 72 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2023-08-29 21:50:02,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 434 flow [2023-08-29 21:50:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:50:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:50:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2921 transitions. [2023-08-29 21:50:02,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44828115408225905 [2023-08-29 21:50:02,127 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2921 transitions. [2023-08-29 21:50:02,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2921 transitions. [2023-08-29 21:50:02,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:02,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2921 transitions. [2023-08-29 21:50:02,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 243.41666666666666) internal successors, (2921), 12 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states have 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:50:02,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states have 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:50:02,145 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states have 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:50:02,145 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 232 flow. Second operand 12 states and 2921 transitions. [2023-08-29 21:50:02,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 434 flow [2023-08-29 21:50:02,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:50:02,148 INFO L231 Difference]: Finished difference. Result has 114 places, 101 transitions, 310 flow [2023-08-29 21:50:02,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=114, PETRI_TRANSITIONS=101} [2023-08-29 21:50:02,149 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 15 predicate places. [2023-08-29 21:50:02,149 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 101 transitions, 310 flow [2023-08-29 21:50:02,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 237.3846153846154) internal successors, (3086), 13 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have 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:50:02,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:02,151 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:02,159 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:50:02,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:02,356 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:02,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -410340620, now seen corresponding path program 2 times [2023-08-29 21:50:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102510440] [2023-08-29 21:50:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:02,538 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:50:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:02,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102510440] [2023-08-29 21:50:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102510440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751035426] [2023-08-29 21:50:02,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:50:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:02,540 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:50:02,542 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:50:02,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:50:02,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:50:02,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 21:50:02,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:02,632 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:50:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:02,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:50:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751035426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:02,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:50:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 21:50:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137749822] [2023-08-29 21:50:02,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:02,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:50:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:50:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:50:02,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 543 [2023-08-29 21:50:02,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have 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:50:02,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:02,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 543 [2023-08-29 21:50:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:03,066 INFO L130 PetriNetUnfolder]: 1030/2189 cut-off events. [2023-08-29 21:50:03,067 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-29 21:50:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2189 events. 1030/2189 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15449 event pairs, 574 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 4138. Up to 1789 conditions per place. [2023-08-29 21:50:03,078 INFO L137 encePairwiseOnDemand]: 538/543 looper letters, 121 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-08-29 21:50:03,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 143 transitions, 642 flow [2023-08-29 21:50:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:50:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:50:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1056 transitions. [2023-08-29 21:50:03,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861878453038674 [2023-08-29 21:50:03,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1056 transitions. [2023-08-29 21:50:03,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1056 transitions. [2023-08-29 21:50:03,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:03,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1056 transitions. [2023-08-29 21:50:03,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:03,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have 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:50:03,089 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have 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:50:03,089 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 310 flow. Second operand 4 states and 1056 transitions. [2023-08-29 21:50:03,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 143 transitions, 642 flow [2023-08-29 21:50:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 594 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:50:03,093 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 266 flow [2023-08-29 21:50:03,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2023-08-29 21:50:03,094 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2023-08-29 21:50:03,094 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 266 flow [2023-08-29 21:50:03,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 236.75) internal successors, (947), 4 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have 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:50:03,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:03,095 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:03,103 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:50:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:03,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:03,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 799200132, now seen corresponding path program 1 times [2023-08-29 21:50:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:03,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173849077] [2023-08-29 21:50:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:03,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:03,558 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:50:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173849077] [2023-08-29 21:50:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173849077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:03,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:50:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:50:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893900630] [2023-08-29 21:50:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:03,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:50:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:50:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:50:04,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 543 [2023-08-29 21:50:04,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 209.28571428571428) internal successors, (1465), 7 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have 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:50:04,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:04,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 543 [2023-08-29 21:50:04,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:04,795 INFO L130 PetriNetUnfolder]: 1679/3674 cut-off events. [2023-08-29 21:50:04,795 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-08-29 21:50:04,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 3674 events. 1679/3674 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 28723 event pairs, 825 based on Foata normal form. 118/2707 useless extension candidates. Maximal degree in co-relation 7013. Up to 1603 conditions per place. [2023-08-29 21:50:04,816 INFO L137 encePairwiseOnDemand]: 526/543 looper letters, 238 selfloop transitions, 18 changer transitions 0/273 dead transitions. [2023-08-29 21:50:04,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 273 transitions, 1154 flow [2023-08-29 21:50:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 21:50:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 21:50:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2358 transitions. [2023-08-29 21:50:04,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43425414364640885 [2023-08-29 21:50:04,822 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2358 transitions. [2023-08-29 21:50:04,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2358 transitions. [2023-08-29 21:50:04,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:04,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2358 transitions. [2023-08-29 21:50:04,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 235.8) internal successors, (2358), 10 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have 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:50:04,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 543.0) internal successors, (5973), 11 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states have 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:50:04,836 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 543.0) internal successors, (5973), 11 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states have 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:50:04,836 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 266 flow. Second operand 10 states and 2358 transitions. [2023-08-29 21:50:04,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 273 transitions, 1154 flow [2023-08-29 21:50:04,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 273 transitions, 1128 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:50:04,840 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 350 flow [2023-08-29 21:50:04,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2023-08-29 21:50:04,841 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 16 predicate places. [2023-08-29 21:50:04,841 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 350 flow [2023-08-29 21:50:04,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.28571428571428) internal successors, (1465), 7 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have 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:50:04,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:04,842 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:04,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:50:04,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:04,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash -994605132, now seen corresponding path program 1 times [2023-08-29 21:50:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946630712] [2023-08-29 21:50:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:04,974 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:50:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946630712] [2023-08-29 21:50:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946630712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:50:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:50:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510054396] [2023-08-29 21:50:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:50:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:50:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:50:05,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 543 [2023-08-29 21:50:05,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have 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:50:05,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:05,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 543 [2023-08-29 21:50:05,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:05,674 INFO L130 PetriNetUnfolder]: 1558/3301 cut-off events. [2023-08-29 21:50:05,674 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2023-08-29 21:50:05,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7367 conditions, 3301 events. 1558/3301 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 24629 event pairs, 37 based on Foata normal form. 0/2745 useless extension candidates. Maximal degree in co-relation 7309. Up to 2706 conditions per place. [2023-08-29 21:50:05,692 INFO L137 encePairwiseOnDemand]: 528/543 looper letters, 146 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2023-08-29 21:50:05,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 179 transitions, 870 flow [2023-08-29 21:50:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 21:50:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 21:50:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1206 transitions. [2023-08-29 21:50:05,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44419889502762433 [2023-08-29 21:50:05,695 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1206 transitions. [2023-08-29 21:50:05,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1206 transitions. [2023-08-29 21:50:05,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:05,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1206 transitions. [2023-08-29 21:50:05,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.2) internal successors, (1206), 5 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have 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:50:05,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have 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:50:05,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 543.0) internal successors, (3258), 6 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have 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:50:05,703 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 350 flow. Second operand 5 states and 1206 transitions. [2023-08-29 21:50:05,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 179 transitions, 870 flow [2023-08-29 21:50:05,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 179 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:50:05,737 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 483 flow [2023-08-29 21:50:05,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2023-08-29 21:50:05,738 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 22 predicate places. [2023-08-29 21:50:05,738 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 483 flow [2023-08-29 21:50:05,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have 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:50:05,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:05,739 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:05,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:50:05,740 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:05,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash -994604930, now seen corresponding path program 1 times [2023-08-29 21:50:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:05,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694790922] [2023-08-29 21:50:05,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:05,915 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:50:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694790922] [2023-08-29 21:50:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694790922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:50:05,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:50:05,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:50:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031786111] [2023-08-29 21:50:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:50:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:50:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:05,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:50:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:50:06,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 543 [2023-08-29 21:50:06,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have 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:50:06,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:06,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 543 [2023-08-29 21:50:06,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:07,011 INFO L130 PetriNetUnfolder]: 2241/4916 cut-off events. [2023-08-29 21:50:07,012 INFO L131 PetriNetUnfolder]: For 2509/2582 co-relation queries the response was YES. [2023-08-29 21:50:07,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 4916 events. 2241/4916 cut-off events. For 2509/2582 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 39656 event pairs, 230 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 12237. Up to 2657 conditions per place. [2023-08-29 21:50:07,038 INFO L137 encePairwiseOnDemand]: 529/543 looper letters, 227 selfloop transitions, 39 changer transitions 1/287 dead transitions. [2023-08-29 21:50:07,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 287 transitions, 1640 flow [2023-08-29 21:50:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:50:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:50:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1745 transitions. [2023-08-29 21:50:07,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590897132333596 [2023-08-29 21:50:07,042 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1745 transitions. [2023-08-29 21:50:07,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1745 transitions. [2023-08-29 21:50:07,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:07,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1745 transitions. [2023-08-29 21:50:07,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 249.28571428571428) internal successors, (1745), 7 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have 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:50:07,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 543.0) internal successors, (4344), 8 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have 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:50:07,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 543.0) internal successors, (4344), 8 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have 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:50:07,051 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 483 flow. Second operand 7 states and 1745 transitions. [2023-08-29 21:50:07,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 287 transitions, 1640 flow [2023-08-29 21:50:07,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 287 transitions, 1640 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:50:07,078 INFO L231 Difference]: Finished difference. Result has 133 places, 155 transitions, 902 flow [2023-08-29 21:50:07,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=902, PETRI_PLACES=133, PETRI_TRANSITIONS=155} [2023-08-29 21:50:07,078 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 34 predicate places. [2023-08-29 21:50:07,079 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 902 flow [2023-08-29 21:50:07,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have 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:50:07,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:07,079 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:07,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 21:50:07,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:07,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash -980779733, now seen corresponding path program 1 times [2023-08-29 21:50:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:07,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373158961] [2023-08-29 21:50:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:07,120 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:50:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373158961] [2023-08-29 21:50:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373158961] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342780771] [2023-08-29 21:50:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:07,122 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:50:07,153 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:50:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:07,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:50:07,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:07,253 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:50:07,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:07,267 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:50:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342780771] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:07,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:07,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-29 21:50:07,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602579852] [2023-08-29 21:50:07,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:07,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:50:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:07,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:50:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:50:07,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 543 [2023-08-29 21:50:07,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 902 flow. Second operand has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have 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:50:07,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:07,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 543 [2023-08-29 21:50:07,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:07,361 INFO L130 PetriNetUnfolder]: 105/327 cut-off events. [2023-08-29 21:50:07,361 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2023-08-29 21:50:07,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 327 events. 105/327 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1384 event pairs, 26 based on Foata normal form. 46/362 useless extension candidates. Maximal degree in co-relation 1055. Up to 213 conditions per place. [2023-08-29 21:50:07,363 INFO L137 encePairwiseOnDemand]: 540/543 looper letters, 67 selfloop transitions, 2 changer transitions 2/77 dead transitions. [2023-08-29 21:50:07,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 77 transitions, 569 flow [2023-08-29 21:50:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:50:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:50:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 988 transitions. [2023-08-29 21:50:07,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548802946593002 [2023-08-29 21:50:07,366 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 988 transitions. [2023-08-29 21:50:07,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 988 transitions. [2023-08-29 21:50:07,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:07,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 988 transitions. [2023-08-29 21:50:07,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have 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:50:07,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have 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:50:07,372 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 543.0) internal successors, (2715), 5 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have 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:50:07,372 INFO L175 Difference]: Start difference. First operand has 133 places, 155 transitions, 902 flow. Second operand 4 states and 988 transitions. [2023-08-29 21:50:07,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 77 transitions, 569 flow [2023-08-29 21:50:07,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 489 flow, removed 28 selfloop flow, removed 11 redundant places. [2023-08-29 21:50:07,376 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 241 flow [2023-08-29 21:50:07,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-29 21:50:07,377 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places. [2023-08-29 21:50:07,377 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 241 flow [2023-08-29 21:50:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have 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:50:07,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:07,378 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:07,383 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:50:07,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-29 21:50:07,578 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:07,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1970517683, now seen corresponding path program 1 times [2023-08-29 21:50:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798617279] [2023-08-29 21:50:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:07,826 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:50:07,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798617279] [2023-08-29 21:50:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798617279] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356466947] [2023-08-29 21:50:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:07,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:07,829 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:50:07,853 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:50:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:07,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 21:50:07,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:07,943 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:50:08,011 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:50:08,011 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:50:08,036 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:50:08,080 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:50:08,094 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:50:08,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:14,129 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:50:16,141 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:50:16,249 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:50:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356466947] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:16,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-29 21:50:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394410703] [2023-08-29 21:50:16,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:16,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:50:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:50:16,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=81, Unknown=4, NotChecked=38, Total=156 [2023-08-29 21:50:16,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 543 [2023-08-29 21:50:16,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 241 flow. Second operand has 13 states, 13 states have (on average 166.3846153846154) internal successors, (2163), 13 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have 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:50:16,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:16,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 543 [2023-08-29 21:50:16,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:18,552 INFO L130 PetriNetUnfolder]: 105/312 cut-off events. [2023-08-29 21:50:18,553 INFO L131 PetriNetUnfolder]: For 309/315 co-relation queries the response was YES. [2023-08-29 21:50:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 312 events. 105/312 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1210 event pairs, 16 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 910. Up to 131 conditions per place. [2023-08-29 21:50:18,554 INFO L137 encePairwiseOnDemand]: 536/543 looper letters, 56 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-08-29 21:50:18,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 436 flow [2023-08-29 21:50:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:50:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:50:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1031 transitions. [2023-08-29 21:50:18,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164518109269491 [2023-08-29 21:50:18,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1031 transitions. [2023-08-29 21:50:18,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1031 transitions. [2023-08-29 21:50:18,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:18,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1031 transitions. [2023-08-29 21:50:18,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have 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:50:18,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:18,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 543.0) internal successors, (3801), 7 states have internal predecessors, (3801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:18,565 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 241 flow. Second operand 6 states and 1031 transitions. [2023-08-29 21:50:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 436 flow [2023-08-29 21:50:18,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:50:18,568 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 257 flow [2023-08-29 21:50:18,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-08-29 21:50:18,568 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -27 predicate places. [2023-08-29 21:50:18,568 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 257 flow [2023-08-29 21:50:18,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.3846153846154) internal successors, (2163), 13 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have 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:50:18,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:18,569 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:18,577 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:50:18,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:18,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:18,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1303397320, now seen corresponding path program 1 times [2023-08-29 21:50:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:18,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145669565] [2023-08-29 21:50:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145669565] [2023-08-29 21:50:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145669565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837116424] [2023-08-29 21:50:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:19,129 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:50:19,140 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:50:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:19,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 21:50:19,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:19,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:50:19,349 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:50:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:19,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:19,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837116424] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:19,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2023-08-29 21:50:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335852721] [2023-08-29 21:50:19,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:19,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-29 21:50:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-29 21:50:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-08-29 21:50:21,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 543 [2023-08-29 21:50:21,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 257 flow. Second operand has 19 states, 19 states have (on average 203.21052631578948) internal successors, (3861), 19 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have 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:50:21,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:21,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 543 [2023-08-29 21:50:21,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:21,915 INFO L130 PetriNetUnfolder]: 262/763 cut-off events. [2023-08-29 21:50:21,915 INFO L131 PetriNetUnfolder]: For 655/657 co-relation queries the response was YES. [2023-08-29 21:50:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 763 events. 262/763 cut-off events. For 655/657 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3536 event pairs, 44 based on Foata normal form. 54/784 useless extension candidates. Maximal degree in co-relation 2201. Up to 136 conditions per place. [2023-08-29 21:50:21,919 INFO L137 encePairwiseOnDemand]: 532/543 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2023-08-29 21:50:21,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 982 flow [2023-08-29 21:50:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:50:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:50:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2521 transitions. [2023-08-29 21:50:21,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3868937998772253 [2023-08-29 21:50:21,925 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2521 transitions. [2023-08-29 21:50:21,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2521 transitions. [2023-08-29 21:50:21,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:21,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2521 transitions. [2023-08-29 21:50:21,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 210.08333333333334) internal successors, (2521), 12 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have 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:50:21,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states have 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:50:21,938 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 543.0) internal successors, (7059), 13 states have internal predecessors, (7059), 0 states have call successors, (0), 0 states have 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:50:21,938 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 257 flow. Second operand 12 states and 2521 transitions. [2023-08-29 21:50:21,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 982 flow [2023-08-29 21:50:21,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 151 transitions, 943 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 21:50:21,942 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 408 flow [2023-08-29 21:50:21,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=408, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2023-08-29 21:50:21,943 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -17 predicate places. [2023-08-29 21:50:21,943 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 408 flow [2023-08-29 21:50:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 203.21052631578948) internal successors, (3861), 19 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have 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:50:21,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:21,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] [2023-08-29 21:50:21,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-29 21:50:22,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:22,153 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:22,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1207439431, now seen corresponding path program 1 times [2023-08-29 21:50:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705801056] [2023-08-29 21:50:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:22,640 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:50:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705801056] [2023-08-29 21:50:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705801056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412674901] [2023-08-29 21:50:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:22,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:22,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:22,641 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:50:22,665 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:50:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-29 21:50:22,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:22,774 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:50:22,830 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:50:22,830 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:50:22,850 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:50:22,932 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:50:22,986 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 21 treesize of output 16 [2023-08-29 21:50:26,848 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:50:26,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:36,488 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:50:38,515 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (v_ArrVal_505 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_505)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:50:54,676 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| Int) (v_ArrVal_505 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_501) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_505) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_87|) 0))) is different from false [2023-08-29 21:50:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:50:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412674901] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:54,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:54,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-29 21:50:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206610190] [2023-08-29 21:50:54,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:54,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 21:50:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:54,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 21:50:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=250, Unknown=16, NotChecked=108, Total=462 [2023-08-29 21:50:58,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:59,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:01,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:03,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:04,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:08,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:09,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:51:09,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 408 flow. Second operand has 22 states, 22 states have (on average 160.54545454545453) internal successors, (3532), 22 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have 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:51:09,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:51:09,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:51:09,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:51:11,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:12,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:14,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:15,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:16,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:18,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:20,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:22,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:23,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:24,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:29,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:35,742 INFO L130 PetriNetUnfolder]: 374/1109 cut-off events. [2023-08-29 21:51:35,743 INFO L131 PetriNetUnfolder]: For 1398/1400 co-relation queries the response was YES. [2023-08-29 21:51:35,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 1109 events. 374/1109 cut-off events. For 1398/1400 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5809 event pairs, 28 based on Foata normal form. 12/1078 useless extension candidates. Maximal degree in co-relation 3417. Up to 351 conditions per place. [2023-08-29 21:51:35,749 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 94 selfloop transitions, 41 changer transitions 0/139 dead transitions. [2023-08-29 21:51:35,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 139 transitions, 1107 flow [2023-08-29 21:51:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:51:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:51:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1817 transitions. [2023-08-29 21:51:35,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3042022434287628 [2023-08-29 21:51:35,754 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1817 transitions. [2023-08-29 21:51:35,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1817 transitions. [2023-08-29 21:51:35,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:51:35,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1817 transitions. [2023-08-29 21:51:35,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.1818181818182) internal successors, (1817), 11 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have 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:51:35,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have 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:51:35,765 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have 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:51:35,765 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 408 flow. Second operand 11 states and 1817 transitions. [2023-08-29 21:51:35,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 139 transitions, 1107 flow [2023-08-29 21:51:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 1021 flow, removed 32 selfloop flow, removed 6 redundant places. [2023-08-29 21:51:35,772 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 772 flow [2023-08-29 21:51:35,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=772, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-29 21:51:35,773 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 21:51:35,773 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 772 flow [2023-08-29 21:51:35,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 160.54545454545453) internal successors, (3532), 22 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have 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:51:35,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:51:35,774 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:51:35,789 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:51:35,987 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,SelfDestructingSolverStorable12 [2023-08-29 21:51:35,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:51:35,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:51:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1436166320, now seen corresponding path program 1 times [2023-08-29 21:51:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:51:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335176346] [2023-08-29 21:51:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:51:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:51:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:51:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:51:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335176346] [2023-08-29 21:51:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335176346] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:51:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503646828] [2023-08-29 21:51:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:51:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:51:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:51:36,449 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:51:36,451 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:51:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:51:36,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:51:36,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:51:36,587 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:51:36,645 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:51:36,646 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:51:36,666 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:51:36,760 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:51:36,825 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 21 treesize of output 16 [2023-08-29 21:51:36,873 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:51:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:39,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:51:49,996 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:51:52,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:51:54,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_604)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:54,126 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_604)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:51:54,156 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| Int) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_604 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_601))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_92| v_ArrVal_604))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_606) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91|) 0))) is different from false [2023-08-29 21:51:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-29 21:51:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503646828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:51:54,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:51:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-08-29 21:51:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826069380] [2023-08-29 21:51:54,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:51:54,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 21:51:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:51:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 21:51:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=236, Unknown=12, NotChecked=180, Total=506 [2023-08-29 21:51:54,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:51:54,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 772 flow. Second operand has 23 states, 23 states have (on average 160.69565217391303) internal successors, (3696), 23 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have 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:51:54,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:51:54,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:51:54,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:51:55,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:56,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:57,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:00,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:02,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:04,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:05,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:10,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:11,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:12,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:17,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:28,033 INFO L130 PetriNetUnfolder]: 377/1168 cut-off events. [2023-08-29 21:52:28,033 INFO L131 PetriNetUnfolder]: For 2598/2600 co-relation queries the response was YES. [2023-08-29 21:52:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1168 events. 377/1168 cut-off events. For 2598/2600 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6306 event pairs, 60 based on Foata normal form. 4/1126 useless extension candidates. Maximal degree in co-relation 4071. Up to 269 conditions per place. [2023-08-29 21:52:28,041 INFO L137 encePairwiseOnDemand]: 534/543 looper letters, 103 selfloop transitions, 46 changer transitions 0/153 dead transitions. [2023-08-29 21:52:28,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 153 transitions, 1417 flow [2023-08-29 21:52:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:52:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:52:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1817 transitions. [2023-08-29 21:52:28,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3042022434287628 [2023-08-29 21:52:28,047 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1817 transitions. [2023-08-29 21:52:28,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1817 transitions. [2023-08-29 21:52:28,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:28,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1817 transitions. [2023-08-29 21:52:28,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.1818181818182) internal successors, (1817), 11 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have 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:28,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have 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:28,058 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 543.0) internal successors, (6516), 12 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have 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:28,058 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 772 flow. Second operand 11 states and 1817 transitions. [2023-08-29 21:52:28,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 153 transitions, 1417 flow [2023-08-29 21:52:28,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 153 transitions, 1326 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-08-29 21:52:28,069 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 986 flow [2023-08-29 21:52:28,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=986, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2023-08-29 21:52:28,070 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 6 predicate places. [2023-08-29 21:52:28,071 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 986 flow [2023-08-29 21:52:28,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.69565217391303) internal successors, (3696), 23 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have 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:28,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:28,072 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:28,083 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:52:28,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-29 21:52:28,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:28,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1649503316, now seen corresponding path program 2 times [2023-08-29 21:52:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844979918] [2023-08-29 21:52:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844979918] [2023-08-29 21:52:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844979918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227091038] [2023-08-29 21:52:28,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:52:28,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:28,805 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:52:28,806 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:52:28,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:52:28,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:52:28,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:52:28,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:29,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:52:29,048 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:52:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:29,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:52:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227091038] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:52:32,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:52:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-29 21:52:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701413169] [2023-08-29 21:52:32,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:52:32,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-29 21:52:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:52:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-29 21:52:32,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-08-29 21:52:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 543 [2023-08-29 21:52:34,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 986 flow. Second operand has 29 states, 29 states have (on average 204.0) internal successors, (5916), 29 states have internal predecessors, (5916), 0 states have call successors, (0), 0 states have 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:34,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:52:34,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 543 [2023-08-29 21:52:34,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:35,744 INFO L130 PetriNetUnfolder]: 464/1428 cut-off events. [2023-08-29 21:52:35,745 INFO L131 PetriNetUnfolder]: For 3796/3798 co-relation queries the response was YES. [2023-08-29 21:52:35,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 1428 events. 464/1428 cut-off events. For 3796/3798 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7917 event pairs, 67 based on Foata normal form. 44/1415 useless extension candidates. Maximal degree in co-relation 5083. Up to 252 conditions per place. [2023-08-29 21:52:35,755 INFO L137 encePairwiseOnDemand]: 536/543 looper letters, 216 selfloop transitions, 39 changer transitions 0/259 dead transitions. [2023-08-29 21:52:35,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 259 transitions, 2554 flow [2023-08-29 21:52:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 21:52:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 21:52:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2731 transitions. [2023-08-29 21:52:35,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38688199461680123 [2023-08-29 21:52:35,761 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2731 transitions. [2023-08-29 21:52:35,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2731 transitions. [2023-08-29 21:52:35,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:35,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2731 transitions. [2023-08-29 21:52:35,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 210.07692307692307) internal successors, (2731), 13 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have 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:35,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 543.0) internal successors, (7602), 14 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have 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:35,779 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 543.0) internal successors, (7602), 14 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have 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:35,780 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 986 flow. Second operand 13 states and 2731 transitions. [2023-08-29 21:52:35,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 259 transitions, 2554 flow [2023-08-29 21:52:35,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 259 transitions, 2428 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-08-29 21:52:35,801 INFO L231 Difference]: Finished difference. Result has 107 places, 126 transitions, 1212 flow [2023-08-29 21:52:35,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1212, PETRI_PLACES=107, PETRI_TRANSITIONS=126} [2023-08-29 21:52:35,802 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 8 predicate places. [2023-08-29 21:52:35,802 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 126 transitions, 1212 flow [2023-08-29 21:52:35,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 204.0) internal successors, (5916), 29 states have internal predecessors, (5916), 0 states have call successors, (0), 0 states have 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:35,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:35,804 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:35,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-29 21:52:36,010 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,SelfDestructingSolverStorable14 [2023-08-29 21:52:36,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:36,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -252420002, now seen corresponding path program 2 times [2023-08-29 21:52:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427896995] [2023-08-29 21:52:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427896995] [2023-08-29 21:52:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427896995] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427420056] [2023-08-29 21:52:37,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:52:37,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:37,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:37,007 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:52:37,010 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:52:37,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:52:37,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:52:37,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-29 21:52:37,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:37,167 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:37,219 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:52:37,220 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:37,239 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:37,309 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 21:52:37,368 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 21:52:37,448 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:52:37,509 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 21 treesize of output 16 [2023-08-29 21:52:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-29 21:52:46,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:03,023 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:53:05,046 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_861)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:53:23,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:53:25,277 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)))) is different from false [2023-08-29 21:53:27,303 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:53:45,416 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_861 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_853) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_861) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)))) is different from false [2023-08-29 21:53:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 13 not checked. [2023-08-29 21:53:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427420056] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:45,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 30 [2023-08-29 21:53:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357516296] [2023-08-29 21:53:45,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 21:53:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 21:53:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=502, Unknown=28, NotChecked=318, Total=992 [2023-08-29 21:53:46,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:46,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 543 [2023-08-29 21:53:46,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 126 transitions, 1212 flow. Second operand has 32 states, 32 states have (on average 156.78125) internal successors, (5017), 32 states have internal predecessors, (5017), 0 states have call successors, (0), 0 states have 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:46,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:46,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 543 [2023-08-29 21:53:46,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:47,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:49,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:50,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:54,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:56,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:57,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:58,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:53:59,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:00,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:04,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:05,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:09,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:10,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:11,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:12,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:13,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:19,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:20,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:30,762 WARN L222 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 67 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:54:37,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:38,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:01,800 WARN L222 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 64 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:55:02,090 INFO L130 PetriNetUnfolder]: 516/1650 cut-off events. [2023-08-29 21:55:02,090 INFO L131 PetriNetUnfolder]: For 3771/3773 co-relation queries the response was YES. [2023-08-29 21:55:02,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 1650 events. 516/1650 cut-off events. For 3771/3773 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9936 event pairs, 11 based on Foata normal form. 12/1587 useless extension candidates. Maximal degree in co-relation 5738. Up to 335 conditions per place. [2023-08-29 21:55:02,098 INFO L137 encePairwiseOnDemand]: 530/543 looper letters, 91 selfloop transitions, 95 changer transitions 15/205 dead transitions. [2023-08-29 21:55:02,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 205 transitions, 2100 flow [2023-08-29 21:55:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 21:55:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 21:55:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2549 transitions. [2023-08-29 21:55:02,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29339318600368325 [2023-08-29 21:55:02,104 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2549 transitions. [2023-08-29 21:55:02,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2549 transitions. [2023-08-29 21:55:02,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:55:02,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2549 transitions. [2023-08-29 21:55:02,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 159.3125) internal successors, (2549), 16 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states have 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:02,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 543.0) internal successors, (9231), 17 states have internal predecessors, (9231), 0 states have call successors, (0), 0 states have 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:02,117 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 543.0) internal successors, (9231), 17 states have internal predecessors, (9231), 0 states have call successors, (0), 0 states have 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:02,117 INFO L175 Difference]: Start difference. First operand has 107 places, 126 transitions, 1212 flow. Second operand 16 states and 2549 transitions. [2023-08-29 21:55:02,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 205 transitions, 2100 flow [2023-08-29 21:55:02,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 205 transitions, 2056 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 21:55:02,139 INFO L231 Difference]: Finished difference. Result has 122 places, 157 transitions, 1773 flow [2023-08-29 21:55:02,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1773, PETRI_PLACES=122, PETRI_TRANSITIONS=157} [2023-08-29 21:55:02,141 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 23 predicate places. [2023-08-29 21:55:02,141 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 157 transitions, 1773 flow [2023-08-29 21:55:02,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 156.78125) internal successors, (5017), 32 states have internal predecessors, (5017), 0 states have call successors, (0), 0 states have 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:02,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:55:02,142 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:55:02,149 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:55:02,349 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,SelfDestructingSolverStorable15 [2023-08-29 21:55:02,349 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:55:02,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:55:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash 501022041, now seen corresponding path program 2 times [2023-08-29 21:55:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:55:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462904991] [2023-08-29 21:55:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:55:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:55:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:55:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:55:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:55:03,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462904991] [2023-08-29 21:55:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462904991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:55:03,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266920074] [2023-08-29 21:55:03,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:55:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:55:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:55:03,397 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:55:03,401 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:55:03,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:55:03,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:55:03,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-29 21:55:03,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:55:03,568 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:55:03,632 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:55:03,632 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:55:03,642 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:55:03,752 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:55:03,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 21 treesize of output 16 [2023-08-29 21:55:10,008 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 21 treesize of output 16 [2023-08-29 21:55:16,092 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 19 [2023-08-29 21:55:46,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-29 21:55:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:55:50,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:55:50,258 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:55:52,271 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:55:54,285 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:55:56,309 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:55:56,384 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0)))) is different from false [2023-08-29 21:55:56,408 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_81| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0)))))) is different from false [2023-08-29 21:55:56,463 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_997 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_81| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|) (< |v_t_funThread1of1ForFork0_~i~0#1_81| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_992)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-29 21:55:56,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_992) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:55:56,662 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_992 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_989 (Array Int Int)) (v_ArrVal_997 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_992) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_108| v_ArrVal_997))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|) 0))) is different from false [2023-08-29 21:55:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 18 not checked. [2023-08-29 21:55:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266920074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:55:56,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:55:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 30 [2023-08-29 21:55:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467337537] [2023-08-29 21:55:56,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:55:56,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-29 21:55:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:55:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-29 21:55:56,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=392, Unknown=35, NotChecked=450, Total=992 [2023-08-29 21:55:58,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:59,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:00,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:01,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:03,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:04,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:05,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:06,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:08,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:09,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:10,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:11,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:12,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:14,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:16,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:18,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:19,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:20,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:21,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:23,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:24,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:25,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:26,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:28,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:29,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:30,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:31,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:33,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:34,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:35,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:36,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:37,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:39,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:40,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:41,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:42,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:44,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:45,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:46,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:47,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:49,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:50,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:51,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:52,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:53,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:54,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:56,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:57,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:58,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:59,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:01,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:02,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:03,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:04,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:06,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:07,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:08,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:09,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:11,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:12,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:12,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 543 [2023-08-29 21:57:12,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 157 transitions, 1773 flow. Second operand has 32 states, 32 states have (on average 160.84375) internal successors, (5147), 32 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have 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:12,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:57:12,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 543 [2023-08-29 21:57:12,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:57:13,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:15,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 [0] [2023-08-29 21:57:17,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:26,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:28,086 WARN L539 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] [2023-08-29 21:57:30,103 WARN L539 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] [2023-08-29 21:57:36,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:38,853 WARN L539 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] [2023-08-29 21:57:40,864 WARN L539 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] [2023-08-29 21:57:41,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:43,995 WARN L539 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] [2023-08-29 21:57:46,007 WARN L539 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] [2023-08-29 21:57:47,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:49,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 [0] [2023-08-29 21:57:51,351 WARN L539 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] [2023-08-29 21:57:52,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:54,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 [0] [2023-08-29 21:57:56,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 [0] [2023-08-29 21:57:58,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 [0] [2023-08-29 21:57:59,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:01,904 WARN L539 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] [2023-08-29 21:58:03,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:16,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:18,910 WARN L539 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] [2023-08-29 21:58:20,915 WARN L539 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] [2023-08-29 21:58:22,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:24,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:26,009 WARN L539 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] [2023-08-29 21:58:27,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:28,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:30,419 WARN L539 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] [2023-08-29 21:58:32,426 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] [2023-08-29 21:58:34,431 WARN L539 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] [2023-08-29 21:58:35,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:37,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:38,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:40,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:42,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:44,124 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] [2023-08-29 21:58:46,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:47,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:49,290 WARN L539 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] [2023-08-29 21:58:50,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:51,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:53,778 WARN L539 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] [2023-08-29 21:58:55,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:58:57,790 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] [2023-08-29 21:58:58,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:59:00,915 WARN L539 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] [2023-08-29 21:59:02,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:59:10,671 WARN L222 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 52 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:19,681 WARN L222 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 75 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:35,661 WARN L222 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 51 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:59:55,699 WARN L222 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 57 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 22:00:26,574 INFO L130 PetriNetUnfolder]: 687/2231 cut-off events. [2023-08-29 22:00:26,574 INFO L131 PetriNetUnfolder]: For 10312/10324 co-relation queries the response was YES. [2023-08-29 22:00:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10274 conditions, 2231 events. 687/2231 cut-off events. For 10312/10324 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13951 event pairs, 64 based on Foata normal form. 19/2250 useless extension candidates. Maximal degree in co-relation 10232. Up to 436 conditions per place. [2023-08-29 22:00:26,589 INFO L137 encePairwiseOnDemand]: 532/543 looper letters, 240 selfloop transitions, 124 changer transitions 0/368 dead transitions. [2023-08-29 22:00:26,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 368 transitions, 4685 flow [2023-08-29 22:00:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 22:00:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 22:00:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3285 transitions. [2023-08-29 22:00:26,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30248618784530384 [2023-08-29 22:00:26,595 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3285 transitions. [2023-08-29 22:00:26,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3285 transitions. [2023-08-29 22:00:26,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 22:00:26,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3285 transitions. [2023-08-29 22:00:26,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 164.25) internal successors, (3285), 20 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have 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:26,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 543.0) internal successors, (11403), 21 states have internal predecessors, (11403), 0 states have call successors, (0), 0 states have 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:26,609 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 543.0) internal successors, (11403), 21 states have internal predecessors, (11403), 0 states have call successors, (0), 0 states have 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:26,609 INFO L175 Difference]: Start difference. First operand has 122 places, 157 transitions, 1773 flow. Second operand 20 states and 3285 transitions. [2023-08-29 22:00:26,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 368 transitions, 4685 flow [2023-08-29 22:00:26,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 368 transitions, 4450 flow, removed 76 selfloop flow, removed 9 redundant places. [2023-08-29 22:00:26,666 INFO L231 Difference]: Finished difference. Result has 144 places, 236 transitions, 3137 flow [2023-08-29 22:00:26,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=543, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3137, PETRI_PLACES=144, PETRI_TRANSITIONS=236} [2023-08-29 22:00:26,667 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 45 predicate places. [2023-08-29 22:00:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 236 transitions, 3137 flow [2023-08-29 22:00:26,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 160.84375) internal successors, (5147), 32 states have internal predecessors, (5147), 0 states have call successors, (0), 0 states have 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:26,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 22:00:26,668 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 22:00:26,675 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 22:00:26,874 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,SelfDestructingSolverStorable16 [2023-08-29 22:00:26,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 22:00:26,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 22:00:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1681203837, now seen corresponding path program 3 times [2023-08-29 22:00:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 22:00:26,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815754414] [2023-08-29 22:00:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 22:00:26,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 22:00:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 22:00:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:00:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 22:00:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815754414] [2023-08-29 22:00:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815754414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 22:00:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089381380] [2023-08-29 22:00:37,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 22:00:37,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 22:00:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 22:00:37,839 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 22:00:37,840 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 22:00:38,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-29 22:00:38,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 22:00:38,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-29 22:00:38,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 22:00:38,592 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:38,782 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-29 22:00:38,783 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:00:38,836 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:00:38,996 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:39,062 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:00:39,137 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 21 treesize of output 16 [2023-08-29 22:00:45,609 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 21 treesize of output 16 [2023-08-29 22:00:49,695 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 19 [2023-08-29 22:01:19,464 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 19 [2023-08-29 22:01:29,523 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 27 treesize of output 22 [2023-08-29 22:02:14,281 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 27 treesize of output 22 [2023-08-29 22:02:30,431 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 30 treesize of output 25 [2023-08-29 22:03:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 22:03:27,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 22:03:55,249 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 22:03:57,268 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (v_ArrVal_1207 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1207)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0))) is different from false [2023-08-29 22:03:59,337 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0)))) is different from false [2023-08-29 22:04:01,355 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_89| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_116| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_115|) 0)))) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false Killed by 15