./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/bigshot_s.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 22:07:34,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:07:34,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:07:34,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:07:34,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:07:34,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:07:34,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:07:34,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:07:34,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:07:34,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:07:34,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:07:34,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:07:34,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:07:34,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:07:34,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:07:34,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:07:34,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:07:34,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:07:34,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:07:34,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:07:34,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:07:34,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:07:34,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:07:34,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:07:34,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:07:34,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:07:34,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:07:34,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:07:34,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:07:34,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:07:34,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:07:34,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:07:34,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:07:34,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:07:34,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:07:34,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:07:34,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:07:34,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:07:34,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:07:34,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:07:34,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:07:34,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 22:07:34,798 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:07:34,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:07:34,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:07:34,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:07:34,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:07:34,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:07:34,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:07:34,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:07:34,802 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:07:34,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:07:34,803 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:07:34,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:07:34,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:07:34,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:07:34,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:07:34,804 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:07:34,804 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:07:34,804 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:07:34,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:07:34,805 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:07:34,805 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:07:34,805 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:07:34,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:07:34,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:07:34,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:07:34,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:34,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:07:34,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:07:34,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 22:07:34,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 22:07:34,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:07:34,807 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:07:34,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:07:34,808 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:07:34,808 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe 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 -> BEFORE [2023-08-31 22:07:35,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:07:35,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:07:35,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:07:35,160 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:07:35,160 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:07:35,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-31 22:07:36,331 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:07:36,557 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:07:36,557 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-31 22:07:36,574 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda69bf46/ac42b5823d7d4b77b1014affe095430d/FLAG95a64abb3 [2023-08-31 22:07:36,586 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda69bf46/ac42b5823d7d4b77b1014affe095430d [2023-08-31 22:07:36,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:07:36,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:07:36,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:36,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:07:36,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:07:36,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575a67d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36, skipping insertion in model container [2023-08-31 22:07:36,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:07:36,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:07:37,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i[55202,55215] [2023-08-31 22:07:37,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:37,055 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:07:37,112 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i[55202,55215] [2023-08-31 22:07:37,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:37,191 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:07:37,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37 WrapperNode [2023-08-31 22:07:37,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:37,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:37,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:07:37,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:07:37,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,248 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-08-31 22:07:37,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:37,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:07:37,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:07:37,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:07:37,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:07:37,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:07:37,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:07:37,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:07:37,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (1/1) ... [2023-08-31 22:07:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:37,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:37,333 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-31 22:07:37,362 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-31 22:07:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-31 22:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 22:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 22:07:37,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 22:07:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 22:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:07:37,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:07:37,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 22:07:37,593 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:07:37,595 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:07:37,829 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:07:37,835 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:07:37,837 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-31 22:07:37,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37 BoogieIcfgContainer [2023-08-31 22:07:37,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:07:37,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:07:37,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:07:37,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:07:37,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:07:36" (1/3) ... [2023-08-31 22:07:37,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fbe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:37, skipping insertion in model container [2023-08-31 22:07:37,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:37" (2/3) ... [2023-08-31 22:07:37,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fbe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:37, skipping insertion in model container [2023-08-31 22:07:37,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37" (3/3) ... [2023-08-31 22:07:37,847 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2023-08-31 22:07:37,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:07:37,861 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-31 22:07:37,861 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:07:37,967 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:07:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 238 flow [2023-08-31 22:07:38,064 INFO L130 PetriNetUnfolder]: 5/109 cut-off events. [2023-08-31 22:07:38,064 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 5/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-31 22:07:38,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 111 transitions, 238 flow [2023-08-31 22:07:38,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 222 flow [2023-08-31 22:07:38,078 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:07:38,094 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 222 flow [2023-08-31 22:07:38,100 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 105 transitions, 222 flow [2023-08-31 22:07:38,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 222 flow [2023-08-31 22:07:38,138 INFO L130 PetriNetUnfolder]: 5/105 cut-off events. [2023-08-31 22:07:38,139 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:38,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-31 22:07:38,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-31 22:07:42,429 INFO L134 LiptonReduction]: Checked pairs total: 461 [2023-08-31 22:07:42,430 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-31 22:07:42,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:07:42,446 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;@9c30fd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:07:42,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-31 22:07:42,448 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 22:07:42,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:42,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:42,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:07:42,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:42,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 431, now seen corresponding path program 1 times [2023-08-31 22:07:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:42,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130943526] [2023-08-31 22:07:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:42,619 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-31 22:07:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130943526] [2023-08-31 22:07:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130943526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:07:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627054883] [2023-08-31 22:07:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:42,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:07:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:42,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:07:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:07:42,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-31 22:07:42,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:42,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:42,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-31 22:07:42,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:42,729 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2023-08-31 22:07:42,729 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:42,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 176 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2023-08-31 22:07:42,731 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 22:07:42,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-31 22:07:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:07:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:07:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-31 22:07:42,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-08-31 22:07:42,746 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-31 22:07:42,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-31 22:07:42,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:42,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-31 22:07:42,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:42,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:42,761 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:42,762 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 238 transitions. [2023-08-31 22:07:42,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-31 22:07:42,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:42,767 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-31 22:07:42,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-31 22:07:42,771 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:07:42,772 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-31 22:07:42,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:42,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:42,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:42,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 22:07:42,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:42,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 422238, now seen corresponding path program 1 times [2023-08-31 22:07:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15888724] [2023-08-31 22:07:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,043 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-31 22:07:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15888724] [2023-08-31 22:07:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15888724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003814454] [2023-08-31 22:07:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:43,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:43,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-31 22:07:43,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-31 22:07:43,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,201 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2023-08-31 22:07:43,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:43,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 167 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2023-08-31 22:07:43,203 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-31 22:07:43,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-31 22:07:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-31 22:07:43,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4468390804597701 [2023-08-31 22:07:43,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-31 22:07:43,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-31 22:07:43,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-31 22:07:43,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,210 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 311 transitions. [2023-08-31 22:07:43,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-31 22:07:43,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 22:07:43,211 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-31 22:07:43,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-31 22:07:43,212 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:43,212 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-31 22:07:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 22:07:43,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 422239, now seen corresponding path program 1 times [2023-08-31 22:07:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699061924] [2023-08-31 22:07:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,283 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-31 22:07:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699061924] [2023-08-31 22:07:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699061924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575913489] [2023-08-31 22:07:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:43,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-31 22:07:43,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-31 22:07:43,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,389 INFO L130 PetriNetUnfolder]: 24/64 cut-off events. [2023-08-31 22:07:43,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:43,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 64 events. 24/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 163 event pairs, 15 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 131. Up to 61 conditions per place. [2023-08-31 22:07:43,391 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-31 22:07:43,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-31 22:07:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-31 22:07:43,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120689655172414 [2023-08-31 22:07:43,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-31 22:07:43,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-31 22:07:43,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-31 22:07:43,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,399 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 321 transitions. [2023-08-31 22:07:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-31 22:07:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:43,401 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-31 22:07:43,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-31 22:07:43,403 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-31 22:07:43,405 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-31 22:07:43,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 22:07:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 22:07:43,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 13090482, now seen corresponding path program 1 times [2023-08-31 22:07:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137471598] [2023-08-31 22:07:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,547 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-31 22:07:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137471598] [2023-08-31 22:07:43,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137471598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546262296] [2023-08-31 22:07:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:43,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-31 22:07:43,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-31 22:07:43,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,691 INFO L130 PetriNetUnfolder]: 24/63 cut-off events. [2023-08-31 22:07:43,692 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:07:43,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 63 events. 24/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 161 event pairs, 16 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 132. Up to 61 conditions per place. [2023-08-31 22:07:43,693 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-31 22:07:43,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 108 flow [2023-08-31 22:07:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-31 22:07:43,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-31 22:07:43,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-31 22:07:43,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-31 22:07:43,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-31 22:07:43,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,699 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 3 states and 319 transitions. [2023-08-31 22:07:43,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 108 flow [2023-08-31 22:07:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:43,700 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2023-08-31 22:07:43,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-31 22:07:43,701 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:07:43,701 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2023-08-31 22:07:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 22:07:43,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash -305662314, now seen corresponding path program 1 times [2023-08-31 22:07:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354691201] [2023-08-31 22:07:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,772 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-31 22:07:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354691201] [2023-08-31 22:07:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354691201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928511663] [2023-08-31 22:07:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:43,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-31 22:07:43,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-31 22:07:43,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,853 INFO L130 PetriNetUnfolder]: 17/49 cut-off events. [2023-08-31 22:07:43,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:43,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 49 events. 17/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 107 event pairs, 11 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 101. Up to 47 conditions per place. [2023-08-31 22:07:43,854 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-31 22:07:43,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2023-08-31 22:07:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-31 22:07:43,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44396551724137934 [2023-08-31 22:07:43,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-31 22:07:43,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-31 22:07:43,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-31 22:07:43,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,859 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 309 transitions. [2023-08-31 22:07:43,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2023-08-31 22:07:43,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:43,875 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-31 22:07:43,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-31 22:07:43,877 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:07:43,877 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-31 22:07:43,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:43,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:43,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 22:07:43,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash -305662316, now seen corresponding path program 1 times [2023-08-31 22:07:43,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718728616] [2023-08-31 22:07:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,973 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-31 22:07:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718728616] [2023-08-31 22:07:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718728616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229426568] [2023-08-31 22:07:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:44,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-31 22:07:44,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:44,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-31 22:07:44,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:44,087 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2023-08-31 22:07:44,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:44,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 35 events. 10/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 61 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 73. Up to 33 conditions per place. [2023-08-31 22:07:44,088 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-31 22:07:44,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-31 22:07:44,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-08-31 22:07:44,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281609195402299 [2023-08-31 22:07:44,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-08-31 22:07:44,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-08-31 22:07:44,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:44,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-08-31 22:07:44,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,103 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 298 transitions. [2023-08-31 22:07:44,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-31 22:07:44,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:44,105 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-31 22:07:44,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:07:44,106 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:07:44,106 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-31 22:07:44,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:44,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:44,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 22:07:44,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:44,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -655080410, now seen corresponding path program 1 times [2023-08-31 22:07:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867952736] [2023-08-31 22:07:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:44,294 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-31 22:07:44,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:44,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867952736] [2023-08-31 22:07:44,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867952736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:44,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:44,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951537313] [2023-08-31 22:07:44,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:44,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 22:07:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 22:07:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 22:07:44,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 232 [2023-08-31 22:07:44,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:44,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 232 [2023-08-31 22:07:44,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:44,559 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-31 22:07:44,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:44,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 93 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-31 22:07:44,560 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-31 22:07:44,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-31 22:07:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2023-08-31 22:07:44,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38685344827586204 [2023-08-31 22:07:44,562 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 359 transitions. [2023-08-31 22:07:44,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 359 transitions. [2023-08-31 22:07:44,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:44,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 359 transitions. [2023-08-31 22:07:44,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,565 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,565 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 359 transitions. [2023-08-31 22:07:44,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-31 22:07:44,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:44,567 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-31 22:07:44,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:07:44,567 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:07:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-31 22:07:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:44,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:44,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 22:07:44,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:44,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash -655080315, now seen corresponding path program 1 times [2023-08-31 22:07:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072541024] [2023-08-31 22:07:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:44,622 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-31 22:07:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:44,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072541024] [2023-08-31 22:07:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072541024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140295013] [2023-08-31 22:07:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:44,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-31 22:07:44,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:44,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-31 22:07:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:44,754 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2023-08-31 22:07:44,754 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:07:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 35 events. 9/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2023-08-31 22:07:44,755 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 20 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2023-08-31 22:07:44,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 109 flow [2023-08-31 22:07:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-08-31 22:07:44,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4385775862068966 [2023-08-31 22:07:44,757 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-08-31 22:07:44,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-08-31 22:07:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:44,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-08-31 22:07:44,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,761 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 4 states and 407 transitions. [2023-08-31 22:07:44,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 109 flow [2023-08-31 22:07:44,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:44,762 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 55 flow [2023-08-31 22:07:44,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=55, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-31 22:07:44,762 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:07:44,763 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 55 flow [2023-08-31 22:07:44,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:44,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:44,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 22:07:44,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:44,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -655080373, now seen corresponding path program 1 times [2023-08-31 22:07:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947544841] [2023-08-31 22:07:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:44,968 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-31 22:07:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947544841] [2023-08-31 22:07:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947544841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342111272] [2023-08-31 22:07:44,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 22:07:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 22:07:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 22:07:45,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 232 [2023-08-31 22:07:45,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 55 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:45,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 232 [2023-08-31 22:07:45,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:45,486 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2023-08-31 22:07:45,486 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-31 22:07:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 48 events. 12/48 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 118 event pairs, 6 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 108. Up to 33 conditions per place. [2023-08-31 22:07:45,487 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-31 22:07:45,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 129 flow [2023-08-31 22:07:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2023-08-31 22:07:45,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39870689655172414 [2023-08-31 22:07:45,491 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 555 transitions. [2023-08-31 22:07:45,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 555 transitions. [2023-08-31 22:07:45,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:45,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 555 transitions. [2023-08-31 22:07:45,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,495 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 55 flow. Second operand 6 states and 555 transitions. [2023-08-31 22:07:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 129 flow [2023-08-31 22:07:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:45,496 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 71 flow [2023-08-31 22:07:45,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-31 22:07:45,496 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2023-08-31 22:07:45,502 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 71 flow [2023-08-31 22:07:45,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:45,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:45,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 22:07:45,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:45,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash -655080316, now seen corresponding path program 1 times [2023-08-31 22:07:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728557044] [2023-08-31 22:07:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:45,583 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-31 22:07:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728557044] [2023-08-31 22:07:45,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728557044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:45,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943518318] [2023-08-31 22:07:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:45,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:45,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:45,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:45,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-31 22:07:45,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:45,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-31 22:07:45,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:45,719 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-31 22:07:45,719 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-08-31 22:07:45,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 42 events. 11/42 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 87 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 105. Up to 30 conditions per place. [2023-08-31 22:07:45,720 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-31 22:07:45,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 130 flow [2023-08-31 22:07:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-08-31 22:07:45,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4385775862068966 [2023-08-31 22:07:45,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-08-31 22:07:45,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-08-31 22:07:45,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:45,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-08-31 22:07:45,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,726 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 71 flow. Second operand 4 states and 407 transitions. [2023-08-31 22:07:45,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 130 flow [2023-08-31 22:07:45,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:45,727 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2023-08-31 22:07:45,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-31 22:07:45,728 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:45,728 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2023-08-31 22:07:45,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:45,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:45,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:45,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 22:07:45,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:45,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1167348188, now seen corresponding path program 1 times [2023-08-31 22:07:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993121030] [2023-08-31 22:07:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:46,005 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-31 22:07:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993121030] [2023-08-31 22:07:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993121030] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80147583] [2023-08-31 22:07:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:46,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:46,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:46,009 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-31 22:07:46,011 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-31 22:07:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:46,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-31 22:07:46,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:46,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:46,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:46,290 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:46,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:46,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:46,425 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-31 22:07:46,491 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-31 22:07:46,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:46,606 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-31 22:07:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80147583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:46,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-08-31 22:07:46,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630787093] [2023-08-31 22:07:46,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:46,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:07:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:07:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-08-31 22:07:47,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-31 22:07:47,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 16 states, 16 states have (on average 87.875) internal successors, (1406), 16 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:47,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:47,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-31 22:07:47,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:48,123 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2023-08-31 22:07:48,123 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-31 22:07:48,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 73 events. 21/73 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 210 event pairs, 4 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 191. Up to 23 conditions per place. [2023-08-31 22:07:48,124 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 31 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2023-08-31 22:07:48,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 236 flow [2023-08-31 22:07:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 22:07:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 22:07:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions. [2023-08-31 22:07:48,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875718390804598 [2023-08-31 22:07:48,128 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions. [2023-08-31 22:07:48,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions. [2023-08-31 22:07:48,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:48,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions. [2023-08-31 22:07:48,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:48,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:48,136 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:48,136 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 12 states and 1079 transitions. [2023-08-31 22:07:48,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 236 flow [2023-08-31 22:07:48,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:48,139 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 155 flow [2023-08-31 22:07:48,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-08-31 22:07:48,139 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:07:48,139 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 155 flow [2023-08-31 22:07:48,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 87.875) internal successors, (1406), 16 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:48,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:48,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:48,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 22:07:48,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-31 22:07:48,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:48,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1075178115, now seen corresponding path program 1 times [2023-08-31 22:07:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646830497] [2023-08-31 22:07:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:48,471 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-31 22:07:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646830497] [2023-08-31 22:07:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646830497] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861555146] [2023-08-31 22:07:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:48,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:48,474 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-31 22:07:48,502 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-31 22:07:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:48,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 22:07:48,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:48,575 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-31 22:07:48,619 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-31 22:07:48,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:48,684 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-31 22:07:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861555146] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:48,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-31 22:07:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111350902] [2023-08-31 22:07:48,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 22:07:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 22:07:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-31 22:07:48,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-31 22:07:48,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 155 flow. Second operand has 11 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:48,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:48,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-31 22:07:48,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:49,096 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2023-08-31 22:07:49,096 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-31 22:07:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 65 events. 17/65 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 4 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 215. Up to 24 conditions per place. [2023-08-31 22:07:49,097 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-31 22:07:49,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 275 flow [2023-08-31 22:07:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:07:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:07:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-08-31 22:07:49,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42426108374384236 [2023-08-31 22:07:49,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-08-31 22:07:49,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-08-31 22:07:49,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:49,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-08-31 22:07:49,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,104 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 155 flow. Second operand 7 states and 689 transitions. [2023-08-31 22:07:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 275 flow [2023-08-31 22:07:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 249 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 22:07:49,107 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 137 flow [2023-08-31 22:07:49,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-31 22:07:49,107 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-31 22:07:49,108 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 137 flow [2023-08-31 22:07:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:49,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:49,119 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-31 22:07:49,314 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,SelfDestructingSolverStorable11 [2023-08-31 22:07:49,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:49,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1827597992, now seen corresponding path program 1 times [2023-08-31 22:07:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112546660] [2023-08-31 22:07:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,350 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-31 22:07:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112546660] [2023-08-31 22:07:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112546660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544520106] [2023-08-31 22:07:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:49,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:49,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-31 22:07:49,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:49,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-31 22:07:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:49,389 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2023-08-31 22:07:49,390 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-31 22:07:49,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 59 events. 16/59 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 150 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 197. Up to 56 conditions per place. [2023-08-31 22:07:49,392 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-31 22:07:49,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 25 transitions, 180 flow [2023-08-31 22:07:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-31 22:07:49,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120689655172414 [2023-08-31 22:07:49,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-31 22:07:49,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-31 22:07:49,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:49,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-31 22:07:49,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,397 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 137 flow. Second operand 3 states and 321 transitions. [2023-08-31 22:07:49,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 25 transitions, 180 flow [2023-08-31 22:07:49,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 25 transitions, 171 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 22:07:49,400 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 121 flow [2023-08-31 22:07:49,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-31 22:07:49,401 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-31 22:07:49,401 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 121 flow [2023-08-31 22:07:49,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:49,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:49,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 22:07:49,402 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:49,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash 834000325, now seen corresponding path program 1 times [2023-08-31 22:07:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516163724] [2023-08-31 22:07:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,603 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-31 22:07:49,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516163724] [2023-08-31 22:07:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516163724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:49,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:07:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002297509] [2023-08-31 22:07:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:07:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:07:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:07:49,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-31 22:07:49,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:49,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-31 22:07:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:49,716 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2023-08-31 22:07:49,716 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-31 22:07:49,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 58 events. 16/58 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 9 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 186. Up to 47 conditions per place. [2023-08-31 22:07:49,717 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2023-08-31 22:07:49,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 188 flow [2023-08-31 22:07:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:07:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:07:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-31 22:07:49,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2023-08-31 22:07:49,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-31 22:07:49,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-31 22:07:49,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:49,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-31 22:07:49,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,723 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 121 flow. Second operand 5 states and 504 transitions. [2023-08-31 22:07:49,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 188 flow [2023-08-31 22:07:49,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:49,725 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 131 flow [2023-08-31 22:07:49,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-08-31 22:07:49,726 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-31 22:07:49,727 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 131 flow [2023-08-31 22:07:49,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:49,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:49,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 22:07:49,728 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:49,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 806294685, now seen corresponding path program 1 times [2023-08-31 22:07:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429086980] [2023-08-31 22:07:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,987 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-31 22:07:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429086980] [2023-08-31 22:07:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429086980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 22:07:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306134275] [2023-08-31 22:07:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 22:07:49,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 22:07:49,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 22:07:50,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 232 [2023-08-31 22:07:50,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 131 flow. Second operand has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:50,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:50,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 232 [2023-08-31 22:07:50,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:50,397 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-31 22:07:50,397 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-31 22:07:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 53 events. 15/53 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 188. Up to 38 conditions per place. [2023-08-31 22:07:50,397 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-31 22:07:50,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 27 transitions, 190 flow [2023-08-31 22:07:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:07:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:07:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-31 22:07:50,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40344827586206894 [2023-08-31 22:07:50,400 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-31 22:07:50,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-31 22:07:50,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:50,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-31 22:07:50,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:50,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:50,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:50,404 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 131 flow. Second operand 5 states and 468 transitions. [2023-08-31 22:07:50,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 27 transitions, 190 flow [2023-08-31 22:07:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 27 transitions, 182 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:50,405 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 137 flow [2023-08-31 22:07:50,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-31 22:07:50,406 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:07:50,406 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 137 flow [2023-08-31 22:07:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:50,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:50,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:50,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 22:07:50,407 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:50,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:50,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2130979546, now seen corresponding path program 1 times [2023-08-31 22:07:50,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:50,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554218840] [2023-08-31 22:07:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:50,704 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-31 22:07:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554218840] [2023-08-31 22:07:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554218840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589546112] [2023-08-31 22:07:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:50,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:50,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:50,709 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-31 22:07:50,735 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-31 22:07:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 22:07:50,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:50,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:50,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:50,841 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-31 22:07:50,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-08-31 22:07:50,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:50,973 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:07:50,974 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-31 22:07:51,008 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:07:51,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-31 22:07:51,030 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-31 22:07:51,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:51,152 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-31 22:07:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589546112] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:51,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2023-08-31 22:07:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102701862] [2023-08-31 22:07:51,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:51,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 22:07:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 22:07:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-08-31 22:07:52,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 232 [2023-08-31 22:07:52,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 137 flow. Second operand has 18 states, 18 states have (on average 89.05555555555556) internal successors, (1603), 18 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:52,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:52,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 232 [2023-08-31 22:07:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:52,883 INFO L130 PetriNetUnfolder]: 22/74 cut-off events. [2023-08-31 22:07:52,883 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2023-08-31 22:07:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 74 events. 22/74 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 186 event pairs, 1 based on Foata normal form. 5/79 useless extension candidates. Maximal degree in co-relation 278. Up to 20 conditions per place. [2023-08-31 22:07:52,884 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-08-31 22:07:52,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 306 flow [2023-08-31 22:07:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:07:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:07:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 827 transitions. [2023-08-31 22:07:52,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3960727969348659 [2023-08-31 22:07:52,887 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 827 transitions. [2023-08-31 22:07:52,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 827 transitions. [2023-08-31 22:07:52,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:52,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 827 transitions. [2023-08-31 22:07:52,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.88888888888889) internal successors, (827), 9 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:52,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:52,891 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:52,891 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 137 flow. Second operand 9 states and 827 transitions. [2023-08-31 22:07:52,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 306 flow [2023-08-31 22:07:52,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:52,892 INFO L231 Difference]: Finished difference. Result has 49 places, 26 transitions, 181 flow [2023-08-31 22:07:52,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2023-08-31 22:07:52,893 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-31 22:07:52,893 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 26 transitions, 181 flow [2023-08-31 22:07:52,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 89.05555555555556) internal successors, (1603), 18 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:52,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:52,894 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:52,905 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-31 22:07:53,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:53,094 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:53,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 122921156, now seen corresponding path program 2 times [2023-08-31 22:07:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73023182] [2023-08-31 22:07:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:53,273 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-31 22:07:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73023182] [2023-08-31 22:07:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73023182] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174845554] [2023-08-31 22:07:53,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:07:53,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:53,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:53,275 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-31 22:07:53,278 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-31 22:07:53,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 22:07:53,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:07:53,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-31 22:07:53,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:53,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:53,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:53,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:53,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:53,420 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:53,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:53,497 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:07:53,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:07:53,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:53,513 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:07:53,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:07:53,615 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-31 22:07:53,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:07:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174845554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:53,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 22:07:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2023-08-31 22:07:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828741093] [2023-08-31 22:07:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:53,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:07:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:07:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-08-31 22:07:53,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-31 22:07:53,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 26 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:53,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:53,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-31 22:07:53,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:53,981 INFO L130 PetriNetUnfolder]: 19/65 cut-off events. [2023-08-31 22:07:53,981 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-31 22:07:53,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 65 events. 19/65 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 0 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 280. Up to 51 conditions per place. [2023-08-31 22:07:53,982 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-31 22:07:53,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 27 transitions, 233 flow [2023-08-31 22:07:53,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-08-31 22:07:53,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2023-08-31 22:07:53,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-08-31 22:07:53,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-08-31 22:07:53,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:53,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-08-31 22:07:53,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:53,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:53,989 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:53,989 INFO L175 Difference]: Start difference. First operand has 49 places, 26 transitions, 181 flow. Second operand 6 states and 594 transitions. [2023-08-31 22:07:53,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 27 transitions, 233 flow [2023-08-31 22:07:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 27 transitions, 213 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:53,991 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 165 flow [2023-08-31 22:07:53,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2023-08-31 22:07:53,991 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-31 22:07:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 165 flow [2023-08-31 22:07:53,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:53,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:53,992 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:54,003 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-31 22:07:54,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-31 22:07:54,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:54,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 122921099, now seen corresponding path program 2 times [2023-08-31 22:07:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669971937] [2023-08-31 22:07:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:54,444 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-31 22:07:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:54,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669971937] [2023-08-31 22:07:54,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669971937] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:54,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366976264] [2023-08-31 22:07:54,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:07:54,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:54,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:54,446 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-31 22:07:54,471 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-31 22:07:54,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:07:54,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:07:54,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-31 22:07:54,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:54,589 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:54,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:54,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:54,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:07:54,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:07:54,652 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:07:54,653 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-31 22:07:54,799 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-31 22:07:54,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366976264] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:55,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-08-31 22:07:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027956801] [2023-08-31 22:07:55,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-31 22:07:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-31 22:07:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2023-08-31 22:07:56,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 232 [2023-08-31 22:07:56,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 165 flow. Second operand has 24 states, 24 states have (on average 82.625) internal successors, (1983), 24 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:56,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:56,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 232 [2023-08-31 22:07:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:56,985 INFO L130 PetriNetUnfolder]: 21/77 cut-off events. [2023-08-31 22:07:56,985 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-31 22:07:56,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 77 events. 21/77 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 3 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 310. Up to 18 conditions per place. [2023-08-31 22:07:56,986 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 32 selfloop transitions, 17 changer transitions 0/49 dead transitions. [2023-08-31 22:07:56,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 381 flow [2023-08-31 22:07:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 22:07:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 22:07:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1430 transitions. [2023-08-31 22:07:56,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257606490872213 [2023-08-31 22:07:56,997 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1430 transitions. [2023-08-31 22:07:56,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1430 transitions. [2023-08-31 22:07:56,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:56,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1430 transitions. [2023-08-31 22:07:57,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.11764705882354) internal successors, (1430), 17 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:57,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:57,007 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:57,007 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 165 flow. Second operand 17 states and 1430 transitions. [2023-08-31 22:07:57,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 381 flow [2023-08-31 22:07:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 363 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:57,010 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 267 flow [2023-08-31 22:07:57,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=267, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2023-08-31 22:07:57,010 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-08-31 22:07:57,010 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 32 transitions, 267 flow [2023-08-31 22:07:57,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 82.625) internal successors, (1983), 24 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:07:57,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:57,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:57,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-31 22:07:57,231 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,SelfDestructingSolverStorable17 [2023-08-31 22:07:57,231 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:57,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1752828807, now seen corresponding path program 1 times [2023-08-31 22:07:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:57,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715783225] [2023-08-31 22:07:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:57,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:57,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715783225] [2023-08-31 22:07:57,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715783225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:57,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651079676] [2023-08-31 22:07:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:57,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:57,580 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-31 22:07:57,582 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-31 22:07:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:57,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-31 22:07:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:57,728 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:57,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:57,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:57,834 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-31 22:07:57,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-08-31 22:07:57,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:58,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:58,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 14 treesize of output 16 [2023-08-31 22:07:58,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:58,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:58,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-08-31 22:07:58,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-08-31 22:07:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651079676] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:58,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-08-31 22:07:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323447288] [2023-08-31 22:07:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 22:07:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 22:07:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-08-31 22:08:00,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 232 [2023-08-31 22:08:00,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 32 transitions, 267 flow. Second operand has 20 states, 20 states have (on average 74.0) internal successors, (1480), 20 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:00,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:00,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 232 [2023-08-31 22:08:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:01,160 INFO L130 PetriNetUnfolder]: 20/72 cut-off events. [2023-08-31 22:08:01,161 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-31 22:08:01,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 72 events. 20/72 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 161 event pairs, 2 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 339. Up to 51 conditions per place. [2023-08-31 22:08:01,162 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2023-08-31 22:08:01,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 34 transitions, 328 flow [2023-08-31 22:08:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:08:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:08:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2023-08-31 22:08:01,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32830459770114945 [2023-08-31 22:08:01,172 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 457 transitions. [2023-08-31 22:08:01,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 457 transitions. [2023-08-31 22:08:01,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:01,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 457 transitions. [2023-08-31 22:08:01,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:01,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:01,177 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:01,177 INFO L175 Difference]: Start difference. First operand has 66 places, 32 transitions, 267 flow. Second operand 6 states and 457 transitions. [2023-08-31 22:08:01,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 34 transitions, 328 flow [2023-08-31 22:08:01,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 34 transitions, 293 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-31 22:08:01,181 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 231 flow [2023-08-31 22:08:01,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2023-08-31 22:08:01,181 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-31 22:08:01,182 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 231 flow [2023-08-31 22:08:01,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 74.0) internal successors, (1480), 20 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:01,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:01,182 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:01,189 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-31 22:08:01,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:01,388 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:01,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2133052236, now seen corresponding path program 2 times [2023-08-31 22:08:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960715445] [2023-08-31 22:08:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960715445] [2023-08-31 22:08:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960715445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507470463] [2023-08-31 22:08:01,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:08:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:01,776 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-31 22:08:01,779 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-31 22:08:01,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:08:01,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:01,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 22:08:01,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:01,928 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2023-08-31 22:08:01,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2023-08-31 22:08:01,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:01,987 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-31 22:08:01,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-31 22:08:02,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:02,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:02,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:02,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:02,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:02,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:02,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:02,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-08-31 22:08:02,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-08-31 22:08:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507470463] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:02,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-08-31 22:08:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077377767] [2023-08-31 22:08:02,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:02,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-31 22:08:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-31 22:08:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2023-08-31 22:08:05,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 232 [2023-08-31 22:08:05,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 30 transitions, 231 flow. Second operand has 23 states, 23 states have (on average 73.8695652173913) internal successors, (1699), 23 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:05,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:05,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 232 [2023-08-31 22:08:05,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:05,516 INFO L130 PetriNetUnfolder]: 19/67 cut-off events. [2023-08-31 22:08:05,516 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2023-08-31 22:08:05,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 67 events. 19/67 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 2 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 291. Up to 43 conditions per place. [2023-08-31 22:08:05,517 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 26 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2023-08-31 22:08:05,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 34 transitions, 299 flow [2023-08-31 22:08:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:08:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:08:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2023-08-31 22:08:05,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32697044334975367 [2023-08-31 22:08:05,520 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 531 transitions. [2023-08-31 22:08:05,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 531 transitions. [2023-08-31 22:08:05,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:05,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 531 transitions. [2023-08-31 22:08:05,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:05,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:05,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:05,523 INFO L175 Difference]: Start difference. First operand has 61 places, 30 transitions, 231 flow. Second operand 7 states and 531 transitions. [2023-08-31 22:08:05,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 34 transitions, 299 flow [2023-08-31 22:08:05,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 268 flow, removed 2 selfloop flow, removed 10 redundant places. [2023-08-31 22:08:05,525 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 213 flow [2023-08-31 22:08:05,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-08-31 22:08:05,526 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:08:05,526 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 213 flow [2023-08-31 22:08:05,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 73.8695652173913) internal successors, (1699), 23 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:05,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:05,527 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:05,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 22:08:05,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:05,736 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:05,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1662643835, now seen corresponding path program 3 times [2023-08-31 22:08:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672256327] [2023-08-31 22:08:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:06,404 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-31 22:08:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672256327] [2023-08-31 22:08:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672256327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048253897] [2023-08-31 22:08:06,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:08:06,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:06,407 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-31 22:08:06,409 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-31 22:08:06,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 22:08:06,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:06,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-31 22:08:06,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:06,585 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2023-08-31 22:08:06,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2023-08-31 22:08:06,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:06,660 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-31 22:08:06,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-31 22:08:06,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:06,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:06,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:06,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:06,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:06,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:06,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:06,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:07,017 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-31 22:08:07,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:07,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-08-31 22:08:07,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-08-31 22:08:07,463 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-31 22:08:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048253897] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:07,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-08-31 22:08:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721778282] [2023-08-31 22:08:07,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:07,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-31 22:08:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:07,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-31 22:08:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=2, NotChecked=0, Total=650 [2023-08-31 22:08:09,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:12,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 232 [2023-08-31 22:08:12,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 213 flow. Second operand has 26 states, 26 states have (on average 66.76923076923077) internal successors, (1736), 26 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:12,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:12,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 232 [2023-08-31 22:08:12,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:13,339 INFO L130 PetriNetUnfolder]: 18/62 cut-off events. [2023-08-31 22:08:13,339 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2023-08-31 22:08:13,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 62 events. 18/62 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 1 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 256. Up to 35 conditions per place. [2023-08-31 22:08:13,340 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 24 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2023-08-31 22:08:13,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 274 flow [2023-08-31 22:08:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:08:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:08:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 615 transitions. [2023-08-31 22:08:13,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29454022988505746 [2023-08-31 22:08:13,342 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 615 transitions. [2023-08-31 22:08:13,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 615 transitions. [2023-08-31 22:08:13,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:13,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 615 transitions. [2023-08-31 22:08:13,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.33333333333333) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:13,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:13,345 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:13,345 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 213 flow. Second operand 9 states and 615 transitions. [2023-08-31 22:08:13,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 274 flow [2023-08-31 22:08:13,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 34 transitions, 252 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-31 22:08:13,348 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 190 flow [2023-08-31 22:08:13,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2023-08-31 22:08:13,348 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:08:13,348 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 190 flow [2023-08-31 22:08:13,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 66.76923076923077) internal successors, (1736), 26 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:13,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:13,349 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:13,357 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-31 22:08:13,555 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,SelfDestructingSolverStorable20 [2023-08-31 22:08:13,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:13,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 35114698, now seen corresponding path program 2 times [2023-08-31 22:08:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104638499] [2023-08-31 22:08:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104638499] [2023-08-31 22:08:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104638499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681299332] [2023-08-31 22:08:14,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:08:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:14,329 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-31 22:08:14,354 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-31 22:08:14,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:08:14,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:14,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-31 22:08:14,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:14,510 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:08:14,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:08:14,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:14,610 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:08:14,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:08:14,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:14,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:15,030 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_519 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_519) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-31 22:08:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-31 22:08:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681299332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:15,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-08-31 22:08:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373214871] [2023-08-31 22:08:15,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:15,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-31 22:08:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:15,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-31 22:08:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=729, Unknown=18, NotChecked=54, Total=870 [2023-08-31 22:08:15,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 232 [2023-08-31 22:08:15,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 190 flow. Second operand has 30 states, 30 states have (on average 41.56666666666667) internal successors, (1247), 30 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:15,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:15,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 232 [2023-08-31 22:08:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:22,692 WARN L222 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:08:22,856 INFO L130 PetriNetUnfolder]: 17/56 cut-off events. [2023-08-31 22:08:22,856 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-31 22:08:22,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 56 events. 17/56 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 1 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 229. Up to 26 conditions per place. [2023-08-31 22:08:22,857 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 24 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2023-08-31 22:08:22,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 34 transitions, 266 flow [2023-08-31 22:08:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 22:08:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 22:08:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 432 transitions. [2023-08-31 22:08:22,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18620689655172415 [2023-08-31 22:08:22,859 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 432 transitions. [2023-08-31 22:08:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 432 transitions. [2023-08-31 22:08:22,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:22,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 432 transitions. [2023-08-31 22:08:22,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 43.2) internal successors, (432), 10 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:22,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:22,863 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:22,863 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 190 flow. Second operand 10 states and 432 transitions. [2023-08-31 22:08:22,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 34 transitions, 266 flow [2023-08-31 22:08:22,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 246 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-31 22:08:22,865 INFO L231 Difference]: Finished difference. Result has 57 places, 26 transitions, 187 flow [2023-08-31 22:08:22,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=26} [2023-08-31 22:08:22,865 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:08:22,865 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 26 transitions, 187 flow [2023-08-31 22:08:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 41.56666666666667) internal successors, (1247), 30 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:22,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:22,866 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:22,873 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-31 22:08:23,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:23,072 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:23,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 36363467, now seen corresponding path program 3 times [2023-08-31 22:08:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001520356] [2023-08-31 22:08:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001520356] [2023-08-31 22:08:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001520356] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638823580] [2023-08-31 22:08:23,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:08:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:23,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:23,929 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-31 22:08:23,934 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-31 22:08:24,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-31 22:08:24,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:24,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-31 22:08:24,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:24,114 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:08:24,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:08:24,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:24,206 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:08:24,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:08:24,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:24,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:24,573 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)) 0)) is different from false [2023-08-31 22:08:24,609 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-31 22:08:24,647 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-31 22:08:24,651 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_585) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 6 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) 0)) is different from false [2023-08-31 22:08:24,691 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (= (select (select (store |c_#memory_int| c_~v~0.base v_ArrVal_585) 3) 7) 0)) is different from false [2023-08-31 22:08:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-08-31 22:08:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638823580] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:36,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-08-31 22:08:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061595239] [2023-08-31 22:08:36,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:36,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-31 22:08:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-31 22:08:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=834, Unknown=29, NotChecked=310, Total=1260 [2023-08-31 22:08:36,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 232 [2023-08-31 22:08:37,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 26 transitions, 187 flow. Second operand has 36 states, 36 states have (on average 41.361111111111114) internal successors, (1489), 36 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:37,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:37,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 232 [2023-08-31 22:08:37,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:38,319 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-08-31 22:08:38,319 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-31 22:08:38,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 46 events. 11/46 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 1 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 183. Up to 11 conditions per place. [2023-08-31 22:08:38,320 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 21 selfloop transitions, 12 changer transitions 0/33 dead transitions. [2023-08-31 22:08:38,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 33 transitions, 233 flow [2023-08-31 22:08:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-31 22:08:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-31 22:08:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 594 transitions. [2023-08-31 22:08:38,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1828817733990148 [2023-08-31 22:08:38,321 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 594 transitions. [2023-08-31 22:08:38,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 594 transitions. [2023-08-31 22:08:38,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:38,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 594 transitions. [2023-08-31 22:08:38,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 42.42857142857143) internal successors, (594), 14 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:38,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 232.0) internal successors, (3480), 15 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:38,324 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 232.0) internal successors, (3480), 15 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:38,324 INFO L175 Difference]: Start difference. First operand has 57 places, 26 transitions, 187 flow. Second operand 14 states and 594 transitions. [2023-08-31 22:08:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 33 transitions, 233 flow [2023-08-31 22:08:38,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 33 transitions, 177 flow, removed 6 selfloop flow, removed 19 redundant places. [2023-08-31 22:08:38,326 INFO L231 Difference]: Finished difference. Result has 50 places, 22 transitions, 112 flow [2023-08-31 22:08:38,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=22} [2023-08-31 22:08:38,326 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-31 22:08:38,326 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 22 transitions, 112 flow [2023-08-31 22:08:38,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 41.361111111111114) internal successors, (1489), 36 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:08:38,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:38,327 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:38,337 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-31 22:08:38,533 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,SelfDestructingSolverStorable22 [2023-08-31 22:08:38,533 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:38,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1135128259, now seen corresponding path program 3 times [2023-08-31 22:08:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381764725] [2023-08-31 22:08:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:39,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:39,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381764725] [2023-08-31 22:08:39,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381764725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:39,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965111357] [2023-08-31 22:08:39,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:08:39,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:39,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:39,249 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-31 22:08:39,251 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-31 22:08:39,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 22:08:39,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:39,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-31 22:08:39,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:39,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:39,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:39,394 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-31 22:08:39,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:08:39,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:39,527 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-31 22:08:39,528 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-31 22:08:39,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:39,592 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-08-31 22:08:39,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40 [2023-08-31 22:08:39,684 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-31 22:08:39,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2023-08-31 22:08:39,872 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-31 22:08:39,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 73 [2023-08-31 22:08:40,053 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-31 22:08:40,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 87 [2023-08-31 22:08:40,290 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-31 22:08:40,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 101 [2023-08-31 22:08:40,549 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-08-31 22:08:40,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 115 [2023-08-31 22:08:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:40,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965111357] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:05,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-08-31 22:10:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309715272] [2023-08-31 22:10:05,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:05,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-31 22:10:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-31 22:10:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=935, Unknown=41, NotChecked=0, Total=1122 [2023-08-31 22:10:07,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:11,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:14,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:16,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 232 [2023-08-31 22:10:16,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 22 transitions, 112 flow. Second operand has 34 states, 34 states have (on average 42.5) internal successors, (1445), 34 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:16,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:16,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 232 [2023-08-31 22:10:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:17,247 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2023-08-31 22:10:17,247 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-31 22:10:17,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 39 events. 10/39 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 30 event pairs, 1 based on Foata normal form. 3/42 useless extension candidates. Maximal degree in co-relation 129. Up to 10 conditions per place. [2023-08-31 22:10:17,248 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 17 selfloop transitions, 10 changer transitions 0/27 dead transitions. [2023-08-31 22:10:17,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 27 transitions, 163 flow [2023-08-31 22:10:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 22:10:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 22:10:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 521 transitions. [2023-08-31 22:10:17,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18714080459770116 [2023-08-31 22:10:17,249 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 521 transitions. [2023-08-31 22:10:17,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 521 transitions. [2023-08-31 22:10:17,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:17,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 521 transitions. [2023-08-31 22:10:17,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 43.416666666666664) internal successors, (521), 12 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:17,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:17,254 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:17,254 INFO L175 Difference]: Start difference. First operand has 50 places, 22 transitions, 112 flow. Second operand 12 states and 521 transitions. [2023-08-31 22:10:17,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 27 transitions, 163 flow [2023-08-31 22:10:17,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 27 transitions, 136 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-08-31 22:10:17,255 INFO L231 Difference]: Finished difference. Result has 44 places, 19 transitions, 86 flow [2023-08-31 22:10:17,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=86, PETRI_PLACES=44, PETRI_TRANSITIONS=19} [2023-08-31 22:10:17,255 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-31 22:10:17,255 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 86 flow [2023-08-31 22:10:17,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 42.5) internal successors, (1445), 34 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:17,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:17,256 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:17,261 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-31 22:10:17,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-31 22:10:17,456 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:17,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -829307970, now seen corresponding path program 4 times [2023-08-31 22:10:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296628448] [2023-08-31 22:10:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:10:17,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 22:10:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:10:17,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 22:10:17,533 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 22:10:17,534 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-31 22:10:17,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-31 22:10:17,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-31 22:10:17,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-31 22:10:17,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-31 22:10:17,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-31 22:10:17,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-31 22:10:17,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-31 22:10:17,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-31 22:10:17,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-31 22:10:17,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 22:10:17,539 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:17,544 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 22:10:17,544 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 22:10:17,568 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,569 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,569 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,569 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,569 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,569 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,570 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,570 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,570 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,570 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,571 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,571 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,571 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,571 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,571 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,572 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,572 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,572 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,572 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,572 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,573 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,573 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,573 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,573 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,574 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,574 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,574 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,574 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,574 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,575 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,575 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,575 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,575 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,575 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,576 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,576 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,576 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,576 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,576 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,577 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,577 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,577 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,577 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,577 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,578 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,578 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,578 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,578 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:17,578 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:17,581 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:17,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 10:10:17 BasicIcfg [2023-08-31 22:10:17,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 22:10:17,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 22:10:17,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 22:10:17,604 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 22:10:17,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37" (3/4) ... [2023-08-31 22:10:17,606 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 22:10:17,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 22:10:17,607 INFO L158 Benchmark]: Toolchain (without parser) took 161018.34ms. Allocated memory was 67.1MB in the beginning and 195.0MB in the end (delta: 127.9MB). Free memory was 34.3MB in the beginning and 146.9MB in the end (delta: -112.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-08-31 22:10:17,607 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:10:17,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.05ms. Allocated memory is still 67.1MB. Free memory was 34.1MB in the beginning and 34.7MB in the end (delta: -591.0kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2023-08-31 22:10:17,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.60ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 22:10:17,608 INFO L158 Benchmark]: Boogie Preprocessor took 51.61ms. Allocated memory is still 67.1MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:10:17,608 INFO L158 Benchmark]: RCFGBuilder took 537.40ms. Allocated memory is still 67.1MB. Free memory was 30.5MB in the beginning and 31.7MB in the end (delta: -1.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-08-31 22:10:17,608 INFO L158 Benchmark]: TraceAbstraction took 159761.74ms. Allocated memory was 67.1MB in the beginning and 195.0MB in the end (delta: 127.9MB). Free memory was 30.9MB in the beginning and 146.9MB in the end (delta: -116.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-08-31 22:10:17,608 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 195.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:10:17,613 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 40.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.05ms. Allocated memory is still 67.1MB. Free memory was 34.1MB in the beginning and 34.7MB in the end (delta: -591.0kB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.60ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.61ms. Allocated memory is still 67.1MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 537.40ms. Allocated memory is still 67.1MB. Free memory was 30.5MB in the beginning and 31.7MB in the end (delta: -1.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 159761.74ms. Allocated memory was 67.1MB in the beginning and 195.0MB in the end (delta: 127.9MB). Free memory was 30.9MB in the beginning and 146.9MB in the end (delta: -116.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 195.0MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 107 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 121 TotalNumberOfCompositions, 461 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 186, independent: 176, independent conditional: 0, independent unconditional: 176, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 372, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 186, unknown conditional: 0, unknown unconditional: 186] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=2147483646, t1={16:0}, t2={15:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=2147483646, arg={0:0}, t1={16:0}, t2={15:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=2147483646, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=2147483647, t1={16:0}, t2={15:0}, v={9:0}] [L1125] 0 \read(t2) VAL [\read(t2)=2147483647, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=2147483647, \result={0:0}, arg={0:0}, arg={0:0}, t1={16:0}, t2={15:0}, v={9:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 159.5s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 132 mSolverCounterUnknown, 8213 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6871 mSDsluCounter, 8441 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 299 IncrementalHoareTripleChecker+Unchecked, 8180 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36546 IncrementalHoareTripleChecker+Invalid, 37536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 261 mSDtfsCounter, 36546 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 352 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 111.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=18, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 109.7s InterpolantComputationTime, 425 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 504 ConstructedInterpolants, 100 QuantifiedInterpolants, 9814 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 45 InterpolantComputations, 14 PerfectInterpolantSequences, 40/332 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 22:10:17,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/bigshot_s.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 22:10:19,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:10:19,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:10:19,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:10:19,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:10:19,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:10:19,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:10:19,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:10:19,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:10:19,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:10:19,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:10:19,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:10:19,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:10:19,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:10:19,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:10:19,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:10:19,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:10:19,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:10:19,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:10:19,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:10:19,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:10:19,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:10:19,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:10:19,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:10:19,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:10:19,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:10:19,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:10:19,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:10:19,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:10:19,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:10:19,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:10:19,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:10:19,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:10:19,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:10:19,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:10:19,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:10:19,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:10:19,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:10:19,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:10:19,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:10:19,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:10:19,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 22:10:19,568 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:10:19,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:10:19,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:10:19,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:10:19,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:10:19,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:10:19,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:10:19,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:10:19,572 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:10:19,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:10:19,573 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:10:19,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:10:19,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:10:19,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:10:19,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:10:19,574 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:10:19,574 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:10:19,574 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:10:19,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:10:19,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:10:19,575 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 22:10:19,575 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 22:10:19,575 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:10:19,575 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:10:19,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:10:19,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:10:19,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:10:19,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:10:19,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:10:19,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:10:19,576 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 22:10:19,577 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 22:10:19,577 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:10:19,577 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:10:19,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:10:19,577 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 22:10:19,578 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:10:19,578 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe 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 -> BEFORE [2023-08-31 22:10:19,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:10:19,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:10:19,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:10:19,879 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:10:19,879 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:10:19,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-31 22:10:20,909 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:10:21,154 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:10:21,154 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i [2023-08-31 22:10:21,168 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9dbe922/eacfdd1562c4424b89097ec70d7cd5d1/FLAGb8135a038 [2023-08-31 22:10:21,194 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9dbe922/eacfdd1562c4424b89097ec70d7cd5d1 [2023-08-31 22:10:21,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:10:21,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:10:21,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:10:21,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:10:21,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:10:21,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f15a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21, skipping insertion in model container [2023-08-31 22:10:21,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:10:21,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:10:21,724 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i[55202,55215] [2023-08-31 22:10:21,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:10:21,762 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:10:21,815 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s.i[55202,55215] [2023-08-31 22:10:21,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:10:21,912 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:10:21,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21 WrapperNode [2023-08-31 22:10:21,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:10:21,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:10:21,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:10:21,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:10:21,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,968 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2023-08-31 22:10:21,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:10:21,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:10:21,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:10:21,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:10:21,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:21,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,013 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:10:22,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:10:22,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:10:22,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:10:22,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (1/1) ... [2023-08-31 22:10:22,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:10:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:22,057 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-31 22:10:22,084 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-31 22:10:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-31 22:10:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 22:10:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:10:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:10:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 22:10:22,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 22:10:22,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 22:10:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:10:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:10:22,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:10:22,119 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 22:10:22,315 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:10:22,318 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:10:22,585 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:10:22,591 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:10:22,591 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-31 22:10:22,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:22 BoogieIcfgContainer [2023-08-31 22:10:22,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:10:22,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:10:22,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:10:22,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:10:22,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:10:21" (1/3) ... [2023-08-31 22:10:22,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebd26b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:10:22, skipping insertion in model container [2023-08-31 22:10:22,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:21" (2/3) ... [2023-08-31 22:10:22,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebd26b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:10:22, skipping insertion in model container [2023-08-31 22:10:22,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:22" (3/3) ... [2023-08-31 22:10:22,599 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2023-08-31 22:10:22,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:10:22,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-31 22:10:22,616 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:10:22,716 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:10:22,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 112 transitions, 240 flow [2023-08-31 22:10:22,788 INFO L130 PetriNetUnfolder]: 5/110 cut-off events. [2023-08-31 22:10:22,789 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:22,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 5/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-31 22:10:22,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 112 transitions, 240 flow [2023-08-31 22:10:22,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 106 transitions, 224 flow [2023-08-31 22:10:22,802 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:10:22,813 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 106 transitions, 224 flow [2023-08-31 22:10:22,820 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 106 transitions, 224 flow [2023-08-31 22:10:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 224 flow [2023-08-31 22:10:22,848 INFO L130 PetriNetUnfolder]: 5/106 cut-off events. [2023-08-31 22:10:22,849 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:22,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 106 events. 5/106 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-31 22:10:22,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-31 22:10:31,490 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-31 22:10:31,491 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-31 22:10:31,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:10:31,507 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;@7d59b6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:10:31,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-31 22:10:31,509 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 22:10:31,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:31,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:31,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:10:31,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:31,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 436, now seen corresponding path program 1 times [2023-08-31 22:10:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573903419] [2023-08-31 22:10:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:31,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:31,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:31,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 22:10:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:31,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 22:10:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:31,590 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-31 22:10:31,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:31,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573903419] [2023-08-31 22:10:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573903419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:10:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572302507] [2023-08-31 22:10:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:31,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:10:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:10:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:10:31,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-31 22:10:31,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:31,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:31,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-31 22:10:31,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:31,733 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2023-08-31 22:10:31,733 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:31,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 196 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2023-08-31 22:10:31,735 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 22:10:31,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-31 22:10:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:10:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:10:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-31 22:10:31,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-31 22:10:31,747 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-31 22:10:31,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-31 22:10:31,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:31,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-31 22:10:31,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:31,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:31,758 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:31,759 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 240 transitions. [2023-08-31 22:10:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-31 22:10:31,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:10:31,762 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-31 22:10:31,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-31 22:10:31,766 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:10:31,766 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-31 22:10:31,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:31,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:31,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:10:31,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:31,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:31,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:31,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash 427108, now seen corresponding path program 1 times [2023-08-31 22:10:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46748853] [2023-08-31 22:10:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:31,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:31,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 22:10:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:32,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 22:10:32,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:32,092 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:10:32,093 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:10:32,117 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-31 22:10:32,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:32,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:32,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46748853] [2023-08-31 22:10:32,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46748853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056209188] [2023-08-31 22:10:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:32,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:32,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:32,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:32,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:32,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:32,271 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2023-08-31 22:10:32,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:32,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 186 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2023-08-31 22:10:32,272 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-31 22:10:32,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-31 22:10:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-08-31 22:10:32,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453900709219858 [2023-08-31 22:10:32,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-08-31 22:10:32,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-08-31 22:10:32,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:32,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-08-31 22:10:32,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,282 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 314 transitions. [2023-08-31 22:10:32,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-31 22:10:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 22:10:32,284 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-31 22:10:32,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-31 22:10:32,284 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:10:32,285 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-31 22:10:32,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:32,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:10:32,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:32,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:32,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 427109, now seen corresponding path program 1 times [2023-08-31 22:10:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249645219] [2023-08-31 22:10:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:32,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:32,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:32,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 22:10:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:32,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 22:10:32,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:32,584 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-31 22:10:32,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:32,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249645219] [2023-08-31 22:10:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249645219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986283904] [2023-08-31 22:10:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:32,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:32,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:32,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:32,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:32,917 INFO L130 PetriNetUnfolder]: 47/121 cut-off events. [2023-08-31 22:10:32,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 121 events. 47/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 466 event pairs, 30 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 246. Up to 61 conditions per place. [2023-08-31 22:10:32,919 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 42 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-31 22:10:32,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 199 flow [2023-08-31 22:10:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-31 22:10:32,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2023-08-31 22:10:32,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-31 22:10:32,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-31 22:10:32,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:32,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-31 22:10:32,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,927 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 335 transitions. [2023-08-31 22:10:32,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 199 flow [2023-08-31 22:10:32,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:32,929 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 82 flow [2023-08-31 22:10:32,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-31 22:10:32,930 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-31 22:10:32,930 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 82 flow [2023-08-31 22:10:32,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:32,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:32,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 22:10:32,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 22:10:33,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:33,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:33,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 13241362, now seen corresponding path program 1 times [2023-08-31 22:10:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974497016] [2023-08-31 22:10:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:33,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:33,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 22:10:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:33,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 22:10:33,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:33,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:33,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-31 22:10:33,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-31 22:10:33,319 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:33,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:10:33,375 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-31 22:10:33,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:33,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974497016] [2023-08-31 22:10:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974497016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:10:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503490344] [2023-08-31 22:10:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:33,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-31 22:10:33,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:33,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:33,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-31 22:10:33,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:33,709 INFO L130 PetriNetUnfolder]: 47/120 cut-off events. [2023-08-31 22:10:33,709 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-31 22:10:33,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 120 events. 47/120 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 461 event pairs, 30 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 253. Up to 113 conditions per place. [2023-08-31 22:10:33,710 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 22 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-08-31 22:10:33,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 130 flow [2023-08-31 22:10:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-31 22:10:33,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44042553191489364 [2023-08-31 22:10:33,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-31 22:10:33,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-31 22:10:33,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:33,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-31 22:10:33,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:33,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:33,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:33,717 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 82 flow. Second operand 4 states and 414 transitions. [2023-08-31 22:10:33,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 130 flow [2023-08-31 22:10:33,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:33,719 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 78 flow [2023-08-31 22:10:33,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-08-31 22:10:33,720 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-31 22:10:33,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 78 flow [2023-08-31 22:10:33,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:33,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:33,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:10:33,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:33,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:33,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:33,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:33,939 INFO L85 PathProgramCache]: Analyzing trace with hash -160580097, now seen corresponding path program 1 times [2023-08-31 22:10:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:33,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980969310] [2023-08-31 22:10:33,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:33,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:33,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:33,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:33,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 22:10:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:34,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 22:10:34,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:34,032 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:34,032 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-31 22:10:34,065 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:10:34,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 22:10:34,077 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-31 22:10:34,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:34,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980969310] [2023-08-31 22:10:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980969310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550252831] [2023-08-31 22:10:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:34,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:34,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:34,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:34,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:34,228 INFO L130 PetriNetUnfolder]: 33/92 cut-off events. [2023-08-31 22:10:34,228 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 22:10:34,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 92 events. 33/92 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 321 event pairs, 20 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 197. Up to 88 conditions per place. [2023-08-31 22:10:34,229 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-31 22:10:34,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 122 flow [2023-08-31 22:10:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-08-31 22:10:34,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425531914893617 [2023-08-31 22:10:34,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-08-31 22:10:34,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-08-31 22:10:34,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:34,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-08-31 22:10:34,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,235 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 78 flow. Second operand 3 states and 312 transitions. [2023-08-31 22:10:34,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 122 flow [2023-08-31 22:10:34,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:34,236 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2023-08-31 22:10:34,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-31 22:10:34,237 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:10:34,237 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2023-08-31 22:10:34,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:34,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:10:34,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:34,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:34,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:34,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -160580096, now seen corresponding path program 1 times [2023-08-31 22:10:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735691321] [2023-08-31 22:10:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:34,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:34,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:34,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:34,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 22:10:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:34,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:10:34,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:34,538 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:34,538 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-31 22:10:34,559 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:34,559 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:10:34,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:34,615 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-31 22:10:34,627 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 22:10:34,627 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 13 treesize of output 13 [2023-08-31 22:10:34,649 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-31 22:10:34,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:34,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735691321] [2023-08-31 22:10:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735691321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:10:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427876388] [2023-08-31 22:10:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:34,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-31 22:10:34,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:34,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-31 22:10:34,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:34,886 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-31 22:10:34,886 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:34,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 64 events. 19/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 194 event pairs, 10 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 139. Up to 60 conditions per place. [2023-08-31 22:10:34,887 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-31 22:10:34,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 112 flow [2023-08-31 22:10:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-31 22:10:34,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269503546099291 [2023-08-31 22:10:34,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-31 22:10:34,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-31 22:10:34,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:34,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-31 22:10:34,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,892 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 3 states and 301 transitions. [2023-08-31 22:10:34,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 112 flow [2023-08-31 22:10:34,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:34,893 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 68 flow [2023-08-31 22:10:34,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-31 22:10:34,893 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:10:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 68 flow [2023-08-31 22:10:34,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:34,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:34,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:34,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:35,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:35,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:35,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash 752237882, now seen corresponding path program 1 times [2023-08-31 22:10:35,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:35,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307658806] [2023-08-31 22:10:35,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:35,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:35,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:35,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:35,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 22:10:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:35,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:10:35,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:35,209 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-31 22:10:35,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-31 22:10:35,251 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:35,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-08-31 22:10:35,333 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-31 22:10:35,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:35,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:35,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307658806] [2023-08-31 22:10:35,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307658806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:35,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:35,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:10:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432219525] [2023-08-31 22:10:35,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:35,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:10:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:10:35,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:10:35,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 235 [2023-08-31 22:10:35,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:35,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:35,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 235 [2023-08-31 22:10:35,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:35,601 INFO L130 PetriNetUnfolder]: 19/74 cut-off events. [2023-08-31 22:10:35,601 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-31 22:10:35,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 74 events. 19/74 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 252 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 165. Up to 42 conditions per place. [2023-08-31 22:10:35,601 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-08-31 22:10:35,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 147 flow [2023-08-31 22:10:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2023-08-31 22:10:35,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861702127659574 [2023-08-31 22:10:35,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 363 transitions. [2023-08-31 22:10:35,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 363 transitions. [2023-08-31 22:10:35,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:35,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 363 transitions. [2023-08-31 22:10:35,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:35,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:35,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:35,606 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 68 flow. Second operand 4 states and 363 transitions. [2023-08-31 22:10:35,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 147 flow [2023-08-31 22:10:35,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:35,607 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 80 flow [2023-08-31 22:10:35,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-31 22:10:35,608 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:10:35,608 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 80 flow [2023-08-31 22:10:35,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:35,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:35,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:35,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:35,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:35,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:35,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 752237920, now seen corresponding path program 1 times [2023-08-31 22:10:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:35,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922161818] [2023-08-31 22:10:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:35,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:35,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:35,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 22:10:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:35,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 22:10:35,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:35,970 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-31 22:10:35,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-31 22:10:36,005 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-31 22:10:36,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-31 22:10:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:36,169 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-31 22:10:36,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-31 22:10:36,207 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-31 22:10:36,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-31 22:10:36,420 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-31 22:10:36,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:36,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922161818] [2023-08-31 22:10:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922161818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508724940] [2023-08-31 22:10:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:10:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:10:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:10:36,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:36,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:36,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:36,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:36,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:37,093 INFO L130 PetriNetUnfolder]: 28/108 cut-off events. [2023-08-31 22:10:37,093 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-31 22:10:37,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 108 events. 28/108 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 473 event pairs, 12 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 241. Up to 67 conditions per place. [2023-08-31 22:10:37,095 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 25 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2023-08-31 22:10:37,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 181 flow [2023-08-31 22:10:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:10:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:10:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2023-08-31 22:10:37,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4279635258358663 [2023-08-31 22:10:37,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2023-08-31 22:10:37,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2023-08-31 22:10:37,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:37,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2023-08-31 22:10:37,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,103 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,104 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 80 flow. Second operand 7 states and 704 transitions. [2023-08-31 22:10:37,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 181 flow [2023-08-31 22:10:37,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:10:37,106 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 115 flow [2023-08-31 22:10:37,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-08-31 22:10:37,109 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-08-31 22:10:37,109 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 115 flow [2023-08-31 22:10:37,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:37,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:37,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-31 22:10:37,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:37,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:37,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 752237991, now seen corresponding path program 1 times [2023-08-31 22:10:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634805798] [2023-08-31 22:10:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:37,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 22:10:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 22:10:37,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:37,396 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-31 22:10:37,434 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-31 22:10:37,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:37,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:37,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634805798] [2023-08-31 22:10:37,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634805798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:37,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:37,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819181757] [2023-08-31 22:10:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:37,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:37,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:37,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:37,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:37,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:37,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:37,647 INFO L130 PetriNetUnfolder]: 26/96 cut-off events. [2023-08-31 22:10:37,647 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-31 22:10:37,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 96 events. 26/96 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 375 event pairs, 12 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 242. Up to 67 conditions per place. [2023-08-31 22:10:37,648 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-08-31 22:10:37,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 190 flow [2023-08-31 22:10:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-31 22:10:37,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44148936170212766 [2023-08-31 22:10:37,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-31 22:10:37,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-31 22:10:37,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:37,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-31 22:10:37,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,653 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 115 flow. Second operand 4 states and 415 transitions. [2023-08-31 22:10:37,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 190 flow [2023-08-31 22:10:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 187 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:37,658 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 120 flow [2023-08-31 22:10:37,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-31 22:10:37,659 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-31 22:10:37,659 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 120 flow [2023-08-31 22:10:37,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:37,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:37,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:37,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:37,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:37,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 752237992, now seen corresponding path program 1 times [2023-08-31 22:10:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929294058] [2023-08-31 22:10:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:37,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:37,870 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:37,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 22:10:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:37,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 22:10:37,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:37,939 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 7 [2023-08-31 22:10:37,956 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-31 22:10:37,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:37,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:37,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929294058] [2023-08-31 22:10:37,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929294058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601640180] [2023-08-31 22:10:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:37,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:38,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-31 22:10:38,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:38,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:38,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-31 22:10:38,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:38,136 INFO L130 PetriNetUnfolder]: 22/78 cut-off events. [2023-08-31 22:10:38,136 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-31 22:10:38,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 78 events. 22/78 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 259 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 223. Up to 48 conditions per place. [2023-08-31 22:10:38,137 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 19 selfloop transitions, 8 changer transitions 0/27 dead transitions. [2023-08-31 22:10:38,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 177 flow [2023-08-31 22:10:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2023-08-31 22:10:38,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351063829787234 [2023-08-31 22:10:38,140 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 409 transitions. [2023-08-31 22:10:38,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 409 transitions. [2023-08-31 22:10:38,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:38,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 409 transitions. [2023-08-31 22:10:38,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:38,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:38,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:38,143 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 120 flow. Second operand 4 states and 409 transitions. [2023-08-31 22:10:38,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 177 flow [2023-08-31 22:10:38,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 171 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:38,148 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 126 flow [2023-08-31 22:10:38,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-31 22:10:38,149 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2023-08-31 22:10:38,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 126 flow [2023-08-31 22:10:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:10:38,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:38,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:38,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:38,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:38,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:38,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1844542252, now seen corresponding path program 1 times [2023-08-31 22:10:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548791957] [2023-08-31 22:10:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:10:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:38,361 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:10:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 22:10:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:38,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 22:10:38,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:38,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:38,503 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-31 22:10:38,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-31 22:10:38,543 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-31 22:10:38,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-31 22:10:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:38,675 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-31 22:10:38,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-31 22:10:38,710 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-31 22:10:38,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-31 22:10:38,947 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-31 22:10:38,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:39,103 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-31 22:10:39,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548791957] [2023-08-31 22:10:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548791957] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:39,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:10:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-31 22:10:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314199034] [2023-08-31 22:10:39,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:39,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 22:10:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 22:10:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 22:10:41,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:43,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:45,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:47,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:49,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:51,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:53,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:56,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:58,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:00,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:02,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:04,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:06,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:08,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:10,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:12,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:14,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:17,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:17,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 235 [2023-08-31 22:11:17,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:17,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:17,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 235 [2023-08-31 22:11:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:17,976 INFO L130 PetriNetUnfolder]: 45/140 cut-off events. [2023-08-31 22:11:17,976 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2023-08-31 22:11:17,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 140 events. 45/140 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 569 event pairs, 6 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 385. Up to 37 conditions per place. [2023-08-31 22:11:17,977 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 31 selfloop transitions, 19 changer transitions 0/50 dead transitions. [2023-08-31 22:11:17,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 322 flow [2023-08-31 22:11:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 22:11:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 22:11:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 958 transitions. [2023-08-31 22:11:17,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31358428805237315 [2023-08-31 22:11:17,980 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 958 transitions. [2023-08-31 22:11:17,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 958 transitions. [2023-08-31 22:11:17,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:17,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 958 transitions. [2023-08-31 22:11:17,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.6923076923077) internal successors, (958), 13 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:17,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 235.0) internal successors, (3290), 14 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:17,987 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 126 flow. Second operand 13 states and 958 transitions. [2023-08-31 22:11:17,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 322 flow [2023-08-31 22:11:17,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:17,991 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 227 flow [2023-08-31 22:11:17,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=227, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 22:11:17,992 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-31 22:11:17,992 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 227 flow [2023-08-31 22:11:17,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.0) internal successors, (720), 10 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:17,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:17,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:18,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:18,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:18,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1844542323, now seen corresponding path program 1 times [2023-08-31 22:11:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964244093] [2023-08-31 22:11:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:18,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:18,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:18,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:18,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 22:11:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:18,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:11:18,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:18,280 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-31 22:11:18,338 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-31 22:11:18,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:18,411 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-31 22:11:18,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964244093] [2023-08-31 22:11:18,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964244093] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:18,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:18,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-31 22:11:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667426749] [2023-08-31 22:11:18,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:18,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 22:11:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 22:11:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 22:11:18,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-31 22:11:18,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 227 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:18,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:18,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-31 22:11:18,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:19,163 INFO L130 PetriNetUnfolder]: 37/124 cut-off events. [2023-08-31 22:11:19,163 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2023-08-31 22:11:19,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 124 events. 37/124 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 484 event pairs, 8 based on Foata normal form. 12/136 useless extension candidates. Maximal degree in co-relation 431. Up to 45 conditions per place. [2023-08-31 22:11:19,164 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-31 22:11:19,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 355 flow [2023-08-31 22:11:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:11:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:11:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-08-31 22:11:19,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231003039513678 [2023-08-31 22:11:19,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-08-31 22:11:19,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-08-31 22:11:19,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:19,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-08-31 22:11:19,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,171 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 227 flow. Second operand 7 states and 696 transitions. [2023-08-31 22:11:19,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 355 flow [2023-08-31 22:11:19,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 318 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-31 22:11:19,173 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 198 flow [2023-08-31 22:11:19,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 22:11:19,174 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-31 22:11:19,174 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 198 flow [2023-08-31 22:11:19,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:19,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:19,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-08-31 22:11:19,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:19,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:19,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 549438196, now seen corresponding path program 1 times [2023-08-31 22:11:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72615511] [2023-08-31 22:11:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:19,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 22:11:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:19,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-31 22:11:19,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:19,461 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-31 22:11:19,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:19,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72615511] [2023-08-31 22:11:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72615511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:19,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:19,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:11:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081678648] [2023-08-31 22:11:19,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:19,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:11:19,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:19,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:11:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:11:19,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-31 22:11:19,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:19,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-31 22:11:19,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:19,530 INFO L130 PetriNetUnfolder]: 34/112 cut-off events. [2023-08-31 22:11:19,531 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-31 22:11:19,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 112 events. 34/112 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 402 event pairs, 22 based on Foata normal form. 4/116 useless extension candidates. Maximal degree in co-relation 390. Up to 109 conditions per place. [2023-08-31 22:11:19,532 INFO L137 encePairwiseOnDemand]: 233/235 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-31 22:11:19,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 29 transitions, 236 flow [2023-08-31 22:11:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:11:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:11:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-31 22:11:19,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595744680851064 [2023-08-31 22:11:19,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-31 22:11:19,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-31 22:11:19,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:19,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-31 22:11:19,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,537 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 198 flow. Second operand 3 states and 324 transitions. [2023-08-31 22:11:19,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 29 transitions, 236 flow [2023-08-31 22:11:19,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 223 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 22:11:19,538 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 167 flow [2023-08-31 22:11:19,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-31 22:11:19,539 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-31 22:11:19,539 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 167 flow [2023-08-31 22:11:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:19,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:19,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:19,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:19,749 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:19,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -152178954, now seen corresponding path program 1 times [2023-08-31 22:11:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029878362] [2023-08-31 22:11:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:19,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:19,751 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:19,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-31 22:11:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:19,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-31 22:11:19,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:19,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-31 22:11:19,911 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-31 22:11:19,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:19,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029878362] [2023-08-31 22:11:19,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029878362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:11:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602435719] [2023-08-31 22:11:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:19,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:11:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:11:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:11:20,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-31 22:11:20,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:20,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-31 22:11:20,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:20,134 INFO L130 PetriNetUnfolder]: 33/110 cut-off events. [2023-08-31 22:11:20,134 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-31 22:11:20,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 110 events. 33/110 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 399 event pairs, 18 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 360. Up to 91 conditions per place. [2023-08-31 22:11:20,135 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-08-31 22:11:20,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 228 flow [2023-08-31 22:11:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:11:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:11:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-31 22:11:20,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43319148936170215 [2023-08-31 22:11:20,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-31 22:11:20,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-31 22:11:20,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:20,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-31 22:11:20,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,141 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 167 flow. Second operand 5 states and 509 transitions. [2023-08-31 22:11:20,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 228 flow [2023-08-31 22:11:20,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:11:20,142 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 167 flow [2023-08-31 22:11:20,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 22:11:20,143 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:11:20,143 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 167 flow [2023-08-31 22:11:20,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:20,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:20,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:20,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:20,352 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:20,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1233141669, now seen corresponding path program 1 times [2023-08-31 22:11:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472628011] [2023-08-31 22:11:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:20,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:20,355 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:20,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-31 22:11:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:20,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 22:11:20,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:20,474 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2023-08-31 22:11:20,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2023-08-31 22:11:20,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:20,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:20,566 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-31 22:11:20,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:20,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472628011] [2023-08-31 22:11:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472628011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:11:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333898232] [2023-08-31 22:11:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:20,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:11:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:11:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:11:20,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 235 [2023-08-31 22:11:20,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:20,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 235 [2023-08-31 22:11:20,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:20,907 INFO L130 PetriNetUnfolder]: 31/100 cut-off events. [2023-08-31 22:11:20,907 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2023-08-31 22:11:20,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 100 events. 31/100 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 327 event pairs, 2 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 362. Up to 75 conditions per place. [2023-08-31 22:11:20,908 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 25 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-31 22:11:20,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 230 flow [2023-08-31 22:11:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:11:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:11:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-31 22:11:20,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42340425531914894 [2023-08-31 22:11:20,910 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-31 22:11:20,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-31 22:11:20,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:20,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-31 22:11:20,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,913 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 167 flow. Second operand 4 states and 398 transitions. [2023-08-31 22:11:20,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 230 flow [2023-08-31 22:11:20,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 222 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:20,914 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 175 flow [2023-08-31 22:11:20,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 22:11:20,915 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:11:20,915 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 175 flow [2023-08-31 22:11:20,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:20,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:20,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:20,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:21,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:21,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:21,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash -422767146, now seen corresponding path program 1 times [2023-08-31 22:11:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028634445] [2023-08-31 22:11:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:21,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:21,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:21,123 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:21,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-31 22:11:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:21,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 22:11:21,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:21,283 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:21,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:21,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:21,368 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:11:21,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:11:21,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:21,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:21,500 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-31 22:11:21,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:21,531 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_210) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2023-08-31 22:11:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 22:11:21,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028634445] [2023-08-31 22:11:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028634445] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:21,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-31 22:11:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494002337] [2023-08-31 22:11:21,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 22:11:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 22:11:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=78, Unknown=9, NotChecked=18, Total=132 [2023-08-31 22:11:22,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 235 [2023-08-31 22:11:22,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 175 flow. Second operand has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:22,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:22,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 235 [2023-08-31 22:11:22,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:22,600 INFO L130 PetriNetUnfolder]: 28/88 cut-off events. [2023-08-31 22:11:22,600 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-08-31 22:11:22,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 88 events. 28/88 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 257 event pairs, 0 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 337. Up to 63 conditions per place. [2023-08-31 22:11:22,601 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-31 22:11:22,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 212 flow [2023-08-31 22:11:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:11:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:11:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-08-31 22:11:22,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2102127659574468 [2023-08-31 22:11:22,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-08-31 22:11:22,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-08-31 22:11:22,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:22,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-08-31 22:11:22,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:22,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:22,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:22,606 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 175 flow. Second operand 5 states and 247 transitions. [2023-08-31 22:11:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 212 flow [2023-08-31 22:11:22,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 202 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:22,607 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 148 flow [2023-08-31 22:11:22,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-08-31 22:11:22,608 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:11:22,608 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2023-08-31 22:11:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 47.0) internal successors, (564), 12 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:22,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:22,609 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:22,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:22,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:22,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:22,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 949833824, now seen corresponding path program 2 times [2023-08-31 22:11:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542303091] [2023-08-31 22:11:22,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:22,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:22,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:22,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-08-31 22:11:22,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:11:22,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:22,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 22:11:22,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:22,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:22,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:22,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:11:22,983 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:22,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:23,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:23,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-31 22:11:23,163 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-31 22:11:23,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:23,372 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-31 22:11:23,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542303091] [2023-08-31 22:11:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542303091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:23,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-31 22:11:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75623942] [2023-08-31 22:11:23,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:11:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:11:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-08-31 22:11:25,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:28,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:30,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:31,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 235 [2023-08-31 22:11:31,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 16 states, 16 states have (on average 79.625) internal successors, (1274), 16 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:31,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:31,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 235 [2023-08-31 22:11:31,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:32,047 INFO L130 PetriNetUnfolder]: 58/182 cut-off events. [2023-08-31 22:11:32,047 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2023-08-31 22:11:32,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 182 events. 58/182 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 720 event pairs, 4 based on Foata normal form. 16/178 useless extension candidates. Maximal degree in co-relation 665. Up to 53 conditions per place. [2023-08-31 22:11:32,048 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 40 selfloop transitions, 24 changer transitions 0/64 dead transitions. [2023-08-31 22:11:32,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 465 flow [2023-08-31 22:11:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 22:11:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 22:11:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1387 transitions. [2023-08-31 22:11:32,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3471839799749687 [2023-08-31 22:11:32,052 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1387 transitions. [2023-08-31 22:11:32,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1387 transitions. [2023-08-31 22:11:32,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:32,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1387 transitions. [2023-08-31 22:11:32,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 81.58823529411765) internal successors, (1387), 17 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,060 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,060 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 17 states and 1387 transitions. [2023-08-31 22:11:32,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 465 flow [2023-08-31 22:11:32,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 457 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:11:32,063 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 326 flow [2023-08-31 22:11:32,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2023-08-31 22:11:32,063 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-08-31 22:11:32,063 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 326 flow [2023-08-31 22:11:32,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.625) internal successors, (1274), 16 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:32,064 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:32,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:32,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:32,274 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:32,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 949833895, now seen corresponding path program 2 times [2023-08-31 22:11:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:32,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238264617] [2023-08-31 22:11:32,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:32,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:32,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:32,276 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:32,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-08-31 22:11:32,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 22:11:32,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:32,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 22:11:32,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:32,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:32,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:32,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:11:32,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:11:32,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 22:11:32,509 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-31 22:11:32,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:32,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238264617] [2023-08-31 22:11:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238264617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:32,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:32,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:11:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950820352] [2023-08-31 22:11:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:32,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:11:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:11:32,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:11:32,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-31 22:11:32,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:32,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-31 22:11:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:32,751 INFO L130 PetriNetUnfolder]: 46/154 cut-off events. [2023-08-31 22:11:32,751 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2023-08-31 22:11:32,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 154 events. 46/154 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 573 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 677. Up to 140 conditions per place. [2023-08-31 22:11:32,752 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-08-31 22:11:32,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 38 transitions, 386 flow [2023-08-31 22:11:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:11:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:11:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-31 22:11:32,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4323404255319149 [2023-08-31 22:11:32,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-31 22:11:32,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-31 22:11:32,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:32,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-31 22:11:32,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,757 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,757 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 326 flow. Second operand 5 states and 508 transitions. [2023-08-31 22:11:32,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 38 transitions, 386 flow [2023-08-31 22:11:32,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 38 transitions, 365 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 22:11:32,759 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 293 flow [2023-08-31 22:11:32,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2023-08-31 22:11:32,760 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:11:32,760 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 293 flow [2023-08-31 22:11:32,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:11:32,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:32,760 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:32,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:32,960 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:32,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -221066506, now seen corresponding path program 2 times [2023-08-31 22:11:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122996740] [2023-08-31 22:11:32,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:32,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:11:32,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:32,962 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:11:32,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-08-31 22:11:33,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:11:33,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:33,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-31 22:11:33,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:33,136 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:33,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:33,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:33,221 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:11:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:11:33,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:11:33,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:33,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:33,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:33,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:35,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122996740] [2023-08-31 22:11:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122996740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:35,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-08-31 22:11:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532137373] [2023-08-31 22:11:35,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 22:11:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 22:11:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=145, Unknown=3, NotChecked=0, Total=182 [2023-08-31 22:11:37,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:39,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:41,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:43,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:46,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:48,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:50,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:52,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:54,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:56,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:58,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:00,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:02,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:04,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:06,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:08,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:10,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:12,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:14,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:16,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:18,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:21,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:23,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:25,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:27,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:29,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:31,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:33,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:35,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:37,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:37,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 235 [2023-08-31 22:12:37,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:37,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:37,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 235 [2023-08-31 22:12:37,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:40,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:40,335 INFO L130 PetriNetUnfolder]: 43/142 cut-off events. [2023-08-31 22:12:40,336 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-08-31 22:12:40,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 142 events. 43/142 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 501 event pairs, 2 based on Foata normal form. 4/146 useless extension candidates. Maximal degree in co-relation 586. Up to 65 conditions per place. [2023-08-31 22:12:40,337 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 30 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2023-08-31 22:12:40,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 42 transitions, 379 flow [2023-08-31 22:12:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:12:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:12:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 444 transitions. [2023-08-31 22:12:40,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2099290780141844 [2023-08-31 22:12:40,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 444 transitions. [2023-08-31 22:12:40,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 444 transitions. [2023-08-31 22:12:40,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:40,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 444 transitions. [2023-08-31 22:12:40,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 49.333333333333336) internal successors, (444), 9 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:40,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:40,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:40,344 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 293 flow. Second operand 9 states and 444 transitions. [2023-08-31 22:12:40,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 42 transitions, 379 flow [2023-08-31 22:12:40,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 42 transitions, 357 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-31 22:12:40,347 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 285 flow [2023-08-31 22:12:40,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-08-31 22:12:40,348 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-08-31 22:12:40,348 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 285 flow [2023-08-31 22:12:40,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:40,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:40,349 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:40,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-08-31 22:12:40,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:40,559 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:12:40,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1551821286, now seen corresponding path program 3 times [2023-08-31 22:12:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:12:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911001248] [2023-08-31 22:12:40,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:12:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:40,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:12:40,560 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:12:40,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-08-31 22:12:40,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 22:12:40,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:12:40,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-31 22:12:40,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:40,746 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:12:40,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:12:40,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:40,813 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-31 22:12:40,844 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:12:40,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:12:40,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:40,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:41,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:41,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:41,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:43,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:12:43,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911001248] [2023-08-31 22:12:43,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911001248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:43,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:12:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-31 22:12:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922056325] [2023-08-31 22:12:43,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:43,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:12:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:12:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:12:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=197, Unknown=4, NotChecked=0, Total=240 [2023-08-31 22:12:45,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:47,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:48,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 235 [2023-08-31 22:12:48,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 285 flow. Second operand has 16 states, 16 states have (on average 53.75) internal successors, (860), 16 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:48,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:48,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 235 [2023-08-31 22:12:48,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:51,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:54,464 INFO L130 PetriNetUnfolder]: 40/130 cut-off events. [2023-08-31 22:12:54,464 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2023-08-31 22:12:54,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 130 events. 40/130 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 425 event pairs, 2 based on Foata normal form. 4/134 useless extension candidates. Maximal degree in co-relation 556. Up to 53 conditions per place. [2023-08-31 22:12:54,465 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 28 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2023-08-31 22:12:54,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 39 transitions, 347 flow [2023-08-31 22:12:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:12:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:12:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 497 transitions. [2023-08-31 22:12:54,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23498817966903074 [2023-08-31 22:12:54,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 497 transitions. [2023-08-31 22:12:54,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 497 transitions. [2023-08-31 22:12:54,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:54,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 497 transitions. [2023-08-31 22:12:54,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 55.22222222222222) internal successors, (497), 9 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:54,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:54,470 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:54,470 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 285 flow. Second operand 9 states and 497 transitions. [2023-08-31 22:12:54,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 39 transitions, 347 flow [2023-08-31 22:12:54,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 39 transitions, 311 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-08-31 22:12:54,473 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 243 flow [2023-08-31 22:12:54,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2023-08-31 22:12:54,473 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:12:54,473 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 243 flow [2023-08-31 22:12:54,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 53.75) internal successors, (860), 16 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:54,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:54,474 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:54,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-08-31 22:12:54,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:54,684 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:12:54,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 884869722, now seen corresponding path program 4 times [2023-08-31 22:12:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:12:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828397564] [2023-08-31 22:12:54,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 22:12:54,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:12:54,685 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:12:54,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-08-31 22:12:54,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 22:12:54,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:12:54,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-31 22:12:54,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:54,861 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:12:54,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:12:54,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:54,928 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:12:54,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:12:54,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:55,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:55,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:55,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:55,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:55,159 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-31 22:12:55,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:57,615 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-31 22:12:57,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:12:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828397564] [2023-08-31 22:12:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828397564] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:57,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:12:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-08-31 22:12:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228329462] [2023-08-31 22:12:57,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:57,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 22:12:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:12:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 22:12:57,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=31, NotChecked=0, Total=306 [2023-08-31 22:12:58,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 235 [2023-08-31 22:12:58,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 243 flow. Second operand has 18 states, 18 states have (on average 46.666666666666664) internal successors, (840), 18 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:58,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:58,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 235 [2023-08-31 22:12:58,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:59,081 INFO L130 PetriNetUnfolder]: 37/118 cut-off events. [2023-08-31 22:12:59,081 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2023-08-31 22:12:59,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 118 events. 37/118 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 361 event pairs, 2 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 472. Up to 41 conditions per place. [2023-08-31 22:12:59,082 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 27 selfloop transitions, 13 changer transitions 0/40 dead transitions. [2023-08-31 22:12:59,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 40 transitions, 330 flow [2023-08-31 22:12:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 22:12:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 22:12:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2023-08-31 22:12:59,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20553191489361702 [2023-08-31 22:12:59,088 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 483 transitions. [2023-08-31 22:12:59,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 483 transitions. [2023-08-31 22:12:59,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:59,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 483 transitions. [2023-08-31 22:12:59,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 48.3) internal successors, (483), 10 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:59,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:59,098 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:59,098 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 243 flow. Second operand 10 states and 483 transitions. [2023-08-31 22:12:59,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 40 transitions, 330 flow [2023-08-31 22:12:59,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 40 transitions, 304 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-31 22:12:59,101 INFO L231 Difference]: Finished difference. Result has 56 places, 32 transitions, 234 flow [2023-08-31 22:12:59,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=56, PETRI_TRANSITIONS=32} [2023-08-31 22:12:59,101 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-08-31 22:12:59,101 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 234 flow [2023-08-31 22:12:59,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 46.666666666666664) internal successors, (840), 18 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:12:59,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:59,102 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:59,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-08-31 22:12:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:59,312 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:12:59,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1684207718, now seen corresponding path program 5 times [2023-08-31 22:12:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:12:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581761666] [2023-08-31 22:12:59,313 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 22:12:59,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:12:59,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:12:59,314 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:12:59,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-08-31 22:12:59,446 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 22:12:59,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:12:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-31 22:12:59,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:59,483 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:12:59,483 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:12:59,520 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-31 22:12:59,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-31 22:12:59,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:59,684 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-31 22:12:59,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2023-08-31 22:12:59,777 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:12:59,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:13:00,016 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:13:00,016 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 1 case distinctions, treesize of input 15 treesize of output 21 [2023-08-31 22:13:00,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:00,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:00,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:01,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:01,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:01,327 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-31 22:13:01,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2023-08-31 22:13:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:01,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:02,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581761666] [2023-08-31 22:13:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581761666] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:02,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:02,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-08-31 22:13:02,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429086980] [2023-08-31 22:13:02,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:02,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 22:13:02,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:02,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 22:13:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=326, Unknown=4, NotChecked=0, Total=380 [2023-08-31 22:13:04,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:07,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:09,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:14,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:18,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:19,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 235 [2023-08-31 22:13:19,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 32 transitions, 234 flow. Second operand has 20 states, 20 states have (on average 55.6) internal successors, (1112), 20 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:19,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:19,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 235 [2023-08-31 22:13:19,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:31,084 INFO L130 PetriNetUnfolder]: 48/162 cut-off events. [2023-08-31 22:13:31,084 INFO L131 PetriNetUnfolder]: For 520/520 co-relation queries the response was YES. [2023-08-31 22:13:31,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 162 events. 48/162 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 550 event pairs, 0 based on Foata normal form. 12/174 useless extension candidates. Maximal degree in co-relation 710. Up to 42 conditions per place. [2023-08-31 22:13:31,086 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 44 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2023-08-31 22:13:31,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 513 flow [2023-08-31 22:13:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 22:13:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 22:13:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1197 transitions. [2023-08-31 22:13:31,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2425531914893617 [2023-08-31 22:13:31,089 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1197 transitions. [2023-08-31 22:13:31,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1197 transitions. [2023-08-31 22:13:31,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:31,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1197 transitions. [2023-08-31 22:13:31,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 57.0) internal successors, (1197), 21 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:31,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:31,096 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:31,096 INFO L175 Difference]: Start difference. First operand has 56 places, 32 transitions, 234 flow. Second operand 21 states and 1197 transitions. [2023-08-31 22:13:31,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 513 flow [2023-08-31 22:13:31,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 479 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-31 22:13:31,099 INFO L231 Difference]: Finished difference. Result has 69 places, 35 transitions, 294 flow [2023-08-31 22:13:31,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=294, PETRI_PLACES=69, PETRI_TRANSITIONS=35} [2023-08-31 22:13:31,100 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2023-08-31 22:13:31,100 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 35 transitions, 294 flow [2023-08-31 22:13:31,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 55.6) internal successors, (1112), 20 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:31,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:31,101 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:31,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:31,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:13:31,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:31,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash 346219360, now seen corresponding path program 3 times [2023-08-31 22:13:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347437435] [2023-08-31 22:13:31,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:13:31,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:13:31,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:31,312 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:13:31,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-08-31 22:13:31,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-31 22:13:31,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:31,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-31 22:13:31,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:31,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:31,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:31,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:31,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:13:31,577 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:13:31,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:13:31,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,680 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:13:31,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:13:31,685 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-31 22:13:31,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:31,922 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:13:31,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-08-31 22:13:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-31 22:13:31,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:32,083 WARN L839 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) (.cse0 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|))) (or (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)) .cse0) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_428) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse1)) (_ bv0 8)) (not (bvult .cse1 .cse0))))) is different from false [2023-08-31 22:13:34,379 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 (Array (_ BitVec 32) (_ BitVec 32))) (|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_~v~0.base_78 (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#length| v_~v~0.base_78 (_ bv8 32)) (_ bv3 32)))) (or (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| (_ bv1 32)) .cse0) (not (bvult |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| .cse0)) (not (= (_ bv0 1) (select |c_#valid| v_~v~0.base_78))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_421) v_~v~0.base_78 v_ArrVal_428) (_ bv3 32)) |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1|)))))) is different from false [2023-08-31 22:13:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2023-08-31 22:13:34,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347437435] [2023-08-31 22:13:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347437435] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:34,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-31 22:13:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383237142] [2023-08-31 22:13:34,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:34,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 22:13:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 22:13:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2023-08-31 22:13:34,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 235 [2023-08-31 22:13:34,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 35 transitions, 294 flow. Second operand has 14 states, 14 states have (on average 44.714285714285715) internal successors, (626), 14 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:34,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:34,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 235 [2023-08-31 22:13:34,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:37,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:13:37,305 INFO L130 PetriNetUnfolder]: 48/168 cut-off events. [2023-08-31 22:13:37,305 INFO L131 PetriNetUnfolder]: For 1258/1258 co-relation queries the response was YES. [2023-08-31 22:13:37,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 168 events. 48/168 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 629 event pairs, 0 based on Foata normal form. 24/192 useless extension candidates. Maximal degree in co-relation 700. Up to 92 conditions per place. [2023-08-31 22:13:37,307 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 37 selfloop transitions, 13 changer transitions 0/50 dead transitions. [2023-08-31 22:13:37,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 50 transitions, 468 flow [2023-08-31 22:13:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 22:13:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 22:13:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 367 transitions. [2023-08-31 22:13:37,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1952127659574468 [2023-08-31 22:13:37,308 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 367 transitions. [2023-08-31 22:13:37,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 367 transitions. [2023-08-31 22:13:37,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:37,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 367 transitions. [2023-08-31 22:13:37,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:37,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:37,312 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:37,312 INFO L175 Difference]: Start difference. First operand has 69 places, 35 transitions, 294 flow. Second operand 8 states and 367 transitions. [2023-08-31 22:13:37,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 50 transitions, 468 flow [2023-08-31 22:13:37,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 256 flow, removed 38 selfloop flow, removed 25 redundant places. [2023-08-31 22:13:37,314 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 168 flow [2023-08-31 22:13:37,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-31 22:13:37,315 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-31 22:13:37,315 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 168 flow [2023-08-31 22:13:37,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 44.714285714285715) internal successors, (626), 14 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:37,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:37,315 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:37,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:37,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:13:37,526 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:37,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 252150518, now seen corresponding path program 6 times [2023-08-31 22:13:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89051116] [2023-08-31 22:13:37,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 22:13:37,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:13:37,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:37,528 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:13:37,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-08-31 22:13:37,696 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-31 22:13:37,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:37,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-31 22:13:37,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:37,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:13:37,768 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:13:37,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:13:37,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:37,863 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:13:37,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:13:37,877 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-31 22:13:37,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:38,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:39,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89051116] [2023-08-31 22:13:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89051116] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:39,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-08-31 22:13:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757906648] [2023-08-31 22:13:39,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-31 22:13:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-31 22:13:39,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=386, Unknown=7, NotChecked=0, Total=462 [2023-08-31 22:13:46,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 235 [2023-08-31 22:13:46,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 168 flow. Second operand has 22 states, 22 states have (on average 51.54545454545455) internal successors, (1134), 22 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:13:46,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:46,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 235 [2023-08-31 22:13:46,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:58,700 WARN L222 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:14:08,300 WARN L222 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:14:19,639 WARN L222 SmtUtils]: Spent 10.36s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-31 22:14:21,042 INFO L130 PetriNetUnfolder]: 44/164 cut-off events. [2023-08-31 22:14:21,043 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-08-31 22:14:21,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 164 events. 44/164 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 519 event pairs, 0 based on Foata normal form. 30/194 useless extension candidates. Maximal degree in co-relation 481. Up to 49 conditions per place. [2023-08-31 22:14:21,043 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 33 selfloop transitions, 21 changer transitions 0/54 dead transitions. [2023-08-31 22:14:21,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 340 flow [2023-08-31 22:14:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 22:14:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 22:14:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1055 transitions. [2023-08-31 22:14:21,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22446808510638297 [2023-08-31 22:14:21,047 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1055 transitions. [2023-08-31 22:14:21,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1055 transitions. [2023-08-31 22:14:21,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:14:21,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1055 transitions. [2023-08-31 22:14:21,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 52.75) internal successors, (1055), 20 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:21,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:21,053 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:21,053 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 168 flow. Second operand 20 states and 1055 transitions. [2023-08-31 22:14:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 340 flow [2023-08-31 22:14:21,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 303 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-31 22:14:21,055 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 154 flow [2023-08-31 22:14:21,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=154, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-08-31 22:14:21,055 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-31 22:14:21,055 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 154 flow [2023-08-31 22:14:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 51.54545454545455) internal successors, (1134), 22 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 22:14:21,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:14:21,056 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:14:21,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-08-31 22:14:21,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:14:21,267 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:14:21,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:14:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash -773455402, now seen corresponding path program 7 times [2023-08-31 22:14:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:14:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969393350] [2023-08-31 22:14:21,268 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 22:14:21,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:14:21,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:14:21,269 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 22:14:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-08-31 22:14:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:14:21,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 22:14:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:14:21,580 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 22:14:21,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 22:14:21,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-31 22:14:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-31 22:14:21,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-31 22:14:21,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-31 22:14:21,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-31 22:14:21,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-08-31 22:14:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 22:14:21,800 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:14:21,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 22:14:21,804 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 22:14:21,814 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,815 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,824 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,825 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,829 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,829 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,830 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,830 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,830 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,837 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:21,838 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,839 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,839 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:21,839 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:21,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 10:14:21 BasicIcfg [2023-08-31 22:14:21,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 22:14:21,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 22:14:21,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 22:14:21,859 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 22:14:21,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:22" (3/4) ... [2023-08-31 22:14:21,861 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 22:14:21,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 22:14:21,862 INFO L158 Benchmark]: Toolchain (without parser) took 240663.85ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 61.9MB in the beginning and 41.2MB in the end (delta: 20.8MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,862 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:14:21,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.66ms. Allocated memory is still 86.0MB. Free memory was 61.7MB in the beginning and 47.5MB in the end (delta: 14.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.28ms. Allocated memory is still 86.0MB. Free memory was 47.5MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,863 INFO L158 Benchmark]: Boogie Preprocessor took 56.07ms. Allocated memory is still 86.0MB. Free memory was 44.9MB in the beginning and 43.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,863 INFO L158 Benchmark]: RCFGBuilder took 567.22ms. Allocated memory is still 86.0MB. Free memory was 43.0MB in the beginning and 46.4MB in the end (delta: -3.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,864 INFO L158 Benchmark]: TraceAbstraction took 239263.70ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 46.0MB in the beginning and 41.2MB in the end (delta: 4.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-08-31 22:14:21,864 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 130.0MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:14:21,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.66ms. Allocated memory is still 86.0MB. Free memory was 61.7MB in the beginning and 47.5MB in the end (delta: 14.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.28ms. Allocated memory is still 86.0MB. Free memory was 47.5MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.07ms. Allocated memory is still 86.0MB. Free memory was 44.9MB in the beginning and 43.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.22ms. Allocated memory is still 86.0MB. Free memory was 43.0MB in the beginning and 46.4MB in the end (delta: -3.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * TraceAbstraction took 239263.70ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 46.0MB in the beginning and 41.2MB in the end (delta: 4.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 130.0MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 108 PlacesBefore, 36 PlacesAfterwards, 106 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 64 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 123 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 372, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=127, t1={10:0}, t2={12:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] 0 \read(t1) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=128, t1={10:0}, t2={12:0}, v={6:0}] [L1125] 0 \read(t2) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={12:0}, v={6:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 143 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 239.1s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 202.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 291 mSolverCounterUnknown, 4940 SdHoareTripleChecker+Valid, 159.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3839 mSDsluCounter, 4504 SdHoareTripleChecker+Invalid, 157.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 164 IncrementalHoareTripleChecker+Unchecked, 4443 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14115 IncrementalHoareTripleChecker+Invalid, 14997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 61 mSDtfsCounter, 14115 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=17, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 269 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 359 ConstructedInterpolants, 137 QuantifiedInterpolants, 7129 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 52/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 22:14:21,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample