./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/singleton.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/singleton.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 ea0ecaab9c4a4889914d1343f60808acf6ec66df89812b70cea6837a39471f7f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:37:26,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:37:26,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:37:26,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:37:26,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:37:26,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:37:26,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:37:26,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:37:26,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:37:26,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:37:26,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:37:26,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:37:26,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:37:26,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:37:26,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:37:26,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:37:26,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:37:26,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:37:26,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:37:26,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:37:26,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:37:26,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:37:26,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:37:26,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:37:26,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:37:26,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:37:26,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:37:26,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:37:26,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:37:26,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:37:26,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:37:26,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:37:26,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:37:26,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:37:26,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:37:26,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:37:26,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:37:26,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:37:26,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:37:26,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:37:26,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:37:26,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:37:26,819 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:37:26,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:37:26,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:37:26,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:37:26,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:37:26,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:37:26,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:37:26,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:37:26,821 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:37:26,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:37:26,822 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:37:26,822 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:37:26,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:37:26,823 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:37:26,824 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:37:26,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:37:26,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:37:26,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:37:26,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:37:26,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:37:26,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:37:26,825 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:37:26,825 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 -> ea0ecaab9c4a4889914d1343f60808acf6ec66df89812b70cea6837a39471f7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 19:37:27,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:37:27,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:37:27,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:37:27,069 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:37:27,070 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:37:27,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2023-08-29 19:37:27,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:37:28,202 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:37:28,203 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2023-08-29 19:37:28,216 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9b3408e/3357731e2f9d4f1b876590af5e09ad5f/FLAG54717ddfb [2023-08-29 19:37:28,228 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9b3408e/3357731e2f9d4f1b876590af5e09ad5f [2023-08-29 19:37:28,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:37:28,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:37:28,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:37:28,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:37:28,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:37:28,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785fc7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28, skipping insertion in model container [2023-08-29 19:37:28,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:37:28,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:37:28,365 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:37:28,548 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/singleton.i[55547,55560] [2023-08-29 19:37:28,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:37:28,585 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:37:28,605 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:37:28,614 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/singleton.i[55547,55560] [2023-08-29 19:37:28,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:37:28,666 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:28,667 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:28,667 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:28,671 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:37:28,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28 WrapperNode [2023-08-29 19:37:28,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:37:28,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:37:28,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:37:28,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:37:28,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,718 INFO L138 Inliner]: procedures = 325, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2023-08-29 19:37:28,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:37:28,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:37:28,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:37:28,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:37:28,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:37:28,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:37:28,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:37:28,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:37:28,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (1/1) ... [2023-08-29 19:37:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:37:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:37:28,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 19:37:28,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 19:37:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 19:37:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:37:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:37:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 19:37:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:37:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-08-29 19:37:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-08-29 19:37:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 19:37:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 19:37:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 19:37:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 19:37:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 19:37:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 19:37:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:37:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 19:37:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:37:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:37:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:37:28,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:37:28,821 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:37:28,909 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:37:28,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:37:29,108 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:37:29,113 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:37:29,113 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 19:37:29,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:29 BoogieIcfgContainer [2023-08-29 19:37:29,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:37:29,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:37:29,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:37:29,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:37:29,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:37:28" (1/3) ... [2023-08-29 19:37:29,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515c9c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:37:29, skipping insertion in model container [2023-08-29 19:37:29,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:28" (2/3) ... [2023-08-29 19:37:29,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515c9c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:37:29, skipping insertion in model container [2023-08-29 19:37:29,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:29" (3/3) ... [2023-08-29 19:37:29,120 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2023-08-29 19:37:29,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:37:29,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-29 19:37:29,130 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:37:29,291 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-08-29 19:37:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 242 transitions, 591 flow [2023-08-29 19:37:29,377 INFO L130 PetriNetUnfolder]: 6/163 cut-off events. [2023-08-29 19:37:29,379 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 19:37:29,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 163 events. 6/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2023-08-29 19:37:29,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 242 transitions, 591 flow [2023-08-29 19:37:29,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 159 transitions, 369 flow [2023-08-29 19:37:29,390 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:37:29,396 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 159 transitions, 369 flow [2023-08-29 19:37:29,399 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 159 transitions, 369 flow [2023-08-29 19:37:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 159 transitions, 369 flow [2023-08-29 19:37:29,434 INFO L130 PetriNetUnfolder]: 6/159 cut-off events. [2023-08-29 19:37:29,435 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 19:37:29,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 159 events. 6/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2023-08-29 19:37:29,437 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2023-08-29 19:37:31,601 INFO L134 LiptonReduction]: Checked pairs total: 6871 [2023-08-29 19:37:31,601 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-29 19:37:31,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:37:31,615 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;@5430a320, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:37:31,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-08-29 19:37:31,617 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:37:31,617 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:37:31,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:31,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:37:31,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:31,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2023-08-29 19:37:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760925022] [2023-08-29 19:37:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:31,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760925022] [2023-08-29 19:37:31,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760925022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:31,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:31,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:37:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762363870] [2023-08-29 19:37:31,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:31,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:37:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:37:31,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:37:31,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 370 [2023-08-29 19:37:31,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 221 flow. Second operand has 2 states, 2 states have (on average 211.5) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:31,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:31,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 370 [2023-08-29 19:37:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:33,465 INFO L130 PetriNetUnfolder]: 19439/26681 cut-off events. [2023-08-29 19:37:33,465 INFO L131 PetriNetUnfolder]: For 949/949 co-relation queries the response was YES. [2023-08-29 19:37:33,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53377 conditions, 26681 events. 19439/26681 cut-off events. For 949/949 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 145297 event pairs, 19095 based on Foata normal form. 0/9506 useless extension candidates. Maximal degree in co-relation 53352. Up to 25310 conditions per place. [2023-08-29 19:37:33,596 INFO L137 encePairwiseOnDemand]: 368/370 looper letters, 64 selfloop transitions, 0 changer transitions 0/83 dead transitions. [2023-08-29 19:37:33,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 345 flow [2023-08-29 19:37:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:37:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:37:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 488 transitions. [2023-08-29 19:37:33,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6594594594594595 [2023-08-29 19:37:33,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 488 transitions. [2023-08-29 19:37:33,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 488 transitions. [2023-08-29 19:37:33,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:33,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 488 transitions. [2023-08-29 19:37:33,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 244.0) internal successors, (488), 2 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:33,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:33,616 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:33,617 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 221 flow. Second operand 2 states and 488 transitions. [2023-08-29 19:37:33,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 345 flow [2023-08-29 19:37:33,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 311 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-29 19:37:33,642 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 183 flow [2023-08-29 19:37:33,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2023-08-29 19:37:33,646 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -13 predicate places. [2023-08-29 19:37:33,646 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 183 flow [2023-08-29 19:37:33,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 211.5) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:33,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:33,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:37:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:37:33,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:33,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 597789, now seen corresponding path program 1 times [2023-08-29 19:37:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125841587] [2023-08-29 19:37:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125841587] [2023-08-29 19:37:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125841587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:37:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216861477] [2023-08-29 19:37:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:33,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:33,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 370 [2023-08-29 19:37:33,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:33,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:33,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 370 [2023-08-29 19:37:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:34,927 INFO L130 PetriNetUnfolder]: 14219/19666 cut-off events. [2023-08-29 19:37:34,927 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2023-08-29 19:37:34,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38568 conditions, 19666 events. 14219/19666 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 104265 event pairs, 13951 based on Foata normal form. 0/7508 useless extension candidates. Maximal degree in co-relation 38565. Up to 18601 conditions per place. [2023-08-29 19:37:35,008 INFO L137 encePairwiseOnDemand]: 361/370 looper letters, 68 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2023-08-29 19:37:35,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 94 transitions, 358 flow [2023-08-29 19:37:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-29 19:37:35,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.590990990990991 [2023-08-29 19:37:35,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-29 19:37:35,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-29 19:37:35,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:35,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-29 19:37:35,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:35,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:35,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:35,015 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 183 flow. Second operand 3 states and 656 transitions. [2023-08-29 19:37:35,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 94 transitions, 358 flow [2023-08-29 19:37:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:37:35,018 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 241 flow [2023-08-29 19:37:35,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2023-08-29 19:37:35,018 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -9 predicate places. [2023-08-29 19:37:35,019 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 241 flow [2023-08-29 19:37:35,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:35,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:35,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:37:35,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:37:35,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:35,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 597790, now seen corresponding path program 1 times [2023-08-29 19:37:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938615559] [2023-08-29 19:37:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938615559] [2023-08-29 19:37:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938615559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:37:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936906422] [2023-08-29 19:37:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:35,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:35,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:35,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 370 [2023-08-29 19:37:35,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:35,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:35,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 370 [2023-08-29 19:37:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:36,486 INFO L130 PetriNetUnfolder]: 17984/25240 cut-off events. [2023-08-29 19:37:36,487 INFO L131 PetriNetUnfolder]: For 1761/1761 co-relation queries the response was YES. [2023-08-29 19:37:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50992 conditions, 25240 events. 17984/25240 cut-off events. For 1761/1761 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 143911 event pairs, 16168 based on Foata normal form. 1/10995 useless extension candidates. Maximal degree in co-relation 50987. Up to 17180 conditions per place. [2023-08-29 19:37:36,632 INFO L137 encePairwiseOnDemand]: 358/370 looper letters, 121 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2023-08-29 19:37:36,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 151 transitions, 663 flow [2023-08-29 19:37:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-29 19:37:36,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6522522522522523 [2023-08-29 19:37:36,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-29 19:37:36,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-29 19:37:36,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:36,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-29 19:37:36,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 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-29 19:37:36,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:36,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:36,638 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 241 flow. Second operand 3 states and 724 transitions. [2023-08-29 19:37:36,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 151 transitions, 663 flow [2023-08-29 19:37:36,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 151 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:36,642 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 319 flow [2023-08-29 19:37:36,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2023-08-29 19:37:36,643 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 19:37:36,644 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 319 flow [2023-08-29 19:37:36,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:36,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:36,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:37:36,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:37:36,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:36,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 18530298, now seen corresponding path program 1 times [2023-08-29 19:37:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070175378] [2023-08-29 19:37:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070175378] [2023-08-29 19:37:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070175378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:37:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046816105] [2023-08-29 19:37:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:36,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:36,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:36,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 370 [2023-08-29 19:37:36,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:36,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:36,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 370 [2023-08-29 19:37:36,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:38,107 INFO L130 PetriNetUnfolder]: 17970/25215 cut-off events. [2023-08-29 19:37:38,108 INFO L131 PetriNetUnfolder]: For 10544/10544 co-relation queries the response was YES. [2023-08-29 19:37:38,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55365 conditions, 25215 events. 17970/25215 cut-off events. For 10544/10544 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 143802 event pairs, 17598 based on Foata normal form. 11/10983 useless extension candidates. Maximal degree in co-relation 55359. Up to 23810 conditions per place. [2023-08-29 19:37:38,206 INFO L137 encePairwiseOnDemand]: 367/370 looper letters, 76 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2023-08-29 19:37:38,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 491 flow [2023-08-29 19:37:38,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2023-08-29 19:37:38,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6162162162162163 [2023-08-29 19:37:38,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 684 transitions. [2023-08-29 19:37:38,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 684 transitions. [2023-08-29 19:37:38,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:38,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 684 transitions. [2023-08-29 19:37:38,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:38,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:38,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:38,212 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 319 flow. Second operand 3 states and 684 transitions. [2023-08-29 19:37:38,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 491 flow [2023-08-29 19:37:38,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:38,221 INFO L231 Difference]: Finished difference. Result has 93 places, 98 transitions, 304 flow [2023-08-29 19:37:38,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=93, PETRI_TRANSITIONS=98} [2023-08-29 19:37:38,222 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -6 predicate places. [2023-08-29 19:37:38,222 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 304 flow [2023-08-29 19:37:38,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:38,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:38,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:38,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:37:38,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:38,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1755476090, now seen corresponding path program 1 times [2023-08-29 19:37:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134086404] [2023-08-29 19:37:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134086404] [2023-08-29 19:37:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134086404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:37:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882596760] [2023-08-29 19:37:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:37:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:37:38,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:37:38,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:37:38,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:38,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:38,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:37:38,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:39,618 INFO L130 PetriNetUnfolder]: 17958/25184 cut-off events. [2023-08-29 19:37:39,620 INFO L131 PetriNetUnfolder]: For 9038/9038 co-relation queries the response was YES. [2023-08-29 19:37:39,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55274 conditions, 25184 events. 17958/25184 cut-off events. For 9038/9038 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 143617 event pairs, 17597 based on Foata normal form. 0/10962 useless extension candidates. Maximal degree in co-relation 55267. Up to 23762 conditions per place. [2023-08-29 19:37:39,815 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 71 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-29 19:37:39,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 93 transitions, 436 flow [2023-08-29 19:37:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-08-29 19:37:39,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5774774774774775 [2023-08-29 19:37:39,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-08-29 19:37:39,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-08-29 19:37:39,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:39,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-08-29 19:37:39,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:39,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:39,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:39,835 INFO L175 Difference]: Start difference. First operand has 93 places, 98 transitions, 304 flow. Second operand 3 states and 641 transitions. [2023-08-29 19:37:39,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 93 transitions, 436 flow [2023-08-29 19:37:39,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:39,839 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 282 flow [2023-08-29 19:37:39,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2023-08-29 19:37:39,842 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -10 predicate places. [2023-08-29 19:37:39,842 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 282 flow [2023-08-29 19:37:39,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:39,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:39,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:39,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:37:39,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:39,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1852886289, now seen corresponding path program 1 times [2023-08-29 19:37:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:39,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505648627] [2023-08-29 19:37:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505648627] [2023-08-29 19:37:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505648627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 19:37:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144605924] [2023-08-29 19:37:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:40,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:37:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:37:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:37:40,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 370 [2023-08-29 19:37:40,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 187.125) internal successors, (1497), 8 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:40,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:40,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 370 [2023-08-29 19:37:40,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:41,699 INFO L130 PetriNetUnfolder]: 12743/18173 cut-off events. [2023-08-29 19:37:41,699 INFO L131 PetriNetUnfolder]: For 8963/8963 co-relation queries the response was YES. [2023-08-29 19:37:41,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38580 conditions, 18173 events. 12743/18173 cut-off events. For 8963/8963 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 102685 event pairs, 12473 based on Foata normal form. 1457/8961 useless extension candidates. Maximal degree in co-relation 38573. Up to 17099 conditions per place. [2023-08-29 19:37:41,811 INFO L137 encePairwiseOnDemand]: 359/370 looper letters, 63 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2023-08-29 19:37:41,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 441 flow [2023-08-29 19:37:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:37:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:37:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1004 transitions. [2023-08-29 19:37:41,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5427027027027027 [2023-08-29 19:37:41,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1004 transitions. [2023-08-29 19:37:41,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1004 transitions. [2023-08-29 19:37:41,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:41,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1004 transitions. [2023-08-29 19:37:41,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.8) internal successors, (1004), 5 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:41,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:41,838 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:41,838 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 282 flow. Second operand 5 states and 1004 transitions. [2023-08-29 19:37:41,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 441 flow [2023-08-29 19:37:41,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 434 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:37:41,846 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 321 flow [2023-08-29 19:37:41,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2023-08-29 19:37:41,862 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -8 predicate places. [2023-08-29 19:37:41,862 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 321 flow [2023-08-29 19:37:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 187.125) internal successors, (1497), 8 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:41,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:41,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:37:41,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:41,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 415710710, now seen corresponding path program 1 times [2023-08-29 19:37:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418199539] [2023-08-29 19:37:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418199539] [2023-08-29 19:37:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418199539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:37:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776562696] [2023-08-29 19:37:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:42,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:37:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:37:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:37:42,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:37:42,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:42,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:42,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:37:42,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:42,857 INFO L130 PetriNetUnfolder]: 7621/11509 cut-off events. [2023-08-29 19:37:42,858 INFO L131 PetriNetUnfolder]: For 3090/3090 co-relation queries the response was YES. [2023-08-29 19:37:42,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24258 conditions, 11509 events. 7621/11509 cut-off events. For 3090/3090 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 66098 event pairs, 7351 based on Foata normal form. 0/5454 useless extension candidates. Maximal degree in co-relation 24250. Up to 10435 conditions per place. [2023-08-29 19:37:42,905 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 65 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-29 19:37:42,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 89 transitions, 459 flow [2023-08-29 19:37:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:37:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:37:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 827 transitions. [2023-08-29 19:37:42,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5587837837837838 [2023-08-29 19:37:42,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 827 transitions. [2023-08-29 19:37:42,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 827 transitions. [2023-08-29 19:37:42,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:42,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 827 transitions. [2023-08-29 19:37:42,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:42,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:42,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:42,913 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 321 flow. Second operand 4 states and 827 transitions. [2023-08-29 19:37:42,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 89 transitions, 459 flow [2023-08-29 19:37:42,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:42,917 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 317 flow [2023-08-29 19:37:42,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=317, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-29 19:37:42,917 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -11 predicate places. [2023-08-29 19:37:42,917 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 317 flow [2023-08-29 19:37:42,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:42,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:42,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:42,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:37:42,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:42,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 66046588, now seen corresponding path program 1 times [2023-08-29 19:37:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474290593] [2023-08-29 19:37:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474290593] [2023-08-29 19:37:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474290593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:37:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177436643] [2023-08-29 19:37:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:42,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:42,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:43,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 370 [2023-08-29 19:37:43,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:43,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 370 [2023-08-29 19:37:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:43,271 INFO L130 PetriNetUnfolder]: 2579/4199 cut-off events. [2023-08-29 19:37:43,272 INFO L131 PetriNetUnfolder]: For 1255/1255 co-relation queries the response was YES. [2023-08-29 19:37:43,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8899 conditions, 4199 events. 2579/4199 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21781 event pairs, 2441 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 8891. Up to 3688 conditions per place. [2023-08-29 19:37:43,282 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 66 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-29 19:37:43,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 85 transitions, 451 flow [2023-08-29 19:37:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2023-08-29 19:37:43,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5891891891891892 [2023-08-29 19:37:43,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 654 transitions. [2023-08-29 19:37:43,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions. [2023-08-29 19:37:43,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:43,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions. [2023-08-29 19:37:43,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,288 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 317 flow. Second operand 3 states and 654 transitions. [2023-08-29 19:37:43,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 85 transitions, 451 flow [2023-08-29 19:37:43,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 441 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:37:43,289 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 301 flow [2023-08-29 19:37:43,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2023-08-29 19:37:43,290 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -17 predicate places. [2023-08-29 19:37:43,290 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 83 transitions, 301 flow [2023-08-29 19:37:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:43,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:43,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:37:43,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:43,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 70209109, now seen corresponding path program 1 times [2023-08-29 19:37:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715635537] [2023-08-29 19:37:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715635537] [2023-08-29 19:37:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715635537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:43,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:43,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:37:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263408285] [2023-08-29 19:37:43,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:43,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:43,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 370 [2023-08-29 19:37:43,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 83 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:43,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 370 [2023-08-29 19:37:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:43,491 INFO L130 PetriNetUnfolder]: 575/1130 cut-off events. [2023-08-29 19:37:43,491 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2023-08-29 19:37:43,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 1130 events. 575/1130 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4804 event pairs, 512 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 2460. Up to 884 conditions per place. [2023-08-29 19:37:43,494 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 56 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-29 19:37:43,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 421 flow [2023-08-29 19:37:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2023-08-29 19:37:43,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558558558558558 [2023-08-29 19:37:43,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2023-08-29 19:37:43,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2023-08-29 19:37:43,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:43,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2023-08-29 19:37:43,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,499 INFO L175 Difference]: Start difference. First operand has 82 places, 83 transitions, 301 flow. Second operand 3 states and 617 transitions. [2023-08-29 19:37:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 421 flow [2023-08-29 19:37:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:37:43,500 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 299 flow [2023-08-29 19:37:43,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2023-08-29 19:37:43,502 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -20 predicate places. [2023-08-29 19:37:43,502 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 299 flow [2023-08-29 19:37:43,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:43,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:37:43,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:43,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 70209171, now seen corresponding path program 1 times [2023-08-29 19:37:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267373727] [2023-08-29 19:37:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267373727] [2023-08-29 19:37:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267373727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:43,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:43,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:37:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236055791] [2023-08-29 19:37:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:43,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:43,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 370 [2023-08-29 19:37:43,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 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-29 19:37:43,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:43,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 370 [2023-08-29 19:37:43,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:43,734 INFO L130 PetriNetUnfolder]: 614/1139 cut-off events. [2023-08-29 19:37:43,734 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2023-08-29 19:37:43,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1139 events. 614/1139 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4522 event pairs, 554 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 2553. Up to 955 conditions per place. [2023-08-29 19:37:43,737 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 58 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-29 19:37:43,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 423 flow [2023-08-29 19:37:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2023-08-29 19:37:43,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702702702702702 [2023-08-29 19:37:43,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2023-08-29 19:37:43,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2023-08-29 19:37:43,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:43,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2023-08-29 19:37:43,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:43,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:43,742 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 299 flow. Second operand 3 states and 633 transitions. [2023-08-29 19:37:43,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 423 flow [2023-08-29 19:37:43,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 78 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:43,743 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 293 flow [2023-08-29 19:37:43,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-29 19:37:43,744 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -22 predicate places. [2023-08-29 19:37:43,744 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 293 flow [2023-08-29 19:37:43,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 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-29 19:37:43,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:43,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:43,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:37:43,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:43,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash 70209173, now seen corresponding path program 1 times [2023-08-29 19:37:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890199869] [2023-08-29 19:37:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890199869] [2023-08-29 19:37:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890199869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:37:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631244435] [2023-08-29 19:37:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:37:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:37:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:37:44,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:37:44,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:44,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:37:44,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:44,197 INFO L130 PetriNetUnfolder]: 609/1104 cut-off events. [2023-08-29 19:37:44,197 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2023-08-29 19:37:44,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1104 events. 609/1104 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4223 event pairs, 546 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 2497. Up to 944 conditions per place. [2023-08-29 19:37:44,200 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 57 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-08-29 19:37:44,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 435 flow [2023-08-29 19:37:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:37:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:37:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 816 transitions. [2023-08-29 19:37:44,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513513513513514 [2023-08-29 19:37:44,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 816 transitions. [2023-08-29 19:37:44,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 816 transitions. [2023-08-29 19:37:44,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:44,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 816 transitions. [2023-08-29 19:37:44,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,206 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,206 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 293 flow. Second operand 4 states and 816 transitions. [2023-08-29 19:37:44,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 435 flow [2023-08-29 19:37:44,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:44,208 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 293 flow [2023-08-29 19:37:44,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2023-08-29 19:37:44,208 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -23 predicate places. [2023-08-29 19:37:44,209 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 293 flow [2023-08-29 19:37:44,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:44,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:44,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:37:44,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:44,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash -953664904, now seen corresponding path program 1 times [2023-08-29 19:37:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213362289] [2023-08-29 19:37:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213362289] [2023-08-29 19:37:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213362289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:44,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:44,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:37:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299236718] [2023-08-29 19:37:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:44,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:44,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 370 [2023-08-29 19:37:44,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:44,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 370 [2023-08-29 19:37:44,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:44,454 INFO L130 PetriNetUnfolder]: 565/1036 cut-off events. [2023-08-29 19:37:44,455 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2023-08-29 19:37:44,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 1036 events. 565/1036 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3933 event pairs, 505 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2350. Up to 875 conditions per place. [2023-08-29 19:37:44,458 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 56 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-29 19:37:44,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 413 flow [2023-08-29 19:37:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-29 19:37:44,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5684684684684684 [2023-08-29 19:37:44,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-29 19:37:44,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-29 19:37:44,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:44,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-29 19:37:44,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:44,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:44,463 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 293 flow. Second operand 3 states and 631 transitions. [2023-08-29 19:37:44,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 413 flow [2023-08-29 19:37:44,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 403 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:37:44,464 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 285 flow [2023-08-29 19:37:44,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2023-08-29 19:37:44,465 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places. [2023-08-29 19:37:44,465 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 285 flow [2023-08-29 19:37:44,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:44,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:44,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:37:44,466 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:44,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash -953664903, now seen corresponding path program 1 times [2023-08-29 19:37:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487207766] [2023-08-29 19:37:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487207766] [2023-08-29 19:37:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487207766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:37:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937605938] [2023-08-29 19:37:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:44,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:37:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:37:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:37:44,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:37:44,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:44,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:37:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:44,860 INFO L130 PetriNetUnfolder]: 549/996 cut-off events. [2023-08-29 19:37:44,860 INFO L131 PetriNetUnfolder]: For 399/399 co-relation queries the response was YES. [2023-08-29 19:37:44,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 996 events. 549/996 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3694 event pairs, 488 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 2269. Up to 847 conditions per place. [2023-08-29 19:37:44,863 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 55 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-29 19:37:44,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 423 flow [2023-08-29 19:37:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:37:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:37:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 814 transitions. [2023-08-29 19:37:44,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2023-08-29 19:37:44,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 814 transitions. [2023-08-29 19:37:44,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 814 transitions. [2023-08-29 19:37:44,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:44,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 814 transitions. [2023-08-29 19:37:44,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.5) internal successors, (814), 4 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,869 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 285 flow. Second operand 4 states and 814 transitions. [2023-08-29 19:37:44,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 423 flow [2023-08-29 19:37:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:44,871 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 285 flow [2023-08-29 19:37:44,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2023-08-29 19:37:44,872 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -27 predicate places. [2023-08-29 19:37:44,872 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 285 flow [2023-08-29 19:37:44,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:44,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:44,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:44,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:37:44,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:44,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1643925701, now seen corresponding path program 1 times [2023-08-29 19:37:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957003323] [2023-08-29 19:37:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957003323] [2023-08-29 19:37:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957003323] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:37:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162295514] [2023-08-29 19:37:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:44,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:37:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:37:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:37:45,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 370 [2023-08-29 19:37:45,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:45,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 370 [2023-08-29 19:37:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:45,097 INFO L130 PetriNetUnfolder]: 494/911 cut-off events. [2023-08-29 19:37:45,097 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2023-08-29 19:37:45,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 911 events. 494/911 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3300 event pairs, 434 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 2081. Up to 758 conditions per place. [2023-08-29 19:37:45,100 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 52 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-29 19:37:45,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 397 flow [2023-08-29 19:37:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:37:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:37:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2023-08-29 19:37:45,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5657657657657658 [2023-08-29 19:37:45,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2023-08-29 19:37:45,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2023-08-29 19:37:45,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:45,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2023-08-29 19:37:45,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:45,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:37:45,105 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 285 flow. Second operand 3 states and 628 transitions. [2023-08-29 19:37:45,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 397 flow [2023-08-29 19:37:45,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:37:45,107 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 277 flow [2023-08-29 19:37:45,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2023-08-29 19:37:45,107 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -30 predicate places. [2023-08-29 19:37:45,107 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 277 flow [2023-08-29 19:37:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:45,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:37:45,108 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:45,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1643925700, now seen corresponding path program 1 times [2023-08-29 19:37:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226545260] [2023-08-29 19:37:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:45,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226545260] [2023-08-29 19:37:45,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226545260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:45,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:45,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:37:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658757350] [2023-08-29 19:37:45,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:45,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:37:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:45,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:37:45,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:37:45,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:37:45,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:45,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:37:45,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:45,453 INFO L130 PetriNetUnfolder]: 450/837 cut-off events. [2023-08-29 19:37:45,454 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2023-08-29 19:37:45,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 837 events. 450/837 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2946 event pairs, 389 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1918. Up to 690 conditions per place. [2023-08-29 19:37:45,456 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 51 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-08-29 19:37:45,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 407 flow [2023-08-29 19:37:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:37:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:37:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 811 transitions. [2023-08-29 19:37:45,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547972972972973 [2023-08-29 19:37:45,458 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 811 transitions. [2023-08-29 19:37:45,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 811 transitions. [2023-08-29 19:37:45,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:45,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 811 transitions. [2023-08-29 19:37:45,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,462 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,462 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 277 flow. Second operand 4 states and 811 transitions. [2023-08-29 19:37:45,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 407 flow [2023-08-29 19:37:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:37:45,464 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 277 flow [2023-08-29 19:37:45,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-29 19:37:45,464 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -31 predicate places. [2023-08-29 19:37:45,464 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 277 flow [2023-08-29 19:37:45,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:45,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:45,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:45,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:37:45,465 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:45,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1100241615, now seen corresponding path program 1 times [2023-08-29 19:37:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917268474] [2023-08-29 19:37:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917268474] [2023-08-29 19:37:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917268474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-08-29 19:37:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019445097] [2023-08-29 19:37:46,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:46,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:37:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:46,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:37:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-08-29 19:37:47,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 370 [2023-08-29 19:37:47,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 277 flow. Second operand has 15 states, 15 states have (on average 168.2) internal successors, (2523), 15 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:47,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:47,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 370 [2023-08-29 19:37:47,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:47,371 INFO L130 PetriNetUnfolder]: 460/846 cut-off events. [2023-08-29 19:37:47,371 INFO L131 PetriNetUnfolder]: For 345/345 co-relation queries the response was YES. [2023-08-29 19:37:47,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 846 events. 460/846 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2953 event pairs, 397 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 1957. Up to 695 conditions per place. [2023-08-29 19:37:47,374 INFO L137 encePairwiseOnDemand]: 356/370 looper letters, 49 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2023-08-29 19:37:47,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 456 flow [2023-08-29 19:37:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 19:37:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 19:37:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1720 transitions. [2023-08-29 19:37:47,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2023-08-29 19:37:47,378 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1720 transitions. [2023-08-29 19:37:47,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1720 transitions. [2023-08-29 19:37:47,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:47,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1720 transitions. [2023-08-29 19:37:47,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:47,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 370.0) internal successors, (4070), 11 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:47,384 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 370.0) internal successors, (4070), 11 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:47,384 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 277 flow. Second operand 10 states and 1720 transitions. [2023-08-29 19:37:47,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 456 flow [2023-08-29 19:37:47,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 76 transitions, 446 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:37:47,386 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 332 flow [2023-08-29 19:37:47,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-08-29 19:37:47,387 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -23 predicate places. [2023-08-29 19:37:47,387 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 332 flow [2023-08-29 19:37:47,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 168.2) internal successors, (2523), 15 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:47,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:47,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:47,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 19:37:47,388 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:47,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 775004358, now seen corresponding path program 1 times [2023-08-29 19:37:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905529328] [2023-08-29 19:37:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:47,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905529328] [2023-08-29 19:37:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905529328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:47,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:47,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-08-29 19:37:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693505128] [2023-08-29 19:37:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:47,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:37:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:37:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-08-29 19:37:48,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 370 [2023-08-29 19:37:48,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 332 flow. Second operand has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:48,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:48,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 370 [2023-08-29 19:37:48,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:48,522 INFO L130 PetriNetUnfolder]: 443/828 cut-off events. [2023-08-29 19:37:48,523 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2023-08-29 19:37:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 828 events. 443/828 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2924 event pairs, 380 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 1935. Up to 667 conditions per place. [2023-08-29 19:37:48,525 INFO L137 encePairwiseOnDemand]: 355/370 looper letters, 47 selfloop transitions, 22 changer transitions 0/78 dead transitions. [2023-08-29 19:37:48,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 78 transitions, 522 flow [2023-08-29 19:37:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 19:37:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 19:37:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2052 transitions. [2023-08-29 19:37:48,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2023-08-29 19:37:48,529 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2052 transitions. [2023-08-29 19:37:48,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2052 transitions. [2023-08-29 19:37:48,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:48,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2052 transitions. [2023-08-29 19:37:48,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 171.0) internal successors, (2052), 12 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:48,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 370.0) internal successors, (4810), 13 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:48,536 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 370.0) internal successors, (4810), 13 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:48,537 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 332 flow. Second operand 12 states and 2052 transitions. [2023-08-29 19:37:48,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 78 transitions, 522 flow [2023-08-29 19:37:48,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 78 transitions, 495 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-29 19:37:48,539 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 378 flow [2023-08-29 19:37:48,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=378, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2023-08-29 19:37:48,540 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -17 predicate places. [2023-08-29 19:37:48,540 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 378 flow [2023-08-29 19:37:48,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:48,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:48,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:48,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 19:37:48,541 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:48,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1744673250, now seen corresponding path program 1 times [2023-08-29 19:37:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526224703] [2023-08-29 19:37:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526224703] [2023-08-29 19:37:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526224703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:48,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-08-29 19:37:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228053974] [2023-08-29 19:37:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:48,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:37:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:37:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-08-29 19:37:49,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 370 [2023-08-29 19:37:49,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 378 flow. Second operand has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:49,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:49,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 370 [2023-08-29 19:37:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:49,835 INFO L130 PetriNetUnfolder]: 442/826 cut-off events. [2023-08-29 19:37:49,835 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2023-08-29 19:37:49,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 826 events. 442/826 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2922 event pairs, 379 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 1953. Up to 667 conditions per place. [2023-08-29 19:37:49,837 INFO L137 encePairwiseOnDemand]: 356/370 looper letters, 49 selfloop transitions, 21 changer transitions 0/79 dead transitions. [2023-08-29 19:37:49,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 79 transitions, 573 flow [2023-08-29 19:37:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 19:37:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 19:37:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2218 transitions. [2023-08-29 19:37:49,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46112266112266115 [2023-08-29 19:37:49,849 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2218 transitions. [2023-08-29 19:37:49,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2218 transitions. [2023-08-29 19:37:49,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:49,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2218 transitions. [2023-08-29 19:37:49,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.6153846153846) internal successors, (2218), 13 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:49,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 370.0) internal successors, (5180), 14 states have internal predecessors, (5180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:49,857 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 370.0) internal successors, (5180), 14 states have internal predecessors, (5180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:49,857 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 378 flow. Second operand 13 states and 2218 transitions. [2023-08-29 19:37:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 79 transitions, 573 flow [2023-08-29 19:37:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 538 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-29 19:37:49,860 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 414 flow [2023-08-29 19:37:49,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=414, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2023-08-29 19:37:49,860 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -12 predicate places. [2023-08-29 19:37:49,860 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 414 flow [2023-08-29 19:37:49,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:49,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:49,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:49,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 19:37:49,861 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:49,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1749704827, now seen corresponding path program 1 times [2023-08-29 19:37:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255082228] [2023-08-29 19:37:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:37:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:37:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:37:50,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255082228] [2023-08-29 19:37:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255082228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:37:50,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:37:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-08-29 19:37:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918667507] [2023-08-29 19:37:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:37:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:37:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:37:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:37:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-08-29 19:37:51,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 370 [2023-08-29 19:37:51,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 414 flow. Second operand has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:51,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:37:51,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 370 [2023-08-29 19:37:51,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:37:51,254 INFO L130 PetriNetUnfolder]: 442/825 cut-off events. [2023-08-29 19:37:51,255 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2023-08-29 19:37:51,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1973 conditions, 825 events. 442/825 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2913 event pairs, 379 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 1960. Up to 667 conditions per place. [2023-08-29 19:37:51,258 INFO L137 encePairwiseOnDemand]: 357/370 looper letters, 44 selfloop transitions, 22 changer transitions 0/75 dead transitions. [2023-08-29 19:37:51,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 75 transitions, 566 flow [2023-08-29 19:37:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 19:37:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 19:37:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2046 transitions. [2023-08-29 19:37:51,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608108108108108 [2023-08-29 19:37:51,261 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2046 transitions. [2023-08-29 19:37:51,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2046 transitions. [2023-08-29 19:37:51,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:51,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2046 transitions. [2023-08-29 19:37:51,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 170.5) internal successors, (2046), 12 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:51,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 370.0) internal successors, (4810), 13 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:51,269 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 370.0) internal successors, (4810), 13 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:51,269 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 414 flow. Second operand 12 states and 2046 transitions. [2023-08-29 19:37:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 75 transitions, 566 flow [2023-08-29 19:37:51,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 75 transitions, 502 flow, removed 0 selfloop flow, removed 14 redundant places. [2023-08-29 19:37:51,272 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 382 flow [2023-08-29 19:37:51,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=382, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2023-08-29 19:37:51,272 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -16 predicate places. [2023-08-29 19:37:51,272 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 382 flow [2023-08-29 19:37:51,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 168.26666666666668) internal successors, (2524), 15 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:51,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:51,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:51,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 19:37:51,273 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:37:51,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash -408650212, now seen corresponding path program 1 times [2023-08-29 19:37:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:37:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011567102] [2023-08-29 19:37:51,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:37:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:37:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:37:51,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:37:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:37:51,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:37:51,359 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:37:51,359 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2023-08-29 19:37:51,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2023-08-29 19:37:51,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2023-08-29 19:37:51,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2023-08-29 19:37:51,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2023-08-29 19:37:51,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2023-08-29 19:37:51,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 71 remaining) [2023-08-29 19:37:51,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2023-08-29 19:37:51,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (34 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2023-08-29 19:37:51,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2023-08-29 19:37:51,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2023-08-29 19:37:51,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork2Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 71 remaining) [2023-08-29 19:37:51,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2023-08-29 19:37:51,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2023-08-29 19:37:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 19:37:51,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:51,375 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:37:51,375 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:37:51,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:37:51 BasicIcfg [2023-08-29 19:37:51,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:37:51,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:37:51,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:37:51,424 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:37:51,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:29" (3/4) ... [2023-08-29 19:37:51,426 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:37:51,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:37:51,426 INFO L158 Benchmark]: Toolchain (without parser) took 23195.56ms. Allocated memory was 69.2MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 45.1MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2023-08-29 19:37:51,426 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:37:51,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.37ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 44.5MB in the end (delta: 241.7kB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-08-29 19:37:51,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.85ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:37:51,427 INFO L158 Benchmark]: Boogie Preprocessor took 39.97ms. Allocated memory is still 83.9MB. Free memory was 42.1MB in the beginning and 40.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:37:51,427 INFO L158 Benchmark]: RCFGBuilder took 354.87ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 43.8MB in the end (delta: -3.4MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2023-08-29 19:37:51,427 INFO L158 Benchmark]: TraceAbstraction took 22307.07ms. Allocated memory was 83.9MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 43.0MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2023-08-29 19:37:51,428 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 7.6GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:37:51,429 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.15ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.37ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 44.5MB in the end (delta: 241.7kB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.85ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.97ms. Allocated memory is still 83.9MB. Free memory was 42.1MB in the beginning and 40.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.87ms. Allocated memory is still 83.9MB. Free memory was 40.3MB in the beginning and 43.8MB in the end (delta: -3.4MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22307.07ms. Allocated memory was 83.9MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 43.0MB in the beginning and 3.7GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 7.6GB. Free memory is still 3.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 172 PlacesBefore, 99 PlacesAfterwards, 159 TransitionsBefore, 85 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 6871 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4655, independent: 4410, independent conditional: 0, independent unconditional: 4410, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1196, independent conditional: 0, independent unconditional: 1196, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4655, independent: 3214, independent conditional: 0, independent unconditional: 3214, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1159. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, pthread_create(&t, 0, thread0, 0)=-4, t={6:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-3, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-3, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1163] 0 \read(t) VAL [\read(t)=-4, \read(t1)=-3, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, t={6:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-3, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=-2, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t3, 0, thread3, 0)=-1, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t4, 0, thread2, 0)=0, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t5, 0, thread2, 0)=1, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\read(t)=-4, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={6:0}, v={3:0}] [L1164] EXPR 0 v[0] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X') [L1123] COND FALSE 0 !(!expression) [L1164] RET 0 __VERIFIER_assert(v[0] == 'X') [L1165] 0 return 0; [L1165] 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: -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: 1149]: 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: 1150]: 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: 1147]: 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: 1152]: 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: 1151]: 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: -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: 1123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1149]: 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: 1151]: 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: 1147]: 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: 1150]: 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: 1152]: 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 11 procedures, 280 locations, 71 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: 22.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9104 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6461 mSDsluCounter, 1641 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1255 mSDsCounter, 538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12489 IncrementalHoareTripleChecker+Invalid, 13027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 538 mSolverCounterUnsat, 386 mSDtfsCounter, 12489 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=18, InterpolantAutomatonStates: 97, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 5338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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-29 19:37:51,453 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/singleton.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 ea0ecaab9c4a4889914d1343f60808acf6ec66df89812b70cea6837a39471f7f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:37:53,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:37:53,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:37:53,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:37:53,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:37:53,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:37:53,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:37:53,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:37:53,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:37:53,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:37:53,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:37:53,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:37:53,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:37:53,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:37:53,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:37:53,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:37:53,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:37:53,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:37:53,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:37:53,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:37:53,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:37:53,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:37:53,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:37:53,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:37:53,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:37:53,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:37:53,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:37:53,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:37:53,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:37:53,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:37:53,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:37:53,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:37:53,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:37:53,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:37:53,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:37:53,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:37:53,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:37:53,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:37:53,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:37:53,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:37:53,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:37:53,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 19:37:53,501 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:37:53,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:37:53,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:37:53,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:37:53,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:37:53,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:37:53,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:37:53,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:37:53,504 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:37:53,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:37:53,504 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:37:53,505 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:37:53,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:37:53,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 19:37:53,506 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 19:37:53,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:37:53,507 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:37:53,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:37:53,507 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 19:37:53,507 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:37:53,507 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 -> ea0ecaab9c4a4889914d1343f60808acf6ec66df89812b70cea6837a39471f7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 19:37:53,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:37:53,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:37:53,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:37:53,825 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:37:53,826 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:37:53,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2023-08-29 19:37:54,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:37:55,044 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:37:55,048 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2023-08-29 19:37:55,065 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc8541cb/e927763f57d84db6ac783eaf976e56d6/FLAG33544eeed [2023-08-29 19:37:55,085 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc8541cb/e927763f57d84db6ac783eaf976e56d6 [2023-08-29 19:37:55,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:37:55,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:37:55,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:37:55,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:37:55,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:37:55,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e767308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55, skipping insertion in model container [2023-08-29 19:37:55,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:37:55,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:37:55,309 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:37:55,508 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/singleton.i[55547,55560] [2023-08-29 19:37:55,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:37:55,536 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:37:55,559 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:37:55,575 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/singleton.i[55547,55560] [2023-08-29 19:37:55,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:37:55,643 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:55,644 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:55,644 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:37:55,648 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:37:55,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55 WrapperNode [2023-08-29 19:37:55,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:37:55,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:37:55,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:37:55,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:37:55,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,700 INFO L138 Inliner]: procedures = 328, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2023-08-29 19:37:55,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:37:55,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:37:55,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:37:55,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:37:55,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,741 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:37:55,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:37:55,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:37:55,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:37:55,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (1/1) ... [2023-08-29 19:37:55,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:37:55,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:37:55,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 19:37:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 19:37:55,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:37:55,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 19:37:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 19:37:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 19:37:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-08-29 19:37:55,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-08-29 19:37:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 19:37:55,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 19:37:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 19:37:55,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 19:37:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 19:37:55,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 19:37:55,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 19:37:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:37:55,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:37:55,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:37:55,880 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:37:56,012 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:37:56,013 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:37:56,364 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:37:56,369 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:37:56,375 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 19:37:56,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:56 BoogieIcfgContainer [2023-08-29 19:37:56,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:37:56,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:37:56,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:37:56,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:37:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:37:55" (1/3) ... [2023-08-29 19:37:56,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ededef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:37:56, skipping insertion in model container [2023-08-29 19:37:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:37:55" (2/3) ... [2023-08-29 19:37:56,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ededef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:37:56, skipping insertion in model container [2023-08-29 19:37:56,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:56" (3/3) ... [2023-08-29 19:37:56,385 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton.i [2023-08-29 19:37:56,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:37:56,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-29 19:37:56,396 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:37:56,494 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-08-29 19:37:56,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 243 transitions, 593 flow [2023-08-29 19:37:56,561 INFO L130 PetriNetUnfolder]: 6/164 cut-off events. [2023-08-29 19:37:56,565 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 19:37:56,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 164 events. 6/164 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 172 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2023-08-29 19:37:56,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 243 transitions, 593 flow [2023-08-29 19:37:56,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 160 transitions, 371 flow [2023-08-29 19:37:56,580 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:37:56,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 160 transitions, 371 flow [2023-08-29 19:37:56,588 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 160 transitions, 371 flow [2023-08-29 19:37:56,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 160 transitions, 371 flow [2023-08-29 19:37:56,609 INFO L130 PetriNetUnfolder]: 6/160 cut-off events. [2023-08-29 19:37:56,610 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 19:37:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 160 events. 6/160 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 175 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2023-08-29 19:37:56,612 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2023-08-29 19:38:02,888 INFO L134 LiptonReduction]: Checked pairs total: 6857 [2023-08-29 19:38:02,888 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-29 19:38:02,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:38:02,921 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;@60d55c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:38:02,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-08-29 19:38:02,923 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:38:02,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:38:02,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:02,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:38:02,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:02,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2023-08-29 19:38:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873164878] [2023-08-29 19:38:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:02,966 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-29 19:38:02,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:02,979 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-29 19:38:02,987 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-29 19:38:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:03,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 19:38:03,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:03,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:03,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873164878] [2023-08-29 19:38:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873164878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:38:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299825218] [2023-08-29 19:38:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:38:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:03,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:38:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:38:03,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 370 [2023-08-29 19:38:03,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 221 flow. Second operand has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:03,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:03,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 370 [2023-08-29 19:38:03,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:04,984 INFO L130 PetriNetUnfolder]: 19442/26672 cut-off events. [2023-08-29 19:38:04,985 INFO L131 PetriNetUnfolder]: For 769/769 co-relation queries the response was YES. [2023-08-29 19:38:05,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53375 conditions, 26672 events. 19442/26672 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 145258 event pairs, 19098 based on Foata normal form. 0/9489 useless extension candidates. Maximal degree in co-relation 53350. Up to 25317 conditions per place. [2023-08-29 19:38:05,154 INFO L137 encePairwiseOnDemand]: 368/370 looper letters, 65 selfloop transitions, 0 changer transitions 0/83 dead transitions. [2023-08-29 19:38:05,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 347 flow [2023-08-29 19:38:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:38:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:38:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 491 transitions. [2023-08-29 19:38:05,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635135135135135 [2023-08-29 19:38:05,190 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 491 transitions. [2023-08-29 19:38:05,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 491 transitions. [2023-08-29 19:38:05,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:05,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 491 transitions. [2023-08-29 19:38:05,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 245.5) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:05,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:05,207 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:05,209 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 221 flow. Second operand 2 states and 491 transitions. [2023-08-29 19:38:05,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 347 flow [2023-08-29 19:38:05,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 313 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-29 19:38:05,225 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 183 flow [2023-08-29 19:38:05,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2023-08-29 19:38:05,232 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -13 predicate places. [2023-08-29 19:38:05,233 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 183 flow [2023-08-29 19:38:05,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:05,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:05,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:38:05,254 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 (2)] Ended with exit code 0 [2023-08-29 19:38:05,440 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-29 19:38:05,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:05,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 599893, now seen corresponding path program 1 times [2023-08-29 19:38:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:05,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534063348] [2023-08-29 19:38:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:05,444 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-29 19:38:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:05,449 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-29 19:38:05,462 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-29 19:38:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:05,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:38:05,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:05,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:05,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:05,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534063348] [2023-08-29 19:38:05,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534063348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:05,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:05,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:38:05,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733866598] [2023-08-29 19:38:05,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:05,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:05,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:05,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 370 [2023-08-29 19:38:05,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:05,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:05,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 370 [2023-08-29 19:38:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:07,334 INFO L130 PetriNetUnfolder]: 19430/26651 cut-off events. [2023-08-29 19:38:07,334 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-29 19:38:07,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52293 conditions, 26651 events. 19430/26651 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 145199 event pairs, 16158 based on Foata normal form. 0/9483 useless extension candidates. Maximal degree in co-relation 52290. Up to 25252 conditions per place. [2023-08-29 19:38:07,481 INFO L137 encePairwiseOnDemand]: 367/370 looper letters, 68 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-29 19:38:07,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 88 transitions, 333 flow [2023-08-29 19:38:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-08-29 19:38:07,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6207207207207207 [2023-08-29 19:38:07,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-08-29 19:38:07,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-08-29 19:38:07,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:07,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-08-29 19:38:07,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 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-29 19:38:07,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:07,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:07,490 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 183 flow. Second operand 3 states and 689 transitions. [2023-08-29 19:38:07,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 88 transitions, 333 flow [2023-08-29 19:38:07,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:38:07,494 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 191 flow [2023-08-29 19:38:07,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2023-08-29 19:38:07,495 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -10 predicate places. [2023-08-29 19:38:07,495 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 191 flow [2023-08-29 19:38:07,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:07,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:07,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:38:07,507 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-29 19:38:07,704 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-29 19:38:07,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:07,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash 599892, now seen corresponding path program 1 times [2023-08-29 19:38:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:07,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877246760] [2023-08-29 19:38:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:07,706 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-29 19:38:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:07,726 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-29 19:38:07,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 (4)] Waiting until timeout for monitored process [2023-08-29 19:38:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:07,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:38:07,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:07,794 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-29 19:38:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:07,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:07,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877246760] [2023-08-29 19:38:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877246760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:38:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896167637] [2023-08-29 19:38:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:07,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:07,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 370 [2023-08-29 19:38:07,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:07,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:07,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 370 [2023-08-29 19:38:07,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:09,180 INFO L130 PetriNetUnfolder]: 14207/19637 cut-off events. [2023-08-29 19:38:09,180 INFO L131 PetriNetUnfolder]: For 1525/1525 co-relation queries the response was YES. [2023-08-29 19:38:09,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39994 conditions, 19637 events. 14207/19637 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 104183 event pairs, 13939 based on Foata normal form. 0/8948 useless extension candidates. Maximal degree in co-relation 39989. Up to 18580 conditions per place. [2023-08-29 19:38:09,247 INFO L137 encePairwiseOnDemand]: 361/370 looper letters, 68 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2023-08-29 19:38:09,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 368 flow [2023-08-29 19:38:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2023-08-29 19:38:09,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5936936936936937 [2023-08-29 19:38:09,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2023-08-29 19:38:09,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2023-08-29 19:38:09,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:09,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2023-08-29 19:38:09,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:09,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:09,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:09,253 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 191 flow. Second operand 3 states and 659 transitions. [2023-08-29 19:38:09,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 368 flow [2023-08-29 19:38:09,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 94 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:09,258 INFO L231 Difference]: Finished difference. Result has 91 places, 89 transitions, 245 flow [2023-08-29 19:38:09,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=91, PETRI_TRANSITIONS=89} [2023-08-29 19:38:09,259 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -8 predicate places. [2023-08-29 19:38:09,260 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 245 flow [2023-08-29 19:38:09,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:09,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:09,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:09,266 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-29 19:38:09,466 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-29 19:38:09,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:09,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -83049567, now seen corresponding path program 1 times [2023-08-29 19:38:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469849060] [2023-08-29 19:38:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:09,467 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-29 19:38:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:09,481 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-29 19:38:09,482 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-29 19:38:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:09,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:38:09,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:09,564 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-29 19:38:09,590 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:09,591 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 19 treesize of output 27 [2023-08-29 19:38:09,625 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:09,625 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 19 treesize of output 27 [2023-08-29 19:38:09,653 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:09,654 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 19 treesize of output 27 [2023-08-29 19:38:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:09,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:09,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469849060] [2023-08-29 19:38:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469849060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:09,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561455335] [2023-08-29 19:38:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:09,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:09,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:09,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 370 [2023-08-29 19:38:09,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:09,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:09,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 370 [2023-08-29 19:38:09,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:10,777 INFO L130 PetriNetUnfolder]: 14202/19629 cut-off events. [2023-08-29 19:38:10,778 INFO L131 PetriNetUnfolder]: For 2991/2991 co-relation queries the response was YES. [2023-08-29 19:38:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41475 conditions, 19629 events. 14202/19629 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 104131 event pairs, 12475 based on Foata normal form. 0/8956 useless extension candidates. Maximal degree in co-relation 41469. Up to 18558 conditions per place. [2023-08-29 19:38:10,869 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 70 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2023-08-29 19:38:10,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 393 flow [2023-08-29 19:38:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2023-08-29 19:38:10,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5882882882882883 [2023-08-29 19:38:10,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 653 transitions. [2023-08-29 19:38:10,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 653 transitions. [2023-08-29 19:38:10,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:10,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 653 transitions. [2023-08-29 19:38:10,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:10,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:10,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:10,875 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 245 flow. Second operand 3 states and 653 transitions. [2023-08-29 19:38:10,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 393 flow [2023-08-29 19:38:10,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:10,881 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 229 flow [2023-08-29 19:38:10,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2023-08-29 19:38:10,882 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -10 predicate places. [2023-08-29 19:38:10,882 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 229 flow [2023-08-29 19:38:10,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:10,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:10,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:10,892 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-29 19:38:11,089 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-29 19:38:11,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:11,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash -83049566, now seen corresponding path program 1 times [2023-08-29 19:38:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723000632] [2023-08-29 19:38:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:11,092 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-29 19:38:11,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:11,093 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-29 19:38:11,097 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-29 19:38:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:11,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 19:38:11,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:11,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:11,179 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-29 19:38:11,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:11,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:11,231 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:11,231 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 19 treesize of output 27 [2023-08-29 19:38:11,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:11,291 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:11,319 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:11,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:11,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:11,400 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 12 treesize of output 14 [2023-08-29 19:38:11,426 INFO L321 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2023-08-29 19:38:11,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2023-08-29 19:38:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:11,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:11,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723000632] [2023-08-29 19:38:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723000632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:11,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:38:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979039237] [2023-08-29 19:38:11,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:11,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:38:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:11,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:38:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:38:12,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 370 [2023-08-29 19:38:12,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:12,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:12,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 370 [2023-08-29 19:38:12,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:13,781 INFO L130 PetriNetUnfolder]: 14199/19619 cut-off events. [2023-08-29 19:38:13,781 INFO L131 PetriNetUnfolder]: For 2987/2987 co-relation queries the response was YES. [2023-08-29 19:38:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41449 conditions, 19619 events. 14199/19619 cut-off events. For 2987/2987 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 104128 event pairs, 12468 based on Foata normal form. 0/8948 useless extension candidates. Maximal degree in co-relation 41443. Up to 18548 conditions per place. [2023-08-29 19:38:13,831 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 72 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2023-08-29 19:38:13,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 409 flow [2023-08-29 19:38:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:38:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:38:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1172 transitions. [2023-08-29 19:38:13,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527927927927928 [2023-08-29 19:38:13,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1172 transitions. [2023-08-29 19:38:13,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1172 transitions. [2023-08-29 19:38:13,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:13,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1172 transitions. [2023-08-29 19:38:13,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:13,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:13,840 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:13,840 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 229 flow. Second operand 6 states and 1172 transitions. [2023-08-29 19:38:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 409 flow [2023-08-29 19:38:13,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:13,842 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 233 flow [2023-08-29 19:38:13,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2023-08-29 19:38:13,842 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -9 predicate places. [2023-08-29 19:38:13,842 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 233 flow [2023-08-29 19:38:13,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:13,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:13,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:13,850 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 (6)] Ended with exit code 0 [2023-08-29 19:38:14,049 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-29 19:38:14,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:14,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1474912626, now seen corresponding path program 1 times [2023-08-29 19:38:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147404098] [2023-08-29 19:38:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:14,051 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-29 19:38:14,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:14,051 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-29 19:38:14,053 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-29 19:38:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:14,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 19:38:14,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:14,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:14,153 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-29 19:38:14,199 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:14,200 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 19 treesize of output 27 [2023-08-29 19:38:14,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:14,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,252 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:14,252 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 19 treesize of output 27 [2023-08-29 19:38:14,288 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:14,288 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 19 treesize of output 27 [2023-08-29 19:38:14,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:14,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,332 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:14,333 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 19 treesize of output 27 [2023-08-29 19:38:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:14,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,357 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 19:38:14,357 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-29 19:38:14,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:14,397 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:14,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:14,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:14,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147404098] [2023-08-29 19:38:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147404098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:14,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:14,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:38:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266175598] [2023-08-29 19:38:14,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:14,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:38:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:38:14,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:38:15,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:38:15,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 192.4) internal successors, (962), 5 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:15,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:15,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:38:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:16,011 INFO L130 PetriNetUnfolder]: 8982/12608 cut-off events. [2023-08-29 19:38:16,011 INFO L131 PetriNetUnfolder]: For 2960/2960 co-relation queries the response was YES. [2023-08-29 19:38:16,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26214 conditions, 12608 events. 8982/12608 cut-off events. For 2960/2960 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 64812 event pairs, 8805 based on Foata normal form. 1456/6947 useless extension candidates. Maximal degree in co-relation 26208. Up to 11895 conditions per place. [2023-08-29 19:38:16,124 INFO L137 encePairwiseOnDemand]: 361/370 looper letters, 61 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2023-08-29 19:38:16,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 88 transitions, 378 flow [2023-08-29 19:38:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:38:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:38:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 836 transitions. [2023-08-29 19:38:16,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648648648648649 [2023-08-29 19:38:16,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 836 transitions. [2023-08-29 19:38:16,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 836 transitions. [2023-08-29 19:38:16,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:16,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 836 transitions. [2023-08-29 19:38:16,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:16,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:16,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:16,131 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 233 flow. Second operand 4 states and 836 transitions. [2023-08-29 19:38:16,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 88 transitions, 378 flow [2023-08-29 19:38:16,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 19:38:16,133 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 233 flow [2023-08-29 19:38:16,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2023-08-29 19:38:16,134 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -13 predicate places. [2023-08-29 19:38:16,134 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 233 flow [2023-08-29 19:38:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.4) internal successors, (962), 5 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:16,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:16,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:16,153 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-29 19:38:16,342 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-29 19:38:16,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:16,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1595754247, now seen corresponding path program 1 times [2023-08-29 19:38:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387704084] [2023-08-29 19:38:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:16,343 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-29 19:38:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:16,350 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-29 19:38:16,351 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-29 19:38:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:16,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:38:16,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:16,464 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-29 19:38:16,483 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:16,483 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 19 treesize of output 27 [2023-08-29 19:38:16,501 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:16,501 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 19 treesize of output 27 [2023-08-29 19:38:16,519 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:16,519 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 19 treesize of output 27 [2023-08-29 19:38:16,538 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:38:16,538 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-29 19:38:16,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-29 19:38:16,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:16,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387704084] [2023-08-29 19:38:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387704084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368784792] [2023-08-29 19:38:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:16,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:16,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 370 [2023-08-29 19:38:16,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:16,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:16,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 370 [2023-08-29 19:38:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:17,158 INFO L130 PetriNetUnfolder]: 7190/10302 cut-off events. [2023-08-29 19:38:17,158 INFO L131 PetriNetUnfolder]: For 1253/1253 co-relation queries the response was YES. [2023-08-29 19:38:17,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21345 conditions, 10302 events. 7190/10302 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 52739 event pairs, 5815 based on Foata normal form. 0/4728 useless extension candidates. Maximal degree in co-relation 21340. Up to 9576 conditions per place. [2023-08-29 19:38:17,196 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 64 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-29 19:38:17,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 365 flow [2023-08-29 19:38:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2023-08-29 19:38:17,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5828828828828829 [2023-08-29 19:38:17,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 647 transitions. [2023-08-29 19:38:17,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 647 transitions. [2023-08-29 19:38:17,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:17,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 647 transitions. [2023-08-29 19:38:17,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:17,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:17,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:17,207 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 233 flow. Second operand 3 states and 647 transitions. [2023-08-29 19:38:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 365 flow [2023-08-29 19:38:17,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:17,209 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 222 flow [2023-08-29 19:38:17,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2023-08-29 19:38:17,210 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -15 predicate places. [2023-08-29 19:38:17,210 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 222 flow [2023-08-29 19:38:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:17,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:17,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:17,221 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-29 19:38:17,421 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-29 19:38:17,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:17,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1595754248, now seen corresponding path program 1 times [2023-08-29 19:38:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139434654] [2023-08-29 19:38:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:17,422 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-29 19:38:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:17,425 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-29 19:38:17,426 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-29 19:38:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:17,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 19:38:17,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:17,543 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-29 19:38:17,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:17,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:17,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:17,626 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:17,626 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 19 treesize of output 27 [2023-08-29 19:38:17,678 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:17,678 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 19 treesize of output 27 [2023-08-29 19:38:17,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:17,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:17,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:17,714 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 19:38:17,714 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-29 19:38:17,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:17,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:17,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:17,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139434654] [2023-08-29 19:38:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139434654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:38:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68916783] [2023-08-29 19:38:17,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:17,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:38:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:38:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:38:18,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 370 [2023-08-29 19:38:18,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:18,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:18,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 370 [2023-08-29 19:38:18,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:18,921 INFO L130 PetriNetUnfolder]: 5397/7995 cut-off events. [2023-08-29 19:38:18,921 INFO L131 PetriNetUnfolder]: For 995/995 co-relation queries the response was YES. [2023-08-29 19:38:18,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16470 conditions, 7995 events. 5397/7995 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 41564 event pairs, 4276 based on Foata normal form. 0/3959 useless extension candidates. Maximal degree in co-relation 16465. Up to 7269 conditions per place. [2023-08-29 19:38:18,958 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 61 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-08-29 19:38:18,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 363 flow [2023-08-29 19:38:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:38:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:38:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1017 transitions. [2023-08-29 19:38:18,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497297297297298 [2023-08-29 19:38:18,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1017 transitions. [2023-08-29 19:38:18,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1017 transitions. [2023-08-29 19:38:18,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:18,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1017 transitions. [2023-08-29 19:38:18,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 203.4) internal successors, (1017), 5 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:18,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:18,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:18,965 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 222 flow. Second operand 5 states and 1017 transitions. [2023-08-29 19:38:18,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 363 flow [2023-08-29 19:38:18,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:18,968 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 224 flow [2023-08-29 19:38:18,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2023-08-29 19:38:18,969 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -15 predicate places. [2023-08-29 19:38:18,969 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 224 flow [2023-08-29 19:38:18,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:18,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:18,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:18,980 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 (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:38:19,177 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-29 19:38:19,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:19,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash 216519625, now seen corresponding path program 1 times [2023-08-29 19:38:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131289500] [2023-08-29 19:38:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:19,179 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-29 19:38:19,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:19,180 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-29 19:38:19,183 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-29 19:38:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:19,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 19:38:19,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:19,286 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-29 19:38:19,305 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:19,305 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 19 treesize of output 27 [2023-08-29 19:38:19,323 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:19,323 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 19 treesize of output 27 [2023-08-29 19:38:19,339 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:38:19,339 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-29 19:38:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:19,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:19,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131289500] [2023-08-29 19:38:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131289500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477263279] [2023-08-29 19:38:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:19,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:19,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 370 [2023-08-29 19:38:19,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:19,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:19,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 370 [2023-08-29 19:38:19,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:19,998 INFO L130 PetriNetUnfolder]: 5739/8201 cut-off events. [2023-08-29 19:38:19,998 INFO L131 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2023-08-29 19:38:20,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17203 conditions, 8201 events. 5739/8201 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 39723 event pairs, 4561 based on Foata normal form. 0/4241 useless extension candidates. Maximal degree in co-relation 17198. Up to 7731 conditions per place. [2023-08-29 19:38:20,029 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 62 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-29 19:38:20,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 352 flow [2023-08-29 19:38:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-29 19:38:20,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2023-08-29 19:38:20,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-29 19:38:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-29 19:38:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:20,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-29 19:38:20,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:20,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:20,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:20,034 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 224 flow. Second operand 3 states and 645 transitions. [2023-08-29 19:38:20,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 352 flow [2023-08-29 19:38:20,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 342 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:38:20,037 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 214 flow [2023-08-29 19:38:20,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2023-08-29 19:38:20,037 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -19 predicate places. [2023-08-29 19:38:20,037 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 214 flow [2023-08-29 19:38:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:20,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:20,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:20,045 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-29 19:38:20,241 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-29 19:38:20,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:20,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 216519626, now seen corresponding path program 1 times [2023-08-29 19:38:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:20,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487804068] [2023-08-29 19:38:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:20,242 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-29 19:38:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:20,243 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-29 19:38:20,244 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-29 19:38:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:20,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-29 19:38:20,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:20,367 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-29 19:38:20,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:20,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:20,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:20,434 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:20,434 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 19 treesize of output 27 [2023-08-29 19:38:20,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:20,495 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:20,512 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:38:20,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:38:20,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:20,574 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:20,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:20,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487804068] [2023-08-29 19:38:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487804068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:20,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:20,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:38:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377416913] [2023-08-29 19:38:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:20,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:38:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:38:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:38:21,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 370 [2023-08-29 19:38:21,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 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-29 19:38:21,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:21,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 370 [2023-08-29 19:38:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:22,513 INFO L130 PetriNetUnfolder]: 5731/8057 cut-off events. [2023-08-29 19:38:22,513 INFO L131 PetriNetUnfolder]: For 1021/1021 co-relation queries the response was YES. [2023-08-29 19:38:22,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17040 conditions, 8057 events. 5731/8057 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 37592 event pairs, 4552 based on Foata normal form. 0/4109 useless extension candidates. Maximal degree in co-relation 17035. Up to 7701 conditions per place. [2023-08-29 19:38:22,546 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 64 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-08-29 19:38:22,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 373 flow [2023-08-29 19:38:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:38:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:38:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2023-08-29 19:38:22,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2023-08-29 19:38:22,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1164 transitions. [2023-08-29 19:38:22,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1164 transitions. [2023-08-29 19:38:22,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:22,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1164 transitions. [2023-08-29 19:38:22,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:22,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:22,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:22,585 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 214 flow. Second operand 6 states and 1164 transitions. [2023-08-29 19:38:22,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 373 flow [2023-08-29 19:38:22,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 82 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:22,588 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 218 flow [2023-08-29 19:38:22,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2023-08-29 19:38:22,591 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -18 predicate places. [2023-08-29 19:38:22,591 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 218 flow [2023-08-29 19:38:22,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 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-29 19:38:22,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:22,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:22,613 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-29 19:38:22,798 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-29 19:38:22,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:22,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash 216519583, now seen corresponding path program 1 times [2023-08-29 19:38:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:22,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316599151] [2023-08-29 19:38:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:22,800 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-29 19:38:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:22,802 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-29 19:38:22,804 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-29 19:38:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:22,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:38:22,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:22,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:22,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:22,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316599151] [2023-08-29 19:38:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316599151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15390632] [2023-08-29 19:38:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:23,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 370 [2023-08-29 19:38:23,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:23,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 370 [2023-08-29 19:38:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:23,362 INFO L130 PetriNetUnfolder]: 1832/2798 cut-off events. [2023-08-29 19:38:23,362 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-29 19:38:23,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 2798 events. 1832/2798 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11889 event pairs, 1387 based on Foata normal form. 0/1754 useless extension candidates. Maximal degree in co-relation 5884. Up to 2564 conditions per place. [2023-08-29 19:38:23,371 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 59 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2023-08-29 19:38:23,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 334 flow [2023-08-29 19:38:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-29 19:38:23,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.590990990990991 [2023-08-29 19:38:23,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-29 19:38:23,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-29 19:38:23,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:23,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-29 19:38:23,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:23,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:23,376 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 218 flow. Second operand 3 states and 656 transitions. [2023-08-29 19:38:23,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 334 flow [2023-08-29 19:38:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 322 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:38:23,378 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 198 flow [2023-08-29 19:38:23,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-29 19:38:23,378 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places. [2023-08-29 19:38:23,379 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 198 flow [2023-08-29 19:38:23,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:23,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:23,399 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-29 19:38:23,586 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-29 19:38:23,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:23,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash 216519582, now seen corresponding path program 1 times [2023-08-29 19:38:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294332589] [2023-08-29 19:38:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:23,588 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-29 19:38:23,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:23,589 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-29 19:38:23,591 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-29 19:38:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:23,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:38:23,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:23,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 19:38:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:23,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:23,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294332589] [2023-08-29 19:38:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294332589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:23,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:38:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410915286] [2023-08-29 19:38:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:23,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:38:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:23,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:38:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:38:23,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 370 [2023-08-29 19:38:23,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:23,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 370 [2023-08-29 19:38:23,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:23,984 INFO L130 PetriNetUnfolder]: 414/750 cut-off events. [2023-08-29 19:38:23,984 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-29 19:38:23,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 750 events. 414/750 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2468 event pairs, 272 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 1590. Up to 609 conditions per place. [2023-08-29 19:38:23,987 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 50 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-29 19:38:23,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 302 flow [2023-08-29 19:38:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:38:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:38:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2023-08-29 19:38:23,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567567567567567 [2023-08-29 19:38:23,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 618 transitions. [2023-08-29 19:38:23,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 618 transitions. [2023-08-29 19:38:23,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:23,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 618 transitions. [2023-08-29 19:38:23,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:23,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 370.0) internal successors, (1480), 4 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-29 19:38:23,992 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 198 flow. Second operand 3 states and 618 transitions. [2023-08-29 19:38:23,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 302 flow [2023-08-29 19:38:23,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:38:23,993 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 195 flow [2023-08-29 19:38:23,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2023-08-29 19:38:23,994 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places. [2023-08-29 19:38:23,994 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 195 flow [2023-08-29 19:38:23,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:23,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:23,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:24,004 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 (13)] Forceful destruction successful, exit code 0 [2023-08-29 19:38:24,201 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-29 19:38:24,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:24,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1916942413, now seen corresponding path program 1 times [2023-08-29 19:38:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089591656] [2023-08-29 19:38:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:24,202 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-29 19:38:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:24,203 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-29 19:38:24,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 (14)] Waiting until timeout for monitored process [2023-08-29 19:38:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:24,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:38:24,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:24,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:24,331 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-29 19:38:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:24,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:24,360 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 19:38:24,360 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-29 19:38:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:24,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:24,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:24,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089591656] [2023-08-29 19:38:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089591656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:38:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953317172] [2023-08-29 19:38:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:24,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:38:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:24,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:38:24,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:38:25,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 370 [2023-08-29 19:38:25,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:25,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:25,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 370 [2023-08-29 19:38:25,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:25,258 INFO L130 PetriNetUnfolder]: 403/707 cut-off events. [2023-08-29 19:38:25,258 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-08-29 19:38:25,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 707 events. 403/707 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2182 event pairs, 260 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 1535. Up to 587 conditions per place. [2023-08-29 19:38:25,260 INFO L137 encePairwiseOnDemand]: 362/370 looper letters, 51 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-29 19:38:25,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 318 flow [2023-08-29 19:38:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:38:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:38:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1004 transitions. [2023-08-29 19:38:25,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5427027027027027 [2023-08-29 19:38:25,263 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1004 transitions. [2023-08-29 19:38:25,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1004 transitions. [2023-08-29 19:38:25,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:25,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1004 transitions. [2023-08-29 19:38:25,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.8) internal successors, (1004), 5 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:25,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:25,267 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:25,267 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 195 flow. Second operand 5 states and 1004 transitions. [2023-08-29 19:38:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 318 flow [2023-08-29 19:38:25,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:38:25,269 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 191 flow [2023-08-29 19:38:25,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-08-29 19:38:25,270 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -31 predicate places. [2023-08-29 19:38:25,270 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 191 flow [2023-08-29 19:38:25,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:25,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:25,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:25,278 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-29 19:38:25,477 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-29 19:38:25,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:25,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -359295160, now seen corresponding path program 1 times [2023-08-29 19:38:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:25,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418937946] [2023-08-29 19:38:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:25,479 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-29 19:38:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:25,480 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-29 19:38:25,482 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-29 19:38:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:25,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:38:25,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:25,611 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-29 19:38:25,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:38:25,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:25,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:38:25,674 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 19:38:25,674 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-29 19:38:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:25,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:25,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418937946] [2023-08-29 19:38:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418937946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:25,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:25,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:38:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663606176] [2023-08-29 19:38:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:25,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:38:25,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:25,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:38:25,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:38:26,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 370 [2023-08-29 19:38:26,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:26,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:26,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 370 [2023-08-29 19:38:26,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:26,167 INFO L130 PetriNetUnfolder]: 330/594 cut-off events. [2023-08-29 19:38:26,168 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-08-29 19:38:26,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 594 events. 330/594 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1723 event pairs, 208 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 1296. Up to 488 conditions per place. [2023-08-29 19:38:26,169 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 47 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-29 19:38:26,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 298 flow [2023-08-29 19:38:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:38:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:38:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 817 transitions. [2023-08-29 19:38:26,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.552027027027027 [2023-08-29 19:38:26,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 817 transitions. [2023-08-29 19:38:26,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 817 transitions. [2023-08-29 19:38:26,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:26,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 817 transitions. [2023-08-29 19:38:26,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.25) internal successors, (817), 4 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:26,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:26,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:26,177 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 191 flow. Second operand 4 states and 817 transitions. [2023-08-29 19:38:26,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 298 flow [2023-08-29 19:38:26,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:38:26,179 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 181 flow [2023-08-29 19:38:26,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-29 19:38:26,180 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -36 predicate places. [2023-08-29 19:38:26,180 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 181 flow [2023-08-29 19:38:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:26,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:26,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:26,188 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-29 19:38:26,388 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-29 19:38:26,388 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:26,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1215556931, now seen corresponding path program 1 times [2023-08-29 19:38:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:26,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259878534] [2023-08-29 19:38:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:26,389 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-29 19:38:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:26,390 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-29 19:38:26,392 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-29 19:38:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:26,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 19:38:26,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:26,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 19:38:26,593 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:26,593 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 19 treesize of output 27 [2023-08-29 19:38:26,647 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:26,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:26,697 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:26,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:26,744 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:26,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:26,791 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:26,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:26,848 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:38:26,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2023-08-29 19:38:27,620 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 0 case distinctions, treesize of input 37 treesize of output 41 [2023-08-29 19:38:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:27,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:27,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259878534] [2023-08-29 19:38:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259878534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:38:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633590425] [2023-08-29 19:38:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:38:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:38:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:38:28,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 370 [2023-08-29 19:38:28,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:28,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:28,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 370 [2023-08-29 19:38:28,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:28,829 INFO L130 PetriNetUnfolder]: 325/588 cut-off events. [2023-08-29 19:38:28,829 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2023-08-29 19:38:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 588 events. 325/588 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1714 event pairs, 205 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 1272. Up to 483 conditions per place. [2023-08-29 19:38:28,831 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 44 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-29 19:38:28,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 288 flow [2023-08-29 19:38:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:38:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:38:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 804 transitions. [2023-08-29 19:38:28,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432432432432432 [2023-08-29 19:38:28,833 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 804 transitions. [2023-08-29 19:38:28,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 804 transitions. [2023-08-29 19:38:28,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:28,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 804 transitions. [2023-08-29 19:38:28,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:28,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:28,837 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:28,837 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 181 flow. Second operand 4 states and 804 transitions. [2023-08-29 19:38:28,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 288 flow [2023-08-29 19:38:28,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:38:28,838 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 190 flow [2023-08-29 19:38:28,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-08-29 19:38:28,838 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -35 predicate places. [2023-08-29 19:38:28,839 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 190 flow [2023-08-29 19:38:28,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:28,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:28,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:28,847 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-29 19:38:29,047 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-29 19:38:29,047 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:29,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash 972438923, now seen corresponding path program 1 times [2023-08-29 19:38:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583383826] [2023-08-29 19:38:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:29,048 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-29 19:38:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:29,049 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-29 19:38:29,051 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-29 19:38:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 19:38:29,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:29,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 19:38:29,277 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:29,278 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 19 treesize of output 27 [2023-08-29 19:38:29,343 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:29,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:29,454 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:29,455 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 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:29,527 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:29,527 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 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:29,572 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:29,573 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 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:29,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:29,656 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:38:29,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2023-08-29 19:38:30,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2023-08-29 19:38:30,818 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 14 treesize of output 20 [2023-08-29 19:38:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:30,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:30,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:30,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583383826] [2023-08-29 19:38:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583383826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 19:38:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258949702] [2023-08-29 19:38:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:38:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:38:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:38:32,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 370 [2023-08-29 19:38:32,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 190 flow. Second operand has 8 states, 8 states have (on average 189.625) internal successors, (1517), 8 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:32,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:32,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 370 [2023-08-29 19:38:32,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:32,936 INFO L130 PetriNetUnfolder]: 325/587 cut-off events. [2023-08-29 19:38:32,936 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2023-08-29 19:38:32,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 587 events. 325/587 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1707 event pairs, 204 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 1279. Up to 483 conditions per place. [2023-08-29 19:38:32,937 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 45 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2023-08-29 19:38:32,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 305 flow [2023-08-29 19:38:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:38:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:38:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1163 transitions. [2023-08-29 19:38:32,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238738738738739 [2023-08-29 19:38:32,940 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1163 transitions. [2023-08-29 19:38:32,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1163 transitions. [2023-08-29 19:38:32,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:32,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1163 transitions. [2023-08-29 19:38:32,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.83333333333334) internal successors, (1163), 6 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:32,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:32,943 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:32,943 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 190 flow. Second operand 6 states and 1163 transitions. [2023-08-29 19:38:32,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 305 flow [2023-08-29 19:38:32,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 295 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:38:32,945 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 197 flow [2023-08-29 19:38:32,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-29 19:38:32,945 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -32 predicate places. [2023-08-29 19:38:32,945 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 197 flow [2023-08-29 19:38:32,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 189.625) internal successors, (1517), 8 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:32,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:32,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:32,956 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-29 19:38:33,154 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-29 19:38:33,154 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:33,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash 80833940, now seen corresponding path program 1 times [2023-08-29 19:38:33,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:33,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556517231] [2023-08-29 19:38:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:33,155 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-29 19:38:33,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:33,156 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-29 19:38:33,157 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-29 19:38:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:33,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 19:38:33,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:33,324 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-29 19:38:33,349 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:33,350 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 19 treesize of output 27 [2023-08-29 19:38:33,396 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:33,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:33,480 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:33,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:33,595 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:33,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:33,669 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:33,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:33,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:33,875 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-29 19:38:33,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 52 [2023-08-29 19:38:36,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2023-08-29 19:38:36,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2023-08-29 19:38:36,448 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 14 treesize of output 20 [2023-08-29 19:38:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:36,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:36,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:36,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556517231] [2023-08-29 19:38:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556517231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 19:38:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315064269] [2023-08-29 19:38:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:36,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 19:38:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 19:38:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-29 19:38:39,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 370 [2023-08-29 19:38:39,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 197 flow. Second operand has 10 states, 10 states have (on average 185.1) internal successors, (1851), 10 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:39,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:39,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 370 [2023-08-29 19:38:39,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:40,081 INFO L130 PetriNetUnfolder]: 325/586 cut-off events. [2023-08-29 19:38:40,081 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-29 19:38:40,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 586 events. 325/586 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1704 event pairs, 203 based on Foata normal form. 1/553 useless extension candidates. Maximal degree in co-relation 1284. Up to 483 conditions per place. [2023-08-29 19:38:40,083 INFO L137 encePairwiseOnDemand]: 362/370 looper letters, 45 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-29 19:38:40,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 327 flow [2023-08-29 19:38:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 19:38:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 19:38:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1506 transitions. [2023-08-29 19:38:40,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087837837837837 [2023-08-29 19:38:40,086 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1506 transitions. [2023-08-29 19:38:40,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1506 transitions. [2023-08-29 19:38:40,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:40,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1506 transitions. [2023-08-29 19:38:40,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 188.25) internal successors, (1506), 8 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:40,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:40,091 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:40,091 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 197 flow. Second operand 8 states and 1506 transitions. [2023-08-29 19:38:40,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 327 flow [2023-08-29 19:38:40,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 315 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:38:40,092 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 209 flow [2023-08-29 19:38:40,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-29 19:38:40,093 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places. [2023-08-29 19:38:40,093 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 209 flow [2023-08-29 19:38:40,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 185.1) internal successors, (1851), 10 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:40,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:40,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:40,118 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-29 19:38:40,301 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-29 19:38:40,302 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:40,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1789116106, now seen corresponding path program 1 times [2023-08-29 19:38:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026798910] [2023-08-29 19:38:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:40,303 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-29 19:38:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:40,305 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-29 19:38:40,306 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-29 19:38:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:40,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 19:38:40,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:40,485 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-29 19:38:40,507 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:40,508 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 19 treesize of output 27 [2023-08-29 19:38:40,546 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:40,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:40,631 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:40,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:40,784 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:40,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:40,973 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:40,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:41,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:41,327 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-29 19:38:41,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 52 [2023-08-29 19:38:44,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2023-08-29 19:38:44,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2023-08-29 19:38:45,073 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-08-29 19:38:45,117 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 14 treesize of output 20 [2023-08-29 19:38:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:45,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:45,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:45,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026798910] [2023-08-29 19:38:45,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026798910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:45,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:45,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 19:38:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984954123] [2023-08-29 19:38:45,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:45,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 19:38:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 19:38:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-29 19:38:50,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 370 [2023-08-29 19:38:50,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 209 flow. Second operand has 12 states, 12 states have (on average 180.75) internal successors, (2169), 12 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:50,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:38:50,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 370 [2023-08-29 19:38:50,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:38:51,256 INFO L130 PetriNetUnfolder]: 325/585 cut-off events. [2023-08-29 19:38:51,256 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2023-08-29 19:38:51,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 585 events. 325/585 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1696 event pairs, 202 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 1290. Up to 483 conditions per place. [2023-08-29 19:38:51,258 INFO L137 encePairwiseOnDemand]: 360/370 looper letters, 45 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2023-08-29 19:38:51,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 354 flow [2023-08-29 19:38:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 19:38:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 19:38:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1833 transitions. [2023-08-29 19:38:51,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954054054054054 [2023-08-29 19:38:51,261 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1833 transitions. [2023-08-29 19:38:51,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1833 transitions. [2023-08-29 19:38:51,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:38:51,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1833 transitions. [2023-08-29 19:38:51,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 183.3) internal successors, (1833), 10 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:51,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 370.0) internal successors, (4070), 11 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:51,267 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 370.0) internal successors, (4070), 11 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:51,267 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 209 flow. Second operand 10 states and 1833 transitions. [2023-08-29 19:38:51,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 354 flow [2023-08-29 19:38:51,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 336 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-29 19:38:51,268 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 221 flow [2023-08-29 19:38:51,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-29 19:38:51,269 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places. [2023-08-29 19:38:51,269 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 221 flow [2023-08-29 19:38:51,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 180.75) internal successors, (2169), 12 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:38:51,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:38:51,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:38:51,279 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-29 19:38:51,477 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-29 19:38:51,477 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:38:51,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:38:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 371976286, now seen corresponding path program 1 times [2023-08-29 19:38:51,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:38:51,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108100365] [2023-08-29 19:38:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:38:51,478 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-29 19:38:51,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:38:51,479 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-29 19:38:51,519 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-29 19:38:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:38:51,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-29 19:38:51,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:38:51,659 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-29 19:38:51,688 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:38:51,689 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 19 treesize of output 27 [2023-08-29 19:38:51,755 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-29 19:38:51,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-29 19:38:51,841 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:51,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:51,950 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:51,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:52,141 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-29 19:38:52,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-29 19:38:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:38:52,549 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-29 19:38:52,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 52 [2023-08-29 19:38:56,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2023-08-29 19:38:56,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2023-08-29 19:38:57,024 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 14 treesize of output 20 [2023-08-29 19:38:57,073 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-08-29 19:38:57,114 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 14 treesize of output 20 [2023-08-29 19:38:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:38:57,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:38:57,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:38:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108100365] [2023-08-29 19:38:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108100365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:38:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:38:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-08-29 19:38:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293323742] [2023-08-29 19:38:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:38:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 19:38:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:38:57,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 19:38:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-29 19:39:02,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 370 [2023-08-29 19:39:02,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 221 flow. Second operand has 14 states, 14 states have (on average 176.42857142857142) internal successors, (2470), 14 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:39:02,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:39:02,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 370 [2023-08-29 19:39:02,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:39:03,596 INFO L130 PetriNetUnfolder]: 325/584 cut-off events. [2023-08-29 19:39:03,597 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-29 19:39:03,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 584 events. 325/584 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1692 event pairs, 202 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 1292. Up to 480 conditions per place. [2023-08-29 19:39:03,598 INFO L137 encePairwiseOnDemand]: 358/370 looper letters, 42 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2023-08-29 19:39:03,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 358 flow [2023-08-29 19:39:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 19:39:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 19:39:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1966 transitions. [2023-08-29 19:39:03,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483046683046683 [2023-08-29 19:39:03,601 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1966 transitions. [2023-08-29 19:39:03,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1966 transitions. [2023-08-29 19:39:03,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:39:03,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1966 transitions. [2023-08-29 19:39:03,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 178.72727272727272) internal successors, (1966), 11 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:39:03,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 370.0) internal successors, (4440), 12 states have internal predecessors, (4440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:39:03,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 370.0) internal successors, (4440), 12 states have internal predecessors, (4440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:39:03,607 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 221 flow. Second operand 11 states and 1966 transitions. [2023-08-29 19:39:03,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 66 transitions, 358 flow [2023-08-29 19:39:03,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 318 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-08-29 19:39:03,608 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 199 flow [2023-08-29 19:39:03,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=199, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-08-29 19:39:03,609 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -30 predicate places. [2023-08-29 19:39:03,609 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 199 flow [2023-08-29 19:39:03,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 176.42857142857142) internal successors, (2470), 14 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:39:03,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:39:03,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:39:03,617 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-29 19:39:03,817 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-29 19:39:03,817 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-08-29 19:39:03,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:39:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 986938756, now seen corresponding path program 1 times [2023-08-29 19:39:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:39:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431813622] [2023-08-29 19:39:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:39:03,818 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-29 19:39:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:39:03,819 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-29 19:39:03,821 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-29 19:39:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:39:04,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:39:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:39:04,213 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 19:39:04,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:39:04,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2023-08-29 19:39:04,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2023-08-29 19:39:04,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2023-08-29 19:39:04,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 71 remaining) [2023-08-29 19:39:04,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2023-08-29 19:39:04,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (34 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2023-08-29 19:39:04,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2023-08-29 19:39:04,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2023-08-29 19:39:04,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2023-08-29 19:39:04,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2023-08-29 19:39:04,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2023-08-29 19:39:04,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 71 remaining) [2023-08-29 19:39:04,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2023-08-29 19:39:04,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2023-08-29 19:39:04,249 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-29 19:39:04,447 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-29 19:39:04,447 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:39:04,451 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:39:04,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:39:04,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:39:04 BasicIcfg [2023-08-29 19:39:04,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:39:04,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:39:04,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:39:04,505 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:39:04,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:37:56" (3/4) ... [2023-08-29 19:39:04,507 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:39:04,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:39:04,507 INFO L158 Benchmark]: Toolchain (without parser) took 69419.26ms. Allocated memory was 69.2MB in the beginning and 7.2GB in the end (delta: 7.2GB). Free memory was 49.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-08-29 19:39:04,507 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:39:04,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.10ms. Allocated memory is still 69.2MB. Free memory was 48.9MB in the beginning and 31.8MB in the end (delta: 17.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-29 19:39:04,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.45ms. Allocated memory is still 69.2MB. Free memory was 31.8MB in the beginning and 29.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:39:04,513 INFO L158 Benchmark]: Boogie Preprocessor took 48.77ms. Allocated memory is still 69.2MB. Free memory was 29.4MB in the beginning and 27.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:39:04,513 INFO L158 Benchmark]: RCFGBuilder took 624.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 54.5MB in the end (delta: -27.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2023-08-29 19:39:04,513 INFO L158 Benchmark]: TraceAbstraction took 68126.14ms. Allocated memory was 83.9MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 54.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-08-29 19:39:04,513 INFO L158 Benchmark]: Witness Printer took 2.10ms. Allocated memory is still 7.2GB. Free memory is still 4.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:39:04,514 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.13ms. Allocated memory is still 52.4MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.10ms. Allocated memory is still 69.2MB. Free memory was 48.9MB in the beginning and 31.8MB in the end (delta: 17.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.45ms. Allocated memory is still 69.2MB. Free memory was 31.8MB in the beginning and 29.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.77ms. Allocated memory is still 69.2MB. Free memory was 29.4MB in the beginning and 27.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.61ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 54.5MB in the end (delta: -27.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * TraceAbstraction took 68126.14ms. Allocated memory was 83.9MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 54.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 2.10ms. Allocated memory is still 7.2GB. Free memory is still 4.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 173 PlacesBefore, 99 PlacesAfterwards, 160 TransitionsBefore, 85 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 5 FixpointIterations, 36 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6857 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4532, independent: 4290, independent conditional: 0, independent unconditional: 4290, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1276, independent: 1212, independent conditional: 0, independent unconditional: 1212, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4532, independent: 3078, independent conditional: 0, independent unconditional: 3078, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 1276, unknown conditional: 0, unknown unconditional: 1276] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1159. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, pthread_create(&t, 0, thread0, 0)=3, t={17:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=4, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=4, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=4, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=5, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t3, 0, thread3, 0)=6, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t4, 0, thread2, 0)=7, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t5, 0, thread2, 0)=8, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1153] 1 \read(t2) VAL [\read(t2)=5, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=5, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=6, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=6, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=7, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=7, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=8, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=8, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={48:0}, t2={7:0}, t3={52:0}, t4={49:0}, t5={16:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] 0 \read(t) VAL [\read(t)=3, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={17:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\read(t)=3, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={17:0}, v={3:0}] [L1164] EXPR 0 v[0] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X') [L1123] COND FALSE 0 !(!expression) [L1164] RET 0 __VERIFIER_assert(v[0] == 'X') [L1165] 0 return 0; [L1165] 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: -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: 1151]: 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: 1149]: 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: 1150]: 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: 1147]: 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: 1152]: 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: -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: 1123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1149]: 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: 1151]: 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: 1147]: 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: 1150]: 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: 1152]: 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 11 procedures, 281 locations, 71 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: 67.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 8300 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5635 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 23.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12080 IncrementalHoareTripleChecker+Invalid, 12537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 453 mSolverCounterUnsat, 348 mSDtfsCounter, 12080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 279 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=3, InterpolantAutomatonStates: 92, 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.0s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 348 ConstructedInterpolants, 169 QuantifiedInterpolants, 13451 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2644 ConjunctsInSsa, 244 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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-29 19:39:04,536 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