./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.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-ext/26_stack_cas_longer-1.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 e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f --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:55:33,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:55:33,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:55:33,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:55:33,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:55:33,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:55:33,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:55:33,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:55:33,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:55:33,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:55:33,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:55:33,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:55:33,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:55:33,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:55:33,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:55:33,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:55:33,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:55:33,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:55:33,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:55:33,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:55:33,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:55:33,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:55:33,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:55:33,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:55:33,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:55:33,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:55:33,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:55:33,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:55:33,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:55:33,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:55:33,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:55:33,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:55:33,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:55:33,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:55:33,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:55:33,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:55:33,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:55:33,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:55:33,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:55:33,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:55:33,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:55:33,849 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:55:33,875 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:55:33,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:55:33,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:55:33,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:55:33,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:55:33,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:55:33,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:55:33,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:55:33,878 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:55:33,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:55:33,878 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:55:33,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:55:33,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:55:33,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:55:33,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:55:33,879 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:55:33,879 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:55:33,880 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:55:33,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:55:33,880 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:55:33,880 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:55:33,881 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:55:33,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:55:33,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:55:33,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:55:33,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:55:33,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:55:33,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:55:33,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:55:33,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:55:33,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:55:33,883 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:55:33,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:55:33,883 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:55:33,883 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 -> e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f 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:55:34,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:55:34,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:55:34,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:55:34,209 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:55:34,210 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:55:34,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2023-08-29 19:55:35,459 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:55:35,708 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:55:35,709 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2023-08-29 19:55:35,720 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94227295/830807d660694f80ae76ad910d9c346d/FLAG2064ff643 [2023-08-29 19:55:35,738 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94227295/830807d660694f80ae76ad910d9c346d [2023-08-29 19:55:35,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:55:35,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:55:35,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:55:35,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:55:35,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:55:35,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:55:35" (1/1) ... [2023-08-29 19:55:35,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e149c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:35, skipping insertion in model container [2023-08-29 19:55:35,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:55:35" (1/1) ... [2023-08-29 19:55:35,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:55:35,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:55:36,164 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-ext/26_stack_cas_longer-1.i[31166,31179] [2023-08-29 19:55:36,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:55:36,189 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:55:36,244 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-ext/26_stack_cas_longer-1.i[31166,31179] [2023-08-29 19:55:36,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:55:36,285 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:55:36,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36 WrapperNode [2023-08-29 19:55:36,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:55:36,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:55:36,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:55:36,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:55:36,293 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:55:36" (1/1) ... [2023-08-29 19:55:36,322 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:55:36" (1/1) ... [2023-08-29 19:55:36,355 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 190 [2023-08-29 19:55:36,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:55:36,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:55:36,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:55:36,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:55:36,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:55:36,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:55:36,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:55:36,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:55:36,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (1/1) ... [2023-08-29 19:55:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:55:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:55:36,452 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:55:36,469 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:55:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:55:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 19:55:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 19:55:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:55:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:55:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:55:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:55:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:55:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:55:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:55:36,496 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:55:36,656 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:55:36,657 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:55:37,011 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:55:37,210 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:55:37,210 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 19:55:37,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:37 BoogieIcfgContainer [2023-08-29 19:55:37,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:55:37,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:55:37,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:55:37,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:55:37,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:55:35" (1/3) ... [2023-08-29 19:55:37,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:55:37, skipping insertion in model container [2023-08-29 19:55:37,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:36" (2/3) ... [2023-08-29 19:55:37,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e6e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:55:37, skipping insertion in model container [2023-08-29 19:55:37,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:37" (3/3) ... [2023-08-29 19:55:37,219 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2023-08-29 19:55:37,234 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:55:37,234 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-29 19:55:37,234 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:55:37,369 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:55:37,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,496 INFO L130 PetriNetUnfolder]: 11/175 cut-off events. [2023-08-29 19:55:37,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:37,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 175 events. 11/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-08-29 19:55:37,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,518 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:55:37,529 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,533 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:55:37,583 INFO L130 PetriNetUnfolder]: 11/175 cut-off events. [2023-08-29 19:55:37,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:37,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 175 events. 11/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-08-29 19:55:37,590 INFO L119 LiptonReduction]: Number of co-enabled transitions 4248 [2023-08-29 19:55:42,745 INFO L134 LiptonReduction]: Checked pairs total: 8906 [2023-08-29 19:55:42,745 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-29 19:55:42,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:55:42,762 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;@7a4076fd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:55:42,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2023-08-29 19:55:42,764 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-29 19:55:42,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:42,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:42,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:55:42,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:42,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 30939, now seen corresponding path program 1 times [2023-08-29 19:55:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049457613] [2023-08-29 19:55:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:43,070 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:55:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049457613] [2023-08-29 19:55:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049457613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:55:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685897382] [2023-08-29 19:55:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:43,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:43,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:43,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 313 [2023-08-29 19:55:43,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:43,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 313 [2023-08-29 19:55:43,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:43,294 INFO L130 PetriNetUnfolder]: 128/284 cut-off events. [2023-08-29 19:55:43,295 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:43,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 284 events. 128/284 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1141 event pairs, 108 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 554. Up to 279 conditions per place. [2023-08-29 19:55:43,298 INFO L137 encePairwiseOnDemand]: 292/313 looper letters, 45 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 19:55:43,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 193 flow [2023-08-29 19:55:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-29 19:55:43,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249201277955272 [2023-08-29 19:55:43,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-29 19:55:43,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-29 19:55:43,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:43,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-29 19:55:43,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,344 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 147 flow. Second operand 3 states and 399 transitions. [2023-08-29 19:55:43,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 193 flow [2023-08-29 19:55:43,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:55:43,350 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 103 flow [2023-08-29 19:55:43,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-29 19:55:43,355 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:55:43,355 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 103 flow [2023-08-29 19:55:43,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:43,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:55:43,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:55:43,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:43,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 30941, now seen corresponding path program 1 times [2023-08-29 19:55:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:43,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475616255] [2023-08-29 19:55:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:43,413 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:55:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475616255] [2023-08-29 19:55:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475616255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:55:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238594952] [2023-08-29 19:55:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:43,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:43,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:43,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 313 [2023-08-29 19:55:43,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:43,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 313 [2023-08-29 19:55:43,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:43,668 INFO L130 PetriNetUnfolder]: 172/397 cut-off events. [2023-08-29 19:55:43,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:43,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 397 events. 172/397 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1608 event pairs, 90 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 787. Up to 205 conditions per place. [2023-08-29 19:55:43,671 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 73 selfloop transitions, 4 changer transitions 1/80 dead transitions. [2023-08-29 19:55:43,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 323 flow [2023-08-29 19:55:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-29 19:55:43,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.422790202342918 [2023-08-29 19:55:43,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-29 19:55:43,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-29 19:55:43,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:43,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-29 19:55:43,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,680 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 103 flow. Second operand 3 states and 397 transitions. [2023-08-29 19:55:43,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 323 flow [2023-08-29 19:55:43,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:43,683 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 130 flow [2023-08-29 19:55:43,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 19:55:43,684 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-08-29 19:55:43,684 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 130 flow [2023-08-29 19:55:43,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:43,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:55:43,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:55:43,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:43,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash 29758463, now seen corresponding path program 1 times [2023-08-29 19:55:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976484151] [2023-08-29 19:55:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:43,821 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:55:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:43,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976484151] [2023-08-29 19:55:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976484151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:43,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360224759] [2023-08-29 19:55:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:43,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:55:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:55:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:55:43,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 313 [2023-08-29 19:55:43,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:43,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:43,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 313 [2023-08-29 19:55:43,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:44,050 INFO L130 PetriNetUnfolder]: 169/410 cut-off events. [2023-08-29 19:55:44,051 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-29 19:55:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 410 events. 169/410 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1785 event pairs, 110 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 948. Up to 238 conditions per place. [2023-08-29 19:55:44,053 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 70 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 19:55:44,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 334 flow [2023-08-29 19:55:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-29 19:55:44,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132055378061768 [2023-08-29 19:55:44,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-29 19:55:44,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-29 19:55:44,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:44,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-29 19:55:44,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,060 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 130 flow. Second operand 3 states and 388 transitions. [2023-08-29 19:55:44,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 334 flow [2023-08-29 19:55:44,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:55:44,063 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 139 flow [2023-08-29 19:55:44,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-29 19:55:44,064 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 19:55:44,064 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 139 flow [2023-08-29 19:55:44,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:44,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:55:44,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:55:44,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:44,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 29758586, now seen corresponding path program 1 times [2023-08-29 19:55:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:44,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564686765] [2023-08-29 19:55:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:44,146 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:55:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564686765] [2023-08-29 19:55:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564686765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017192288] [2023-08-29 19:55:44,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:44,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:55:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:55:44,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:55:44,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-29 19:55:44,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:44,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-29 19:55:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:44,289 INFO L130 PetriNetUnfolder]: 159/397 cut-off events. [2023-08-29 19:55:44,289 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-29 19:55:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 397 events. 159/397 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1742 event pairs, 127 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 895. Up to 370 conditions per place. [2023-08-29 19:55:44,291 INFO L137 encePairwiseOnDemand]: 309/313 looper letters, 44 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-29 19:55:44,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 223 flow [2023-08-29 19:55:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-29 19:55:44,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39403620873269435 [2023-08-29 19:55:44,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-29 19:55:44,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-29 19:55:44,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:44,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-29 19:55:44,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,302 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 139 flow. Second operand 3 states and 370 transitions. [2023-08-29 19:55:44,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 223 flow [2023-08-29 19:55:44,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:44,308 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 132 flow [2023-08-29 19:55:44,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-08-29 19:55:44,310 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:55:44,310 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 132 flow [2023-08-29 19:55:44,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:44,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:55:44,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:55:44,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:44,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 29758464, now seen corresponding path program 1 times [2023-08-29 19:55:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646628565] [2023-08-29 19:55:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:44,444 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:55:44,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646628565] [2023-08-29 19:55:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646628565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785691650] [2023-08-29 19:55:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:44,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:55:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:55:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:55:44,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:55:44,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:44,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:55:44,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:44,577 INFO L130 PetriNetUnfolder]: 155/387 cut-off events. [2023-08-29 19:55:44,578 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 19:55:44,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 387 events. 155/387 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1700 event pairs, 123 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 867. Up to 360 conditions per place. [2023-08-29 19:55:44,580 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-29 19:55:44,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2023-08-29 19:55:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 19:55:44,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40042598509052185 [2023-08-29 19:55:44,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 19:55:44,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 19:55:44,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:44,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 19:55:44,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,587 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 132 flow. Second operand 3 states and 376 transitions. [2023-08-29 19:55:44,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2023-08-29 19:55:44,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:44,590 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 129 flow [2023-08-29 19:55:44,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-29 19:55:44,592 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:55:44,593 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 129 flow [2023-08-29 19:55:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:44,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:55:44,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:55:44,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:44,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 922513359, now seen corresponding path program 1 times [2023-08-29 19:55:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:44,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330446369] [2023-08-29 19:55:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:44,663 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:55:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330446369] [2023-08-29 19:55:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330446369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:44,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224554435] [2023-08-29 19:55:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:44,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:55:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:55:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:55:44,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 313 [2023-08-29 19:55:44,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:44,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 313 [2023-08-29 19:55:44,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:44,855 INFO L130 PetriNetUnfolder]: 143/341 cut-off events. [2023-08-29 19:55:44,856 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 19:55:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 341 events. 143/341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1371 event pairs, 48 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 768. Up to 170 conditions per place. [2023-08-29 19:55:44,857 INFO L137 encePairwiseOnDemand]: 306/313 looper letters, 57 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2023-08-29 19:55:44,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 307 flow [2023-08-29 19:55:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:55:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:55:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-29 19:55:44,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3769968051118211 [2023-08-29 19:55:44,860 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-29 19:55:44,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-29 19:55:44,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:44,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-29 19:55:44,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,864 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,865 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 129 flow. Second operand 4 states and 472 transitions. [2023-08-29 19:55:44,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 307 flow [2023-08-29 19:55:44,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:44,876 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 138 flow [2023-08-29 19:55:44,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-29 19:55:44,879 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 19:55:44,879 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 138 flow [2023-08-29 19:55:44,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:44,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:44,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:55:44,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:44,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1775671262, now seen corresponding path program 1 times [2023-08-29 19:55:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751893260] [2023-08-29 19:55:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:44,915 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:55:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751893260] [2023-08-29 19:55:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751893260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:44,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065306561] [2023-08-29 19:55:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:44,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:44,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:44,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 313 [2023-08-29 19:55:44,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:44,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:44,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 313 [2023-08-29 19:55:44,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:45,001 INFO L130 PetriNetUnfolder]: 140/352 cut-off events. [2023-08-29 19:55:45,002 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-29 19:55:45,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 352 events. 140/352 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1487 event pairs, 46 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 811. Up to 317 conditions per place. [2023-08-29 19:55:45,004 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 19:55:45,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 224 flow [2023-08-29 19:55:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 19:55:45,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40042598509052185 [2023-08-29 19:55:45,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 19:55:45,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 19:55:45,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:45,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 19:55:45,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,009 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 138 flow. Second operand 3 states and 376 transitions. [2023-08-29 19:55:45,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 224 flow [2023-08-29 19:55:45,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 206 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 19:55:45,011 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 122 flow [2023-08-29 19:55:45,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-29 19:55:45,012 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2023-08-29 19:55:45,012 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 122 flow [2023-08-29 19:55:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:45,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:55:45,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:45,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -898009828, now seen corresponding path program 1 times [2023-08-29 19:55:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339196350] [2023-08-29 19:55:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:45,168 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:55:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339196350] [2023-08-29 19:55:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339196350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631489173] [2023-08-29 19:55:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:45,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:55:45,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:45,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:55:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:55:45,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:55:45,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:45,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:55:45,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:45,290 INFO L130 PetriNetUnfolder]: 135/338 cut-off events. [2023-08-29 19:55:45,290 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:55:45,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 338 events. 135/338 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1409 event pairs, 106 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 759. Up to 313 conditions per place. [2023-08-29 19:55:45,292 INFO L137 encePairwiseOnDemand]: 311/313 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 19:55:45,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 196 flow [2023-08-29 19:55:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-29 19:55:45,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39403620873269435 [2023-08-29 19:55:45,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-29 19:55:45,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-29 19:55:45,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:45,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-29 19:55:45,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,297 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 122 flow. Second operand 3 states and 370 transitions. [2023-08-29 19:55:45,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 196 flow [2023-08-29 19:55:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:55:45,299 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 118 flow [2023-08-29 19:55:45,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-29 19:55:45,300 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-08-29 19:55:45,300 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 118 flow [2023-08-29 19:55:45,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:45,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:45,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:55:45,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:45,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2068501142, now seen corresponding path program 1 times [2023-08-29 19:55:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480833671] [2023-08-29 19:55:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:45,426 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:55:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480833671] [2023-08-29 19:55:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480833671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:45,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:55:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385869945] [2023-08-29 19:55:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:45,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:55:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:55:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:55:45,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 313 [2023-08-29 19:55:45,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:45,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 313 [2023-08-29 19:55:45,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:45,631 INFO L130 PetriNetUnfolder]: 123/295 cut-off events. [2023-08-29 19:55:45,631 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2023-08-29 19:55:45,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 295 events. 123/295 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1115 event pairs, 48 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 663. Up to 114 conditions per place. [2023-08-29 19:55:45,633 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 48 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2023-08-29 19:55:45,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 274 flow [2023-08-29 19:55:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:55:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:55:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-08-29 19:55:45,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3865814696485623 [2023-08-29 19:55:45,636 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-08-29 19:55:45,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-08-29 19:55:45,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:45,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-08-29 19:55:45,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,639 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,640 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 118 flow. Second operand 4 states and 484 transitions. [2023-08-29 19:55:45,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 274 flow [2023-08-29 19:55:45,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:45,641 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 153 flow [2023-08-29 19:55:45,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-29 19:55:45,642 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 19:55:45,642 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 153 flow [2023-08-29 19:55:45,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:45,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:45,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:55:45,643 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:45,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 740294123, now seen corresponding path program 1 times [2023-08-29 19:55:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104868504] [2023-08-29 19:55:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:45,684 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:55:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104868504] [2023-08-29 19:55:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104868504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300444631] [2023-08-29 19:55:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:45,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:45,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:55:45,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:45,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:55:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:45,771 INFO L130 PetriNetUnfolder]: 120/292 cut-off events. [2023-08-29 19:55:45,771 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-29 19:55:45,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 292 events. 120/292 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1136 event pairs, 52 based on Foata normal form. 3/201 useless extension candidates. Maximal degree in co-relation 710. Up to 240 conditions per place. [2023-08-29 19:55:45,773 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 40 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2023-08-29 19:55:45,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 251 flow [2023-08-29 19:55:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-29 19:55:45,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993610223642173 [2023-08-29 19:55:45,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-29 19:55:45,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-29 19:55:45,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:45,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-29 19:55:45,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,778 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 153 flow. Second operand 3 states and 375 transitions. [2023-08-29 19:55:45,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 251 flow [2023-08-29 19:55:45,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:55:45,782 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 153 flow [2023-08-29 19:55:45,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-29 19:55:45,783 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:55:45,784 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 153 flow [2023-08-29 19:55:45,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:45,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:45,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:55:45,785 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:45,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 740445031, now seen corresponding path program 1 times [2023-08-29 19:55:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497246236] [2023-08-29 19:55:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:45,882 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:55:45,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:45,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497246236] [2023-08-29 19:55:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497246236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:45,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:55:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658748073] [2023-08-29 19:55:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:45,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:55:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:55:45,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:55:45,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 313 [2023-08-29 19:55:45,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:45,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:45,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 313 [2023-08-29 19:55:45,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:46,070 INFO L130 PetriNetUnfolder]: 126/315 cut-off events. [2023-08-29 19:55:46,070 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2023-08-29 19:55:46,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 315 events. 126/315 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1189 event pairs, 20 based on Foata normal form. 3/218 useless extension candidates. Maximal degree in co-relation 762. Up to 181 conditions per place. [2023-08-29 19:55:46,072 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 58 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-29 19:55:46,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 335 flow [2023-08-29 19:55:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:55:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:55:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2023-08-29 19:55:46,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35942492012779553 [2023-08-29 19:55:46,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2023-08-29 19:55:46,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2023-08-29 19:55:46,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:46,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2023-08-29 19:55:46,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,080 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 153 flow. Second operand 6 states and 675 transitions. [2023-08-29 19:55:46,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 335 flow [2023-08-29 19:55:46,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 331 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 19:55:46,082 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 167 flow [2023-08-29 19:55:46,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-29 19:55:46,083 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-08-29 19:55:46,083 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 167 flow [2023-08-29 19:55:46,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:46,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:46,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:55:46,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:46,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1396868387, now seen corresponding path program 1 times [2023-08-29 19:55:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854210720] [2023-08-29 19:55:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:46,180 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:55:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854210720] [2023-08-29 19:55:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854210720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773788041] [2023-08-29 19:55:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:46,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:46,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 313 [2023-08-29 19:55:46,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:46,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 313 [2023-08-29 19:55:46,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:46,290 INFO L130 PetriNetUnfolder]: 116/284 cut-off events. [2023-08-29 19:55:46,290 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-29 19:55:46,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 284 events. 116/284 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1027 event pairs, 27 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 746. Up to 188 conditions per place. [2023-08-29 19:55:46,292 INFO L137 encePairwiseOnDemand]: 307/313 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-29 19:55:46,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 257 flow [2023-08-29 19:55:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-29 19:55:46,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369542066027689 [2023-08-29 19:55:46,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-29 19:55:46,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-29 19:55:46,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:46,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-29 19:55:46,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,297 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 167 flow. Second operand 3 states and 347 transitions. [2023-08-29 19:55:46,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 257 flow [2023-08-29 19:55:46,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 243 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 19:55:46,299 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 161 flow [2023-08-29 19:55:46,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-29 19:55:46,299 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:55:46,300 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 161 flow [2023-08-29 19:55:46,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:46,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:46,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:55:46,301 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:46,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1396868386, now seen corresponding path program 1 times [2023-08-29 19:55:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757080741] [2023-08-29 19:55:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:46,401 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:55:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757080741] [2023-08-29 19:55:46,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757080741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:46,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:46,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:55:46,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698129608] [2023-08-29 19:55:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:46,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:55:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:55:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:55:46,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-29 19:55:46,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:46,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-29 19:55:46,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:46,501 INFO L130 PetriNetUnfolder]: 106/258 cut-off events. [2023-08-29 19:55:46,501 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-29 19:55:46,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 258 events. 106/258 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 868 event pairs, 27 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 696. Up to 162 conditions per place. [2023-08-29 19:55:46,502 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 32 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-08-29 19:55:46,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 249 flow [2023-08-29 19:55:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:55:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:55:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-29 19:55:46,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38232161874334397 [2023-08-29 19:55:46,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-29 19:55:46,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-29 19:55:46,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:46,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-29 19:55:46,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,508 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 161 flow. Second operand 3 states and 359 transitions. [2023-08-29 19:55:46,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 249 flow [2023-08-29 19:55:46,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:55:46,509 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 157 flow [2023-08-29 19:55:46,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-29 19:55:46,510 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:55:46,510 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 157 flow [2023-08-29 19:55:46,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:46,511 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:55:46,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:55:46,511 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:46,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash -167064850, now seen corresponding path program 1 times [2023-08-29 19:55:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878615176] [2023-08-29 19:55:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:55:46,629 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:55:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:55:46,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878615176] [2023-08-29 19:55:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878615176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:55:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:55:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:55:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989147367] [2023-08-29 19:55:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:55:46,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:55:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:55:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:55:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:55:46,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 313 [2023-08-29 19:55:46,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:55:46,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 313 [2023-08-29 19:55:46,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:55:46,769 INFO L130 PetriNetUnfolder]: 100/240 cut-off events. [2023-08-29 19:55:46,770 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-08-29 19:55:46,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 240 events. 100/240 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 769 event pairs, 21 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 656. Up to 162 conditions per place. [2023-08-29 19:55:46,771 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 30 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2023-08-29 19:55:46,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 245 flow [2023-08-29 19:55:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:55:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:55:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-08-29 19:55:46,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33386581469648563 [2023-08-29 19:55:46,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-08-29 19:55:46,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-08-29 19:55:46,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:55:46,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-08-29 19:55:46,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,777 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 157 flow. Second operand 4 states and 418 transitions. [2023-08-29 19:55:46,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 245 flow [2023-08-29 19:55:46,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:55:46,779 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 157 flow [2023-08-29 19:55:46,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-29 19:55:46,780 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:55:46,780 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 157 flow [2023-08-29 19:55:46,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:55:46,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:55:46,781 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:55:46,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:55:46,781 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err38ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:55:46,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:55:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -167064848, now seen corresponding path program 1 times [2023-08-29 19:55:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:55:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502585821] [2023-08-29 19:55:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:55:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:55:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:55:46,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:55:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:55:46,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:55:46,879 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:55:46,880 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (80 of 81 remaining) [2023-08-29 19:55:46,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2023-08-29 19:55:46,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2023-08-29 19:55:46,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2023-08-29 19:55:46,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2023-08-29 19:55:46,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (75 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2023-08-29 19:55:46,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2023-08-29 19:55:46,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2023-08-29 19:55:46,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (53 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2023-08-29 19:55:46,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2023-08-29 19:55:46,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (41 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2023-08-29 19:55:46,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2023-08-29 19:55:46,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2023-08-29 19:55:46,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (22 of 81 remaining) [2023-08-29 19:55:46,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (21 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2023-08-29 19:55:46,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2023-08-29 19:55:46,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2023-08-29 19:55:46,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2023-08-29 19:55:46,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2023-08-29 19:55:46,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2023-08-29 19:55:46,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (0 of 81 remaining) [2023-08-29 19:55:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:55:46,895 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:55:46,897 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 19:55:46,901 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:55:46,901 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:55:46,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:55:46 BasicIcfg [2023-08-29 19:55:46,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:55:46,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:55:46,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:55:46,941 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:55:46,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:37" (3/4) ... [2023-08-29 19:55:46,944 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:55:46,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:55:46,945 INFO L158 Benchmark]: Toolchain (without parser) took 11202.93ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 51.1MB in the beginning and 122.0MB in the end (delta: -70.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,945 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:55:46,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.03ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 48.8MB in the end (delta: 2.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.84ms. Allocated memory is still 77.6MB. Free memory was 48.8MB in the beginning and 46.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,946 INFO L158 Benchmark]: Boogie Preprocessor took 62.43ms. Allocated memory is still 77.6MB. Free memory was 46.2MB in the beginning and 44.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:55:46,946 INFO L158 Benchmark]: RCFGBuilder took 792.87ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 39.0MB in the end (delta: 5.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,946 INFO L158 Benchmark]: TraceAbstraction took 9726.78ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 38.4MB in the beginning and 123.1MB in the end (delta: -84.6MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,947 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 122.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:55:46,949 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory is still 34.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.03ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 48.8MB in the end (delta: 2.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.84ms. Allocated memory is still 77.6MB. Free memory was 48.8MB in the beginning and 46.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.43ms. Allocated memory is still 77.6MB. Free memory was 46.2MB in the beginning and 44.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 792.87ms. Allocated memory is still 77.6MB. Free memory was 44.5MB in the beginning and 39.0MB in the end (delta: 5.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9726.78ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 38.4MB in the beginning and 123.1MB in the end (delta: -84.6MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 122.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 153 PlacesBefore, 67 PlacesAfterwards, 160 TransitionsBefore, 71 TransitionsAfterwards, 4248 CoEnabledTransitionPairs, 5 FixpointIterations, 22 TrivialSequentialCompositions, 108 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 3 ChoiceCompositions, 153 TotalNumberOfCompositions, 8906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5032, independent: 4729, independent conditional: 0, independent unconditional: 4729, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2143, independent: 2074, independent conditional: 0, independent unconditional: 2074, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5032, independent: 2655, independent conditional: 0, independent unconditional: 2655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 2143, unknown conditional: 0, unknown unconditional: 2143] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 759]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 759. Possible FailurePath: [L714] 0 int memory[(2*320+1)]; [L715] 0 int next_alloc_idx = 1; [L716] 0 int m = 0; [L717] 0 int top; [L769] 0 int m2 = 0; [L770] 0 int state = 0; [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={7:0}, top={4:0}] [L789] COND TRUE 0 1 [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-2, state=0, t={7:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 [L777] RET 1 EBStack_init() [L778] 1 state = 1 [L779] 1 case 1: [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; [L763] 1 int arg = __VERIFIER_nondet_int(); [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() VAL [\old(d)=0, casret={6:0}, d=0, index_malloc()=1, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L743] COND FALSE 1 !(newTop == 0) [L746] EXPR 1 memory[newTop+0] [L746] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 [L748] EXPR 1 \read(top) [L748] 1 oldTop = top [L749] EXPR 1 memory[newTop+1] [L749] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) [L751] COND TRUE 1 casret==1 VAL [\old(d)=0, \read(casret)=1, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L752] 1 return 1; [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top={4:0}] [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4: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: 749]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 746]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 786]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 261 locations, 82 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: 9.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1555 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1794 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 111 mSDtfsCounter, 1794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=11, InterpolantAutomatonStates: 48, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:55:46,988 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-ext/26_stack_cas_longer-1.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 e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f --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:55:48,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:55:48,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:55:48,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:55:48,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:55:48,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:55:48,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:55:48,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:55:48,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:55:48,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:55:48,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:55:48,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:55:48,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:55:48,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:55:48,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:55:48,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:55:48,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:55:48,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:55:48,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:55:48,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:55:48,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:55:48,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:55:48,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:55:48,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:55:48,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:55:48,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:55:48,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:55:48,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:55:48,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:55:48,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:55:48,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:55:48,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:55:48,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:55:48,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:55:48,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:55:48,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:55:48,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:55:48,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:55:48,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:55:48,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:55:48,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:55:48,960 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:55:48,994 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:55:48,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:55:48,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:55:48,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:55:48,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:55:48,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:55:48,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:55:48,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:55:48,998 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:55:48,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:55:48,999 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:55:48,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:55:48,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:55:48,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:55:48,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:55:49,000 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:55:49,000 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:55:49,000 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:55:49,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:55:49,000 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:55:49,001 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 19:55:49,001 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 19:55:49,001 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:55:49,001 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:55:49,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:55:49,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:55:49,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:55:49,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:55:49,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:55:49,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:55:49,002 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 19:55:49,003 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 19:55:49,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:55:49,003 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:55:49,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:55:49,004 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 19:55:49,004 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:55:49,004 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 -> e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f 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:55:49,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:55:49,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:55:49,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:55:49,313 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:55:49,314 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:55:49,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2023-08-29 19:55:50,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:55:50,636 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:55:50,637 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2023-08-29 19:55:50,659 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d59b80c/2629fe797fe94568b4f1c1142c543c51/FLAG22b670644 [2023-08-29 19:55:50,671 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d59b80c/2629fe797fe94568b4f1c1142c543c51 [2023-08-29 19:55:50,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:55:50,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:55:50,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:55:50,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:55:50,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:55:50,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:55:50" (1/1) ... [2023-08-29 19:55:50,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46fbf7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:50, skipping insertion in model container [2023-08-29 19:55:50,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:55:50" (1/1) ... [2023-08-29 19:55:50,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:55:50,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:55:51,051 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-ext/26_stack_cas_longer-1.i[31166,31179] [2023-08-29 19:55:51,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:55:51,077 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:55:51,128 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-ext/26_stack_cas_longer-1.i[31166,31179] [2023-08-29 19:55:51,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:55:51,176 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:55:51,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51 WrapperNode [2023-08-29 19:55:51,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:55:51,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:55:51,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:55:51,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:55:51,184 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:55:51" (1/1) ... [2023-08-29 19:55:51,216 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:55:51" (1/1) ... [2023-08-29 19:55:51,239 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 187 [2023-08-29 19:55:51,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:55:51,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:55:51,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:55:51,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:55:51,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:55:51,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:55:51,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:55:51,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:55:51,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (1/1) ... [2023-08-29 19:55:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:55:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:55:51,358 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:55:51,390 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:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 19:55:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 19:55:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 19:55:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:55:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:55:51,408 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:55:51,602 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:55:51,603 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:55:52,008 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:55:52,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:55:52,222 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 19:55:52,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:52 BoogieIcfgContainer [2023-08-29 19:55:52,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:55:52,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:55:52,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:55:52,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:55:52,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:55:50" (1/3) ... [2023-08-29 19:55:52,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f426e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:55:52, skipping insertion in model container [2023-08-29 19:55:52,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:55:51" (2/3) ... [2023-08-29 19:55:52,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f426e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:55:52, skipping insertion in model container [2023-08-29 19:55:52,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:52" (3/3) ... [2023-08-29 19:55:52,232 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2023-08-29 19:55:52,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:55:52,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-29 19:55:52,248 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:55:52,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:55:52,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,502 INFO L130 PetriNetUnfolder]: 11/173 cut-off events. [2023-08-29 19:55:52,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:52,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 11/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-29 19:55:52,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,523 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:55:52,536 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,540 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:55:52,588 INFO L130 PetriNetUnfolder]: 11/173 cut-off events. [2023-08-29 19:55:52,589 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:55:52,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 11/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-29 19:55:52,596 INFO L119 LiptonReduction]: Number of co-enabled transitions 4140 [2023-08-29 19:56:01,364 INFO L134 LiptonReduction]: Checked pairs total: 8741 [2023-08-29 19:56:01,364 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-29 19:56:01,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:56:01,382 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;@712dac77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:56:01,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2023-08-29 19:56:01,385 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-29 19:56:01,385 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:01,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:01,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:01,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:01,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 30235, now seen corresponding path program 1 times [2023-08-29 19:56:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089036066] [2023-08-29 19:56:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:01,405 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:56:01,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:01,417 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:56:01,451 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:56:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:01,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:56:01,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:01,599 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:56:01,633 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:56:01,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:01,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:01,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089036066] [2023-08-29 19:56:01,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089036066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:01,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:01,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555593231] [2023-08-29 19:56:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:01,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:01,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:01,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 306 [2023-08-29 19:56:01,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:01,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:01,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 306 [2023-08-29 19:56:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:02,056 INFO L130 PetriNetUnfolder]: 239/532 cut-off events. [2023-08-29 19:56:02,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:02,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 532 events. 239/532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2363 event pairs, 122 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 1027. Up to 274 conditions per place. [2023-08-29 19:56:02,061 INFO L137 encePairwiseOnDemand]: 282/306 looper letters, 76 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-08-29 19:56:02,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 329 flow [2023-08-29 19:56:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-29 19:56:02,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651416122004357 [2023-08-29 19:56:02,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-29 19:56:02,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-29 19:56:02,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:02,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-29 19:56:02,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,089 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 147 flow. Second operand 3 states and 427 transitions. [2023-08-29 19:56:02,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 329 flow [2023-08-29 19:56:02,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 329 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:56:02,105 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 133 flow [2023-08-29 19:56:02,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-29 19:56:02,112 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-08-29 19:56:02,113 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 133 flow [2023-08-29 19:56:02,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:02,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:02,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:56:02,325 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:56:02,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:02,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 30233, now seen corresponding path program 1 times [2023-08-29 19:56:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662048886] [2023-08-29 19:56:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:02,327 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:56:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:02,332 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:56:02,334 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:56:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:02,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:56:02,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:02,409 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:56:02,415 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:56:02,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:02,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662048886] [2023-08-29 19:56:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662048886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823915215] [2023-08-29 19:56:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:02,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:02,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:02,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:02,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:02,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:02,635 INFO L130 PetriNetUnfolder]: 172/402 cut-off events. [2023-08-29 19:56:02,636 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2023-08-29 19:56:02,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 402 events. 172/402 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1672 event pairs, 120 based on Foata normal form. 61/319 useless extension candidates. Maximal degree in co-relation 905. Up to 385 conditions per place. [2023-08-29 19:56:02,638 INFO L137 encePairwiseOnDemand]: 304/306 looper letters, 47 selfloop transitions, 1 changer transitions 1/51 dead transitions. [2023-08-29 19:56:02,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 229 flow [2023-08-29 19:56:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-29 19:56:02,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-08-29 19:56:02,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-29 19:56:02,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-29 19:56:02,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:02,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-29 19:56:02,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,646 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 133 flow. Second operand 3 states and 374 transitions. [2023-08-29 19:56:02,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 229 flow [2023-08-29 19:56:02,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:02,649 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 123 flow [2023-08-29 19:56:02,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2023-08-29 19:56:02,650 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2023-08-29 19:56:02,650 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 123 flow [2023-08-29 19:56:02,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:02,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:02,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:02,664 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:56:02,859 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:56:02,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:02,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 29079456, now seen corresponding path program 1 times [2023-08-29 19:56:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502940919] [2023-08-29 19:56:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:02,861 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:56:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:02,864 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:56:02,867 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:56:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:02,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:56:02,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:02,948 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:02,949 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:56:02,978 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:56:02,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:02,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502940919] [2023-08-29 19:56:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502940919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:02,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280387585] [2023-08-29 19:56:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:02,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:03,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:03,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:03,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:03,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:03,277 INFO L130 PetriNetUnfolder]: 169/414 cut-off events. [2023-08-29 19:56:03,278 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-08-29 19:56:03,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 414 events. 169/414 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1814 event pairs, 110 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 921. Up to 238 conditions per place. [2023-08-29 19:56:03,280 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 70 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 19:56:03,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 323 flow [2023-08-29 19:56:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-29 19:56:03,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357298474945534 [2023-08-29 19:56:03,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-29 19:56:03,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-29 19:56:03,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:03,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-29 19:56:03,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,287 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 123 flow. Second operand 3 states and 400 transitions. [2023-08-29 19:56:03,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 323 flow [2023-08-29 19:56:03,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:03,289 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:03,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-29 19:56:03,290 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 19:56:03,290 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:03,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:03,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:03,302 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 (4)] Forceful destruction successful, exit code 0 [2023-08-29 19:56:03,499 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:56:03,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:03,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash 29079457, now seen corresponding path program 1 times [2023-08-29 19:56:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951607704] [2023-08-29 19:56:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:03,501 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:56:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:03,505 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:56:03,507 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:56:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:03,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 19:56:03,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:03,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:03,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:56:03,639 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:56:03,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:03,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951607704] [2023-08-29 19:56:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951607704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863682863] [2023-08-29 19:56:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:03,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:03,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-08-29 19:56:03,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:03,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-08-29 19:56:03,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:03,849 INFO L130 PetriNetUnfolder]: 165/418 cut-off events. [2023-08-29 19:56:03,850 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:56:03,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 418 events. 165/418 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1908 event pairs, 133 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 941. Up to 386 conditions per place. [2023-08-29 19:56:03,852 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 45 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 19:56:03,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 227 flow [2023-08-29 19:56:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-29 19:56:03,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41612200435729846 [2023-08-29 19:56:03,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-29 19:56:03,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-29 19:56:03,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:03,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-29 19:56:03,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,858 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 139 flow. Second operand 3 states and 382 transitions. [2023-08-29 19:56:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 227 flow [2023-08-29 19:56:03,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:03,860 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 134 flow [2023-08-29 19:56:03,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-29 19:56:03,861 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:03,861 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 134 flow [2023-08-29 19:56:03,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:03,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:03,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:03,871 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 (5)] Ended with exit code 0 [2023-08-29 19:56:04,071 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:56:04,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:04,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 29079569, now seen corresponding path program 1 times [2023-08-29 19:56:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883383317] [2023-08-29 19:56:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:04,072 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:56:04,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:04,073 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:56:04,076 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:56:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:04,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:56:04,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:04,172 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:04,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:56:04,212 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:56:04,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:04,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883383317] [2023-08-29 19:56:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883383317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:04,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282254424] [2023-08-29 19:56:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:04,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:04,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 306 [2023-08-29 19:56:04,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:04,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 306 [2023-08-29 19:56:04,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:04,401 INFO L130 PetriNetUnfolder]: 155/389 cut-off events. [2023-08-29 19:56:04,402 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-29 19:56:04,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 389 events. 155/389 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1714 event pairs, 123 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 871. Up to 360 conditions per place. [2023-08-29 19:56:04,404 INFO L137 encePairwiseOnDemand]: 302/306 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-29 19:56:04,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-29 19:56:04,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-08-29 19:56:04,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-29 19:56:04,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-29 19:56:04,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:04,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-29 19:56:04,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,409 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 134 flow. Second operand 3 states and 374 transitions. [2023-08-29 19:56:04,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:04,411 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:04,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-29 19:56:04,412 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:04,412 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:04,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:04,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:56:04,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 19:56:04,621 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:56:04,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:04,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 901463964, now seen corresponding path program 1 times [2023-08-29 19:56:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307839092] [2023-08-29 19:56:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:04,623 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:56:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:04,624 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:56:04,630 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:56:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:56:04,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:04,717 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:04,718 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:56:04,747 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:56:04,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:04,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307839092] [2023-08-29 19:56:04,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307839092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:04,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108165422] [2023-08-29 19:56:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:04,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:04,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:04,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:04,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 306 [2023-08-29 19:56:04,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:04,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:04,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 306 [2023-08-29 19:56:04,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:05,042 INFO L130 PetriNetUnfolder]: 149/360 cut-off events. [2023-08-29 19:56:05,042 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 19:56:05,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 360 events. 149/360 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1496 event pairs, 92 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 810. Up to 222 conditions per place. [2023-08-29 19:56:05,044 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 61 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-29 19:56:05,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 299 flow [2023-08-29 19:56:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-29 19:56:05,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.420479302832244 [2023-08-29 19:56:05,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-29 19:56:05,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-29 19:56:05,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:05,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-29 19:56:05,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,052 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 129 flow. Second operand 3 states and 386 transitions. [2023-08-29 19:56:05,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 299 flow [2023-08-29 19:56:05,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:05,054 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 139 flow [2023-08-29 19:56:05,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-29 19:56:05,055 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:56:05,055 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 139 flow [2023-08-29 19:56:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:05,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:05,067 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:56:05,264 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:56:05,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:05,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1273083600, now seen corresponding path program 1 times [2023-08-29 19:56:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079997455] [2023-08-29 19:56:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:05,266 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:56:05,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:05,267 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:56:05,270 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:56:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:05,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 19:56:05,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:05,354 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:56:05,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:05,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079997455] [2023-08-29 19:56:05,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079997455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:05,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:05,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849845530] [2023-08-29 19:56:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:05,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:05,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 306 [2023-08-29 19:56:05,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:05,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 306 [2023-08-29 19:56:05,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:05,504 INFO L130 PetriNetUnfolder]: 146/369 cut-off events. [2023-08-29 19:56:05,505 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-29 19:56:05,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 369 events. 146/369 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1620 event pairs, 50 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 850. Up to 333 conditions per place. [2023-08-29 19:56:05,507 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 19:56:05,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 229 flow [2023-08-29 19:56:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-29 19:56:05,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40522875816993464 [2023-08-29 19:56:05,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-29 19:56:05,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-29 19:56:05,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:05,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-29 19:56:05,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,513 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 139 flow. Second operand 3 states and 372 transitions. [2023-08-29 19:56:05,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 229 flow [2023-08-29 19:56:05,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:05,514 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2023-08-29 19:56:05,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-08-29 19:56:05,515 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:56:05,515 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2023-08-29 19:56:05,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:05,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:05,529 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:56:05,725 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:56:05,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:05,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash -915458820, now seen corresponding path program 1 times [2023-08-29 19:56:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:05,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382604058] [2023-08-29 19:56:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:05,726 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:56:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:05,727 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:56:05,728 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:56:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:05,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 19:56:05,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:56:05,839 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:56:05,902 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:05,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 19:56:05,916 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:56:05,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:05,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382604058] [2023-08-29 19:56:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382604058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531377648] [2023-08-29 19:56:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:05,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:05,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-08-29 19:56:05,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:05,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:05,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-08-29 19:56:05,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:06,091 INFO L130 PetriNetUnfolder]: 141/355 cut-off events. [2023-08-29 19:56:06,092 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 19:56:06,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 355 events. 141/355 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1514 event pairs, 112 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 816. Up to 329 conditions per place. [2023-08-29 19:56:06,093 INFO L137 encePairwiseOnDemand]: 304/306 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-29 19:56:06,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 213 flow [2023-08-29 19:56:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-29 19:56:06,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2023-08-29 19:56:06,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-29 19:56:06,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-29 19:56:06,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:06,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-29 19:56:06,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,099 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 375 transitions. [2023-08-29 19:56:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 213 flow [2023-08-29 19:56:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:06,101 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 131 flow [2023-08-29 19:56:06,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-29 19:56:06,102 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:06,102 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 131 flow [2023-08-29 19:56:06,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:06,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:06,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:56:06,312 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:56:06,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:06,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1685547449, now seen corresponding path program 1 times [2023-08-29 19:56:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:06,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614232718] [2023-08-29 19:56:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:56:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:06,314 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:56:06,317 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:56:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:06,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 19:56:06,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:06,426 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:56:06,427 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:56:06,471 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:06,471 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:56:06,483 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:56:06,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:06,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:06,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614232718] [2023-08-29 19:56:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614232718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:06,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052833277] [2023-08-29 19:56:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:06,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:06,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:06,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:06,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:06,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:06,732 INFO L130 PetriNetUnfolder]: 135/328 cut-off events. [2023-08-29 19:56:06,732 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 19:56:06,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 328 events. 135/328 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1339 event pairs, 82 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 756. Up to 214 conditions per place. [2023-08-29 19:56:06,734 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 55 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:56:06,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 283 flow [2023-08-29 19:56:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-29 19:56:06,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.420479302832244 [2023-08-29 19:56:06,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-29 19:56:06,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-29 19:56:06,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:06,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-29 19:56:06,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,740 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 131 flow. Second operand 3 states and 386 transitions. [2023-08-29 19:56:06,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 283 flow [2023-08-29 19:56:06,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:06,741 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 145 flow [2023-08-29 19:56:06,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-29 19:56:06,742 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:06,742 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 145 flow [2023-08-29 19:56:06,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:06,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:06,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:06,756 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:56:06,952 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:56:06,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:06,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 608605728, now seen corresponding path program 1 times [2023-08-29 19:56:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868394888] [2023-08-29 19:56:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:06,953 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:56:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:06,954 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:56:06,957 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:56:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:56:07,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:07,072 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:56:07,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:07,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868394888] [2023-08-29 19:56:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868394888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:56:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555295734] [2023-08-29 19:56:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:07,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:56:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:56:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:56:07,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 306 [2023-08-29 19:56:07,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:07,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 306 [2023-08-29 19:56:07,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:07,382 INFO L130 PetriNetUnfolder]: 142/358 cut-off events. [2023-08-29 19:56:07,383 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-29 19:56:07,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 358 events. 142/358 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1451 event pairs, 24 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 837. Up to 213 conditions per place. [2023-08-29 19:56:07,385 INFO L137 encePairwiseOnDemand]: 298/306 looper letters, 62 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2023-08-29 19:56:07,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 339 flow [2023-08-29 19:56:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:56:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:56:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-08-29 19:56:07,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37363834422657954 [2023-08-29 19:56:07,388 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-08-29 19:56:07,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-08-29 19:56:07,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:07,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-08-29 19:56:07,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,393 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 145 flow. Second operand 6 states and 686 transitions. [2023-08-29 19:56:07,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 339 flow [2023-08-29 19:56:07,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:07,395 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 169 flow [2023-08-29 19:56:07,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-29 19:56:07,396 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-08-29 19:56:07,396 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 169 flow [2023-08-29 19:56:07,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:07,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:07,411 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:56:07,606 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:56:07,606 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err25ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:07,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1686909463, now seen corresponding path program 1 times [2023-08-29 19:56:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030324226] [2023-08-29 19:56:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:07,607 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:56:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:07,608 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:56:07,609 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:56:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:07,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:56:07,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:07,726 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:56:07,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:07,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030324226] [2023-08-29 19:56:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030324226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:56:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121974887] [2023-08-29 19:56:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:07,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:56:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:56:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:56:07,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 306 [2023-08-29 19:56:07,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:07,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:07,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 306 [2023-08-29 19:56:07,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:08,089 INFO L130 PetriNetUnfolder]: 140/353 cut-off events. [2023-08-29 19:56:08,089 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-29 19:56:08,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 353 events. 140/353 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1440 event pairs, 22 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 884. Up to 213 conditions per place. [2023-08-29 19:56:08,092 INFO L137 encePairwiseOnDemand]: 299/306 looper letters, 63 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2023-08-29 19:56:08,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 379 flow [2023-08-29 19:56:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:56:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:56:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2023-08-29 19:56:08,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3520074696545285 [2023-08-29 19:56:08,101 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 754 transitions. [2023-08-29 19:56:08,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 754 transitions. [2023-08-29 19:56:08,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:08,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 754 transitions. [2023-08-29 19:56:08,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,107 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,107 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 169 flow. Second operand 7 states and 754 transitions. [2023-08-29 19:56:08,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 379 flow [2023-08-29 19:56:08,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:08,109 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 187 flow [2023-08-29 19:56:08,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-08-29 19:56:08,110 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -6 predicate places. [2023-08-29 19:56:08,110 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 187 flow [2023-08-29 19:56:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:08,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:08,123 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:56:08,322 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:56:08,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:08,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 754586524, now seen corresponding path program 1 times [2023-08-29 19:56:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:08,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263624214] [2023-08-29 19:56:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:08,324 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:56:08,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:08,325 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:56:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 19:56:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:08,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:56:08,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:08,438 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:56:08,450 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:56:08,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:08,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263624214] [2023-08-29 19:56:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263624214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:08,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347560302] [2023-08-29 19:56:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:08,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 306 [2023-08-29 19:56:08,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:08,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 306 [2023-08-29 19:56:08,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:08,641 INFO L130 PetriNetUnfolder]: 130/322 cut-off events. [2023-08-29 19:56:08,641 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:56:08,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 322 events. 130/322 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1302 event pairs, 27 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 856. Up to 225 conditions per place. [2023-08-29 19:56:08,644 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 39 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-29 19:56:08,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 287 flow [2023-08-29 19:56:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-29 19:56:08,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758169934640523 [2023-08-29 19:56:08,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-29 19:56:08,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-29 19:56:08,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:08,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-29 19:56:08,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,649 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 187 flow. Second operand 3 states and 345 transitions. [2023-08-29 19:56:08,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 287 flow [2023-08-29 19:56:08,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:56:08,651 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 185 flow [2023-08-29 19:56:08,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-29 19:56:08,652 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-08-29 19:56:08,652 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 185 flow [2023-08-29 19:56:08,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:08,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:08,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:08,668 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:56:08,868 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:56:08,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:08,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash 754586525, now seen corresponding path program 1 times [2023-08-29 19:56:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281451794] [2023-08-29 19:56:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:08,870 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:56:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:08,871 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:56:08,874 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:56:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:56:08,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:09,000 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:56:09,029 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:56:09,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:09,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281451794] [2023-08-29 19:56:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281451794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769861043] [2023-08-29 19:56:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:09,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:09,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 306 [2023-08-29 19:56:09,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:09,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:09,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 306 [2023-08-29 19:56:09,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:09,202 INFO L130 PetriNetUnfolder]: 120/296 cut-off events. [2023-08-29 19:56:09,202 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 19:56:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 296 events. 120/296 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 27 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 810. Up to 199 conditions per place. [2023-08-29 19:56:09,204 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 37 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-29 19:56:09,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 283 flow [2023-08-29 19:56:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-29 19:56:09,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2023-08-29 19:56:09,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-29 19:56:09,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-29 19:56:09,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:09,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-29 19:56:09,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:09,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:09,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:09,210 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 185 flow. Second operand 3 states and 357 transitions. [2023-08-29 19:56:09,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 283 flow [2023-08-29 19:56:09,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:09,212 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 181 flow [2023-08-29 19:56:09,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 19:56:09,212 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2023-08-29 19:56:09,212 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 181 flow [2023-08-29 19:56:09,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:09,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:09,213 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:56:09,231 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:56:09,422 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:56:09,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err38ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:09,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 29209707, now seen corresponding path program 1 times [2023-08-29 19:56:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806332792] [2023-08-29 19:56:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:09,423 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:56:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:09,424 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:56:09,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 (15)] Waiting until timeout for monitored process [2023-08-29 19:56:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:09,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:56:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:09,672 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 19:56:09,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:56:09,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (80 of 81 remaining) [2023-08-29 19:56:09,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2023-08-29 19:56:09,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2023-08-29 19:56:09,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2023-08-29 19:56:09,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2023-08-29 19:56:09,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (75 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2023-08-29 19:56:09,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2023-08-29 19:56:09,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2023-08-29 19:56:09,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (53 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2023-08-29 19:56:09,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (41 of 81 remaining) [2023-08-29 19:56:09,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2023-08-29 19:56:09,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2023-08-29 19:56:09,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (22 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (21 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2023-08-29 19:56:09,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2023-08-29 19:56:09,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2023-08-29 19:56:09,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2023-08-29 19:56:09,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2023-08-29 19:56:09,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2023-08-29 19:56:09,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2023-08-29 19:56:09,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2023-08-29 19:56:09,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (0 of 81 remaining) [2023-08-29 19:56:09,700 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:56:09,897 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:56:09,898 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:09,900 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 19:56:09,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:56:09,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:56:09,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:56:09 BasicIcfg [2023-08-29 19:56:09,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:56:09,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:56:09,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:56:09,969 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:56:09,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:55:52" (3/4) ... [2023-08-29 19:56:09,972 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:56:09,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:56:09,972 INFO L158 Benchmark]: Toolchain (without parser) took 19298.03ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 41.3MB in the beginning and 87.5MB in the end (delta: -46.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,973 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:09,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.03ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 35.1MB in the end (delta: 5.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.99ms. Allocated memory is still 69.2MB. Free memory was 35.1MB in the beginning and 32.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,974 INFO L158 Benchmark]: Boogie Preprocessor took 58.10ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,974 INFO L158 Benchmark]: RCFGBuilder took 921.97ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 30.2MB in the beginning and 45.1MB in the end (delta: -14.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,974 INFO L158 Benchmark]: TraceAbstraction took 17742.12ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 44.5MB in the beginning and 87.5MB in the end (delta: -43.0MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2023-08-29 19:56:09,974 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 121.6MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:09,976 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.18ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.03ms. Allocated memory is still 69.2MB. Free memory was 41.0MB in the beginning and 35.1MB in the end (delta: 5.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.99ms. Allocated memory is still 69.2MB. Free memory was 35.1MB in the beginning and 32.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.10ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 921.97ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 30.2MB in the beginning and 45.1MB in the end (delta: -14.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17742.12ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 44.5MB in the beginning and 87.5MB in the end (delta: -43.0MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 121.6MB. Free memory is still 87.5MB. 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: 8.8s, 151 PlacesBefore, 67 PlacesAfterwards, 158 TransitionsBefore, 71 TransitionsAfterwards, 4140 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 104 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 148 TotalNumberOfCompositions, 8741 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4949, independent: 4645, independent conditional: 0, independent unconditional: 4645, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2074, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4949, independent: 2638, independent conditional: 0, independent unconditional: 2638, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 228, Positive conditional cache size: 0, Positive unconditional cache size: 228, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 759]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 759. Possible FailurePath: [L714] 0 int memory[(2*320+1)]; [L715] 0 int next_alloc_idx = 1; [L716] 0 int m = 0; [L717] 0 int top; [L769] 0 int m2 = 0; [L770] 0 int state = 0; [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={15:0}, top={4:0}] [L789] COND TRUE 0 1 [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-1, state=0, t={15:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 [L777] RET 1 EBStack_init() [L778] 1 state = 1 [L779] 1 case 1: [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; [L763] 1 int arg = __VERIFIER_nondet_int(); [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() [L743] COND FALSE 1 !(newTop == 0) [L746] EXPR 1 memory[newTop+0] [L746] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 [L748] EXPR 1 \read(top) [L748] 1 oldTop = top [L749] EXPR 1 memory[newTop+1] [L749] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) [L751] COND TRUE 1 casret==1 VAL [\old(d)=0, \read(casret)=1, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L752] 1 return 1; [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4: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: 749]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 746]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 786]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 256 locations, 82 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: 17.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1517 IncrementalHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 126 mSDtfsCounter, 1517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=11, InterpolantAutomatonStates: 46, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1276 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:56:10,008 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