./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s2.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/bigshot_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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:29:15,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:29:15,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:29:15,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:29:15,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:29:15,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:29:15,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:29:15,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:29:15,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:29:15,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:29:15,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:29:15,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:29:15,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:29:15,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:29:15,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:29:15,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:29:15,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:29:15,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:29:15,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:29:15,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:29:15,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:29:15,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:29:15,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:29:15,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:29:15,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:29:15,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:29:15,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:29:15,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:29:15,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:29:15,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:29:15,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:29:15,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:29:15,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:29:15,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:29:15,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:29:15,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:29:15,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:29:15,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:29:15,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:29:15,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:29:15,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:29:15,342 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:29:15,371 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:29:15,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:29:15,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:29:15,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:29:15,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:29:15,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:29:15,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:29:15,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:29:15,374 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:29:15,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:29:15,375 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:29:15,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:29:15,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:29:15,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:29:15,376 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:29:15,377 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:29:15,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:29:15,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:29:15,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:29:15,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:15,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:29:15,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:29:15,379 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:29:15,379 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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:29:15,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:29:15,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:29:15,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:29:15,628 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:29:15,628 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:29:15,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-29 19:29:16,731 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:29:16,900 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:29:16,901 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-29 19:29:16,911 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d174909/320f191b1346478bb1377049c86054a7/FLAG353e4bd85 [2023-08-29 19:29:16,922 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d174909/320f191b1346478bb1377049c86054a7 [2023-08-29 19:29:16,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:29:16,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:29:16,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:16,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:29:16,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:29:16,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:16" (1/1) ... [2023-08-29 19:29:16,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402640fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:16, skipping insertion in model container [2023-08-29 19:29:16,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:29:16" (1/1) ... [2023-08-29 19:29:16,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:29:16,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:29:17,281 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-29 19:29:17,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:17,304 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:29:17,336 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-29 19:29:17,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:29:17,410 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:29:17,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17 WrapperNode [2023-08-29 19:29:17,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:29:17,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:17,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:29:17,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:29:17,416 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:29:17" (1/1) ... [2023-08-29 19:29:17,427 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:29:17" (1/1) ... [2023-08-29 19:29:17,443 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-08-29 19:29:17,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:29:17,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:29:17,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:29:17,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:29:17,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:29:17,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:29:17,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:29:17,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:29:17,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (1/1) ... [2023-08-29 19:29:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:29:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:17,481 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:29:17,500 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:29:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 19:29:17,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 19:29:17,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:29:17,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 19:29:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:29:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:29:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:29:17,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:29:17,508 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:29:17,626 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:29:17,628 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:29:17,889 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:29:17,906 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:29:17,907 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-29 19:29:17,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:17 BoogieIcfgContainer [2023-08-29 19:29:17,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:29:17,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:29:17,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:29:17,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:29:17,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:29:16" (1/3) ... [2023-08-29 19:29:17,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a296e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:17, skipping insertion in model container [2023-08-29 19:29:17,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:29:17" (2/3) ... [2023-08-29 19:29:17,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a296e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:29:17, skipping insertion in model container [2023-08-29 19:29:17,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:17" (3/3) ... [2023-08-29 19:29:17,917 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-29 19:29:17,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:29:17,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-29 19:29:17,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:29:18,003 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 19:29:18,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 228 flow [2023-08-29 19:29:18,080 INFO L130 PetriNetUnfolder]: 4/104 cut-off events. [2023-08-29 19:29:18,080 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 104 events. 4/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-29 19:29:18,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 106 transitions, 228 flow [2023-08-29 19:29:18,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 212 flow [2023-08-29 19:29:18,101 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:29:18,108 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-29 19:29:18,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-29 19:29:18,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 100 transitions, 212 flow [2023-08-29 19:29:18,128 INFO L130 PetriNetUnfolder]: 4/100 cut-off events. [2023-08-29 19:29:18,128 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:18,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 4/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-29 19:29:18,129 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-29 19:29:20,897 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-29 19:29:20,897 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-29 19:29:20,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:29:20,909 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;@55c03d52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:29:20,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-29 19:29:20,910 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:29:20,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:20,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:20,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:29:20,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:20,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash 409, now seen corresponding path program 1 times [2023-08-29 19:29:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:20,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885530297] [2023-08-29 19:29:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:21,019 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:29:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885530297] [2023-08-29 19:29:21,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885530297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:21,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:29:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672182113] [2023-08-29 19:29:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:21,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:29:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:29:21,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:29:21,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-08-29 19:29:21,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:21,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-08-29 19:29:21,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:21,132 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-29 19:29:21,133 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:29:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 209 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-29 19:29:21,134 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-29 19:29:21,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-29 19:29:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:29:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:29:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2023-08-29 19:29:21,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158371040723982 [2023-08-29 19:29:21,145 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 228 transitions. [2023-08-29 19:29:21,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 228 transitions. [2023-08-29 19:29:21,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:21,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 228 transitions. [2023-08-29 19:29:21,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 114.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,156 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,157 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 228 transitions. [2023-08-29 19:29:21,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-29 19:29:21,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:29:21,161 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-29 19:29:21,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-29 19:29:21,165 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-29 19:29:21,165 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-29 19:29:21,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:21,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:29:21,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:29:21,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:21,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash 402564, now seen corresponding path program 1 times [2023-08-29 19:29:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:21,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490896912] [2023-08-29 19:29:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:21,369 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:29:21,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490896912] [2023-08-29 19:29:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490896912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:21,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:21,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508466052] [2023-08-29 19:29:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:21,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:21,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:21,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-29 19:29:21,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:21,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-29 19:29:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:21,479 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-29 19:29:21,480 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:21,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 200 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-29 19:29:21,481 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-29 19:29:21,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-29 19:29:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-29 19:29:21,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464555052790347 [2023-08-29 19:29:21,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-29 19:29:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-29 19:29:21,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:21,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-29 19:29:21,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,490 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-08-29 19:29:21,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-29 19:29:21,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:29:21,491 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-29 19:29:21,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-29 19:29:21,491 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:29:21,492 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-29 19:29:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:21,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:29:21,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:29:21,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:21,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 402565, now seen corresponding path program 1 times [2023-08-29 19:29:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110629187] [2023-08-29 19:29:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:21,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:29:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110629187] [2023-08-29 19:29:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110629187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:21,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610936234] [2023-08-29 19:29:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:21,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:21,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-29 19:29:21,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:21,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-29 19:29:21,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:21,738 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-29 19:29:21,739 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 195 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-29 19:29:21,740 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-29 19:29:21,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-29 19:29:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-29 19:29:21,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-29 19:29:21,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-29 19:29:21,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-29 19:29:21,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:21,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-29 19:29:21,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,756 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 306 transitions. [2023-08-29 19:29:21,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-29 19:29:21,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:21,758 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-29 19:29:21,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-29 19:29:21,759 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-29 19:29:21,761 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-29 19:29:21,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:21,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:29:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:29:21,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:21,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 12480382, now seen corresponding path program 1 times [2023-08-29 19:29:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:21,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147398086] [2023-08-29 19:29:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:21,857 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:29:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147398086] [2023-08-29 19:29:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147398086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:21,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478844906] [2023-08-29 19:29:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:21,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:21,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-29 19:29:21,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 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:29:21,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:21,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-29 19:29:21,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:21,938 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-29 19:29:21,938 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 19:29:21,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 193 event pairs, 16 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 61 conditions per place. [2023-08-29 19:29:21,938 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-29 19:29:21,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 108 flow [2023-08-29 19:29:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-29 19:29:21,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45852187028657615 [2023-08-29 19:29:21,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-29 19:29:21,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-29 19:29:21,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:21,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-29 19:29:21,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:21,942 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 3 states and 304 transitions. [2023-08-29 19:29:21,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 108 flow [2023-08-29 19:29:21,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:29:21,943 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2023-08-29 19:29:21,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-29 19:29:21,944 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-29 19:29:21,944 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2023-08-29 19:29:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 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:29:21,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:21,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:29:21,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:29:21,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:21,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash -891795905, now seen corresponding path program 1 times [2023-08-29 19:29:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:21,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259154056] [2023-08-29 19:29:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:21,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:21,984 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:29:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259154056] [2023-08-29 19:29:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259154056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:29:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654470382] [2023-08-29 19:29:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:21,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:21,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:22,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-29 19:29:22,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:22,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-29 19:29:22,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:22,057 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-29 19:29:22,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:22,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 51 events. 17/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 128 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 103. Up to 47 conditions per place. [2023-08-29 19:29:22,058 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-29 19:29:22,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2023-08-29 19:29:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-29 19:29:22,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434389140271493 [2023-08-29 19:29:22,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-29 19:29:22,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-29 19:29:22,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:22,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-29 19:29:22,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,061 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 294 transitions. [2023-08-29 19:29:22,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2023-08-29 19:29:22,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:22,062 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-29 19:29:22,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-29 19:29:22,063 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-29 19:29:22,063 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-29 19:29:22,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:22,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:29:22,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:29:22,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:22,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash -891795903, now seen corresponding path program 1 times [2023-08-29 19:29:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999210347] [2023-08-29 19:29:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:22,122 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:29:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999210347] [2023-08-29 19:29:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999210347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:29:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849812065] [2023-08-29 19:29:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:22,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:22,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-29 19:29:22,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:22,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-29 19:29:22,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:22,205 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-29 19:29:22,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:22,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 71 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-29 19:29:22,206 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-29 19:29:22,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-29 19:29:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-29 19:29:22,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42684766214177977 [2023-08-29 19:29:22,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-29 19:29:22,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-29 19:29:22,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:22,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-29 19:29:22,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,210 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 283 transitions. [2023-08-29 19:29:22,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-29 19:29:22,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:22,210 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-29 19:29:22,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-29 19:29:22,211 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-29 19:29:22,211 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-29 19:29:22,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:22,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:22,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:29:22,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:22,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181263, now seen corresponding path program 1 times [2023-08-29 19:29:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778991582] [2023-08-29 19:29:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778991582] [2023-08-29 19:29:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778991582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:22,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:29:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048858052] [2023-08-29 19:29:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:22,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:29:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:29:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:29:22,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 221 [2023-08-29 19:29:22,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:22,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 221 [2023-08-29 19:29:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:22,549 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-29 19:29:22,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:29:22,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 79 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-29 19:29:22,549 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-29 19:29:22,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-29 19:29:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-08-29 19:29:22,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3834841628959276 [2023-08-29 19:29:22,550 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-08-29 19:29:22,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-08-29 19:29:22,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:22,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-08-29 19:29:22,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,553 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,553 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 339 transitions. [2023-08-29 19:29:22,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-29 19:29:22,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:29:22,564 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-29 19:29:22,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-29 19:29:22,565 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-29 19:29:22,565 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-29 19:29:22,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:22,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:29:22,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:22,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:22,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181298, now seen corresponding path program 1 times [2023-08-29 19:29:22,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710672681] [2023-08-29 19:29:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:22,725 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:29:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710672681] [2023-08-29 19:29:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710672681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:29:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919391559] [2023-08-29 19:29:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:22,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 19:29:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 19:29:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 19:29:22,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-08-29 19:29:22,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:22,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:22,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-08-29 19:29:22,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:23,005 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2023-08-29 19:29:23,006 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 19:29:23,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 57 events. 14/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 173 event pairs, 7 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 38 conditions per place. [2023-08-29 19:29:23,006 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-08-29 19:29:23,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 139 flow [2023-08-29 19:29:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-08-29 19:29:23,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39894419306184015 [2023-08-29 19:29:23,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-08-29 19:29:23,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-08-29 19:29:23,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:23,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-08-29 19:29:23,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,010 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 6 states and 529 transitions. [2023-08-29 19:29:23,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 139 flow [2023-08-29 19:29:23,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:23,011 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2023-08-29 19:29:23,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-08-29 19:29:23,012 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:29:23,012 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2023-08-29 19:29:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:23,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:23,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:29:23,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:23,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181353, now seen corresponding path program 1 times [2023-08-29 19:29:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876171147] [2023-08-29 19:29:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:23,068 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:29:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876171147] [2023-08-29 19:29:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876171147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:29:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073381426] [2023-08-29 19:29:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:23,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:23,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-29 19:29:23,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:23,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-29 19:29:23,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:23,163 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2023-08-29 19:29:23,163 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 19:29:23,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 48 events. 12/48 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 116. Up to 29 conditions per place. [2023-08-29 19:29:23,164 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-29 19:29:23,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 134 flow [2023-08-29 19:29:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-29 19:29:23,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-29 19:29:23,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:23,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,168 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,168 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 4 states and 387 transitions. [2023-08-29 19:29:23,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 134 flow [2023-08-29 19:29:23,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:23,169 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 80 flow [2023-08-29 19:29:23,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-29 19:29:23,169 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:29:23,170 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 80 flow [2023-08-29 19:29:23,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:23,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:23,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:29:23,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:23,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181352, now seen corresponding path program 1 times [2023-08-29 19:29:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998182354] [2023-08-29 19:29:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:23,221 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:29:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998182354] [2023-08-29 19:29:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998182354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:23,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:23,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:29:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588649181] [2023-08-29 19:29:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:29:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:29:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:29:23,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-29 19:29:23,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:23,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-29 19:29:23,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:23,337 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-29 19:29:23,337 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 19:29:23,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 42 events. 11/42 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 111. Up to 30 conditions per place. [2023-08-29 19:29:23,337 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-29 19:29:23,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 139 flow [2023-08-29 19:29:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:29:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:29:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-29 19:29:23,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-29 19:29:23,339 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:23,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-29 19:29:23,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,341 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 80 flow. Second operand 4 states and 387 transitions. [2023-08-29 19:29:23,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 139 flow [2023-08-29 19:29:23,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:29:23,342 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2023-08-29 19:29:23,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-29 19:29:23,343 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:29:23,343 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2023-08-29 19:29:23,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:23,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:23,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:29:23,344 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:23,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2101885032, now seen corresponding path program 1 times [2023-08-29 19:29:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:23,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569274865] [2023-08-29 19:29:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569274865] [2023-08-29 19:29:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569274865] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515296844] [2023-08-29 19:29:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:23,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:23,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:23,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-29 19:29:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:23,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-29 19:29:23,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:23,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:23,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:23,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:23,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:29:23,711 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:29:23,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:29:23,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:23,783 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:29:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:23,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515296844] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:23,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-08-29 19:29:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635430954] [2023-08-29 19:29:23,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:23,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-29 19:29:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:23,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-29 19:29:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-08-29 19:29:24,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 221 [2023-08-29 19:29:24,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:24,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:24,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 221 [2023-08-29 19:29:24,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:24,960 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2023-08-29 19:29:24,960 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-29 19:29:24,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 85 events. 24/85 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 278 event pairs, 4 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 220. Up to 23 conditions per place. [2023-08-29 19:29:24,961 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 36 selfloop transitions, 15 changer transitions 0/51 dead transitions. [2023-08-29 19:29:24,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 272 flow [2023-08-29 19:29:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 19:29:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 19:29:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1189 transitions. [2023-08-29 19:29:24,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842921784098255 [2023-08-29 19:29:24,963 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1189 transitions. [2023-08-29 19:29:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1189 transitions. [2023-08-29 19:29:24,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:24,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1189 transitions. [2023-08-29 19:29:24,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.92857142857143) internal successors, (1189), 14 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:24,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:24,968 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:24,968 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 14 states and 1189 transitions. [2023-08-29 19:29:24,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 272 flow [2023-08-29 19:29:24,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:29:24,971 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 173 flow [2023-08-29 19:29:24,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=173, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 19:29:24,971 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-29 19:29:24,971 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 173 flow [2023-08-29 19:29:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:24,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:24,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:24,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-29 19:29:25,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-29 19:29:25,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:25,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1172842328, now seen corresponding path program 1 times [2023-08-29 19:29:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999138615] [2023-08-29 19:29:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999138615] [2023-08-29 19:29:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999138615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496219196] [2023-08-29 19:29:25,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:25,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:25,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:25,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-29 19:29:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:25,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 19:29:25,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:25,358 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:29:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:25,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496219196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:25,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-29 19:29:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284765408] [2023-08-29 19:29:25,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:25,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 19:29:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 19:29:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-29 19:29:25,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-29 19:29:25,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 173 flow. Second operand has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:25,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:25,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-29 19:29:25,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:25,836 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-29 19:29:25,836 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-29 19:29:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 76 events. 21/76 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 201 event pairs, 5 based on Foata normal form. 6/82 useless extension candidates. Maximal degree in co-relation 254. Up to 29 conditions per place. [2023-08-29 19:29:25,837 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 38 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2023-08-29 19:29:25,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 311 flow [2023-08-29 19:29:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:29:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:29:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-08-29 19:29:25,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4227537168713639 [2023-08-29 19:29:25,839 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-08-29 19:29:25,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-08-29 19:29:25,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:25,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-08-29 19:29:25,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:25,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:25,842 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:25,842 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 173 flow. Second operand 7 states and 654 transitions. [2023-08-29 19:29:25,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 311 flow [2023-08-29 19:29:25,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 283 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 19:29:25,844 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 186 flow [2023-08-29 19:29:25,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-08-29 19:29:25,846 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-29 19:29:25,846 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 186 flow [2023-08-29 19:29:25,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:25,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:25,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:25,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 19:29:26,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-29 19:29:26,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:26,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 733306717, now seen corresponding path program 1 times [2023-08-29 19:29:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227990133] [2023-08-29 19:29:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:26,071 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:29:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227990133] [2023-08-29 19:29:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227990133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:26,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:26,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:29:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971107980] [2023-08-29 19:29:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:26,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:29:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:29:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:29:26,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-29 19:29:26,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:26,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-29 19:29:26,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:26,105 INFO L130 PetriNetUnfolder]: 20/70 cut-off events. [2023-08-29 19:29:26,105 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-29 19:29:26,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 70 events. 20/70 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 13 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 264. Up to 67 conditions per place. [2023-08-29 19:29:26,106 INFO L137 encePairwiseOnDemand]: 219/221 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-29 19:29:26,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 29 transitions, 237 flow [2023-08-29 19:29:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:29:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:29:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-29 19:29:26,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-29 19:29:26,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-29 19:29:26,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-29 19:29:26,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:26,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-29 19:29:26,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,109 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 186 flow. Second operand 3 states and 306 transitions. [2023-08-29 19:29:26,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 29 transitions, 237 flow [2023-08-29 19:29:26,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 29 transitions, 224 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-29 19:29:26,111 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 166 flow [2023-08-29 19:29:26,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-29 19:29:26,111 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-08-29 19:29:26,111 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 166 flow [2023-08-29 19:29:26,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:26,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:29:26,112 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:26,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283604, now seen corresponding path program 1 times [2023-08-29 19:29:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320081122] [2023-08-29 19:29:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:26,208 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:29:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320081122] [2023-08-29 19:29:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320081122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:29:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953641280] [2023-08-29 19:29:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:26,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:29:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:29:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:29:26,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-29 19:29:26,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:26,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-29 19:29:26,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:26,327 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-08-29 19:29:26,327 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-29 19:29:26,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 69 events. 20/69 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 179 event pairs, 12 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 247. Up to 61 conditions per place. [2023-08-29 19:29:26,329 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-08-29 19:29:26,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 239 flow [2023-08-29 19:29:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:29:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:29:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-08-29 19:29:26,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432579185520362 [2023-08-29 19:29:26,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-08-29 19:29:26,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-08-29 19:29:26,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:26,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-08-29 19:29:26,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,333 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 166 flow. Second operand 5 states and 478 transitions. [2023-08-29 19:29:26,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 239 flow [2023-08-29 19:29:26,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 32 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:29:26,334 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 178 flow [2023-08-29 19:29:26,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-29 19:29:26,335 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-08-29 19:29:26,335 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 178 flow [2023-08-29 19:29:26,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:26,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:29:26,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:26,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283588, now seen corresponding path program 1 times [2023-08-29 19:29:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87230758] [2023-08-29 19:29:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:26,530 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:29:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:26,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87230758] [2023-08-29 19:29:26,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87230758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:26,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:29:26,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 19:29:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391897560] [2023-08-29 19:29:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:26,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:29:26,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:29:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:29:26,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 221 [2023-08-29 19:29:26,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:26,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 221 [2023-08-29 19:29:26,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:26,875 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-29 19:29:26,875 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-29 19:29:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 64 events. 19/64 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 151 event pairs, 1 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 246. Up to 45 conditions per place. [2023-08-29 19:29:26,875 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2023-08-29 19:29:26,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 245 flow [2023-08-29 19:29:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-08-29 19:29:26,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2023-08-29 19:29:26,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-08-29 19:29:26,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-08-29 19:29:26,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:26,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-08-29 19:29:26,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,879 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,879 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 178 flow. Second operand 6 states and 527 transitions. [2023-08-29 19:29:26,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 245 flow [2023-08-29 19:29:26,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 237 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 19:29:26,880 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 192 flow [2023-08-29 19:29:26,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-08-29 19:29:26,881 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-29 19:29:26,881 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 192 flow [2023-08-29 19:29:26,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:26,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:26,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:26,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:29:26,881 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:26,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 351953142, now seen corresponding path program 1 times [2023-08-29 19:29:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708882534] [2023-08-29 19:29:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:27,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708882534] [2023-08-29 19:29:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708882534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032062879] [2023-08-29 19:29:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:27,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:27,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:27,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-29 19:29:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:27,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-29 19:29:27,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:27,178 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:29:27,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:29:27,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:27,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:27,278 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:29:27,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-29 19:29:27,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:27,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:27,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:27,374 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_225) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-29 19:29:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 19:29:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032062879] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:27,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-29 19:29:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364265051] [2023-08-29 19:29:27,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:27,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-29 19:29:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-29 19:29:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=172, Unknown=2, NotChecked=26, Total=240 [2023-08-29 19:29:27,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:29:27,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 192 flow. Second operand has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:27,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:27,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:29:27,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:27,665 INFO L130 PetriNetUnfolder]: 18/58 cut-off events. [2023-08-29 19:29:27,665 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-08-29 19:29:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 58 events. 18/58 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 2 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 234. Up to 40 conditions per place. [2023-08-29 19:29:27,665 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 24 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-08-29 19:29:27,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 30 transitions, 249 flow [2023-08-29 19:29:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:29:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:29:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2023-08-29 19:29:27,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18461538461538463 [2023-08-29 19:29:27,667 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 204 transitions. [2023-08-29 19:29:27,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 204 transitions. [2023-08-29 19:29:27,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:27,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 204 transitions. [2023-08-29 19:29:27,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:27,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:27,668 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:27,668 INFO L175 Difference]: Start difference. First operand has 50 places, 28 transitions, 192 flow. Second operand 5 states and 204 transitions. [2023-08-29 19:29:27,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 30 transitions, 249 flow [2023-08-29 19:29:27,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 236 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 19:29:27,670 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 189 flow [2023-08-29 19:29:27,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-29 19:29:27,670 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-29 19:29:27,671 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 189 flow [2023-08-29 19:29:27,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:27,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:27,671 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:27,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-29 19:29:27,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:27,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:27,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254242, now seen corresponding path program 2 times [2023-08-29 19:29:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681403784] [2023-08-29 19:29:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681403784] [2023-08-29 19:29:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681403784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:28,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52278463] [2023-08-29 19:29:28,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:29:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:28,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:28,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-29 19:29:28,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:29:28,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:29:28,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-29 19:29:28,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:28,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:28,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:28,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:29:28,139 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:29:28,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:29:28,182 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-29 19:29:28,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 19:29:28,186 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:29:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-29 19:29:28,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:29:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52278463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:29:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 19:29:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 11 [2023-08-29 19:29:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341121006] [2023-08-29 19:29:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:29:28,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:29:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:29:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-08-29 19:29:28,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-29 19:29:28,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:28,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:28,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-29 19:29:28,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:28,561 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-29 19:29:28,562 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2023-08-29 19:29:28,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 53 events. 15/53 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 0 based on Foata normal form. 4/57 useless extension candidates. Maximal degree in co-relation 220. Up to 40 conditions per place. [2023-08-29 19:29:28,562 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-29 19:29:28,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 27 transitions, 229 flow [2023-08-29 19:29:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:29:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:29:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-29 19:29:28,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253393665158371 [2023-08-29 19:29:28,564 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-29 19:29:28,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-29 19:29:28,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:28,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-29 19:29:28,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:28,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:28,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:28,566 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 189 flow. Second operand 6 states and 564 transitions. [2023-08-29 19:29:28,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 27 transitions, 229 flow [2023-08-29 19:29:28,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 27 transitions, 208 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 19:29:28,567 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 162 flow [2023-08-29 19:29:28,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-08-29 19:29:28,568 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-29 19:29:28,568 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 162 flow [2023-08-29 19:29:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:28,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:28,568 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:28,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-29 19:29:28,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-29 19:29:28,773 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:28,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1974487420, now seen corresponding path program 1 times [2023-08-29 19:29:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961343432] [2023-08-29 19:29:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961343432] [2023-08-29 19:29:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961343432] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76843823] [2023-08-29 19:29:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:29,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:29,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-29 19:29:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:29,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 19:29:29,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:29,151 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:29:29,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:29:29,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:29,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:29,232 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:29:29,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-29 19:29:29,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:29,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:29,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:29,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:29,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_314) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-29 19:29:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-29 19:29:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76843823] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:29,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:29,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-29 19:29:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951878288] [2023-08-29 19:29:29,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:29,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-29 19:29:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-29 19:29:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=321, Unknown=6, NotChecked=36, Total=420 [2023-08-29 19:29:29,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:29:29,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 162 flow. Second operand has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:29,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:29,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:29:29,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:31,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:29:33,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:29:36,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:29:36,076 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-08-29 19:29:36,076 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-29 19:29:36,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 47 events. 14/47 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 185. Up to 26 conditions per place. [2023-08-29 19:29:36,077 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 21 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2023-08-29 19:29:36,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 28 transitions, 211 flow [2023-08-29 19:29:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:29:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:29:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2023-08-29 19:29:36,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17970265029088558 [2023-08-29 19:29:36,078 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 278 transitions. [2023-08-29 19:29:36,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 278 transitions. [2023-08-29 19:29:36,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:36,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 278 transitions. [2023-08-29 19:29:36,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.714285714285715) internal successors, (278), 7 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:36,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:36,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:36,080 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 162 flow. Second operand 7 states and 278 transitions. [2023-08-29 19:29:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 28 transitions, 211 flow [2023-08-29 19:29:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 28 transitions, 197 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-29 19:29:36,081 INFO L231 Difference]: Finished difference. Result has 47 places, 23 transitions, 145 flow [2023-08-29 19:29:36,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=47, PETRI_TRANSITIONS=23} [2023-08-29 19:29:36,082 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-29 19:29:36,082 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 23 transitions, 145 flow [2023-08-29 19:29:36,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:36,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:36,082 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:36,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-29 19:29:36,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-29 19:29:36,288 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:36,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254296, now seen corresponding path program 2 times [2023-08-29 19:29:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37893619] [2023-08-29 19:29:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37893619] [2023-08-29 19:29:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37893619] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:36,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696320957] [2023-08-29 19:29:36,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:29:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:36,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:36,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-29 19:29:36,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:29:36,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:29:36,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 19:29:36,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:36,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:36,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:36,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:36,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:29:36,826 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:29:36,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:29:36,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:36,875 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:29:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:37,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696320957] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:37,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-08-29 19:29:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771854881] [2023-08-29 19:29:37,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:37,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-29 19:29:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:37,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-29 19:29:37,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2023-08-29 19:29:40,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 221 [2023-08-29 19:29:40,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 23 transitions, 145 flow. Second operand has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 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:29:40,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:29:40,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 221 [2023-08-29 19:29:40,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:29:41,098 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2023-08-29 19:29:41,098 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-08-29 19:29:41,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 74 events. 20/74 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 3 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 287. Up to 18 conditions per place. [2023-08-29 19:29:41,099 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 32 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2023-08-29 19:29:41,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 343 flow [2023-08-29 19:29:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 19:29:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 19:29:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1251 transitions. [2023-08-29 19:29:41,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353789592760181 [2023-08-29 19:29:41,101 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1251 transitions. [2023-08-29 19:29:41,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1251 transitions. [2023-08-29 19:29:41,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:29:41,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1251 transitions. [2023-08-29 19:29:41,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 78.1875) internal successors, (1251), 16 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:41,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:41,108 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:29:41,108 INFO L175 Difference]: Start difference. First operand has 47 places, 23 transitions, 145 flow. Second operand 16 states and 1251 transitions. [2023-08-29 19:29:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 343 flow [2023-08-29 19:29:41,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 304 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-29 19:29:41,110 INFO L231 Difference]: Finished difference. Result has 57 places, 30 transitions, 214 flow [2023-08-29 19:29:41,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=30} [2023-08-29 19:29:41,110 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-29 19:29:41,110 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 214 flow [2023-08-29 19:29:41,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 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:29:41,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:29:41,111 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:29:41,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 19:29:41,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:41,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:29:41,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:29:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1079700314, now seen corresponding path program 2 times [2023-08-29 19:29:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:29:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908192674] [2023-08-29 19:29:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:29:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:29:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:29:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:29:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908192674] [2023-08-29 19:29:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908192674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:29:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400219184] [2023-08-29 19:29:41,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:29:41,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:29:41,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:29:41,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:29:41,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-29 19:29:41,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:29:41,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:29:41,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-29 19:29:41,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:29:41,674 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-29 19:29:41,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-08-29 19:29:41,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:41,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:29:41,781 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:29:41,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-29 19:29:41,812 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 19:29:41,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-29 19:29:41,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:41,856 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 19:29:41,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-29 19:29:41,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:29:41,893 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 19:29:41,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-29 19:29:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:41,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:29:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:29:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400219184] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:29:55,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:29:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2023-08-29 19:29:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064477842] [2023-08-29 19:29:55,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:29:55,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-29 19:29:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:29:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-29 19:29:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=460, Unknown=4, NotChecked=0, Total=552 [2023-08-29 19:29:57,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:29:59,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:01,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:03,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:05,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:07,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:09,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:11,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:13,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:15,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:17,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:20,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:22,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:24,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:26,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:28,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:30,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:32,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:34,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:36,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:38,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:40,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:42,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:44,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:46,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:48,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:50,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:52,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:54,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:56,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:30:58,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:00,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:02,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:04,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:06,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:08,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:10,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:12,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:14,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:16,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:18,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:20,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:22,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:24,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:27,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:29,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:31,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:33,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:35,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:37,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:39,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:41,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:31:41,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 221 [2023-08-29 19:31:41,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 30 transitions, 214 flow. Second operand has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:41,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:41,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 221 [2023-08-29 19:31:41,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:41,830 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-29 19:31:41,830 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-29 19:31:41,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 64 events. 19/64 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs, 1 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 271. Up to 38 conditions per place. [2023-08-29 19:31:41,831 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 22 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2023-08-29 19:31:41,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 32 transitions, 273 flow [2023-08-29 19:31:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:31:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:31:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 358 transitions. [2023-08-29 19:31:41,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17998994469582705 [2023-08-29 19:31:41,833 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 358 transitions. [2023-08-29 19:31:41,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 358 transitions. [2023-08-29 19:31:41,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:41,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 358 transitions. [2023-08-29 19:31:41,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:41,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:41,846 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:41,846 INFO L175 Difference]: Start difference. First operand has 57 places, 30 transitions, 214 flow. Second operand 9 states and 358 transitions. [2023-08-29 19:31:41,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 32 transitions, 273 flow [2023-08-29 19:31:41,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 32 transitions, 246 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-29 19:31:41,847 INFO L231 Difference]: Finished difference. Result has 55 places, 27 transitions, 192 flow [2023-08-29 19:31:41,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=27} [2023-08-29 19:31:41,848 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-29 19:31:41,848 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 192 flow [2023-08-29 19:31:41,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:41,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:41,849 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:41,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-29 19:31:42,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:42,054 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:31:42,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash 888896212, now seen corresponding path program 2 times [2023-08-29 19:31:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:42,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819906] [2023-08-29 19:31:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819906] [2023-08-29 19:31:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819906] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86717111] [2023-08-29 19:31:42,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:31:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:42,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:42,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:31:42,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-29 19:31:42,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:31:42,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:42,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 19:31:42,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:42,577 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:31:42,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:31:42,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:42,672 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:31:42,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-29 19:31:42,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:42,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:42,950 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_466) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-29 19:31:42,988 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_466) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-29 19:31:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-29 19:31:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86717111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:43,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-08-29 19:31:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695505875] [2023-08-29 19:31:43,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:43,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 19:31:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 19:31:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=8, NotChecked=86, Total=600 [2023-08-29 19:31:43,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:31:43,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 27 transitions, 192 flow. Second operand has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:43,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:43,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:31:43,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:43,912 INFO L130 PetriNetUnfolder]: 18/59 cut-off events. [2023-08-29 19:31:43,912 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-29 19:31:43,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 59 events. 18/59 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 95 event pairs, 2 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 239. Up to 32 conditions per place. [2023-08-29 19:31:43,912 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 23 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2023-08-29 19:31:43,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 32 transitions, 260 flow [2023-08-29 19:31:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 19:31:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 19:31:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 316 transitions. [2023-08-29 19:31:43,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17873303167420815 [2023-08-29 19:31:43,914 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 316 transitions. [2023-08-29 19:31:43,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 316 transitions. [2023-08-29 19:31:43,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:43,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 316 transitions. [2023-08-29 19:31:43,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.5) internal successors, (316), 8 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:43,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:43,916 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:43,916 INFO L175 Difference]: Start difference. First operand has 55 places, 27 transitions, 192 flow. Second operand 8 states and 316 transitions. [2023-08-29 19:31:43,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 32 transitions, 260 flow [2023-08-29 19:31:43,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 32 transitions, 237 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-29 19:31:43,917 INFO L231 Difference]: Finished difference. Result has 54 places, 26 transitions, 186 flow [2023-08-29 19:31:43,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=26} [2023-08-29 19:31:43,918 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-08-29 19:31:43,918 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 26 transitions, 186 flow [2023-08-29 19:31:43,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:43,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:43,918 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:43,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:31:44,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-29 19:31:44,126 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:31:44,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 574975110, now seen corresponding path program 3 times [2023-08-29 19:31:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:44,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038622892] [2023-08-29 19:31:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:44,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038622892] [2023-08-29 19:31:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038622892] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952798361] [2023-08-29 19:31:44,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:31:44,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:44,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:31:44,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-29 19:31:45,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-29 19:31:45,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:45,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-29 19:31:45,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:45,076 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:31:45,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:31:45,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:45,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:31:45,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-29 19:31:45,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:45,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:45,553 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_526) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-29 19:31:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-29 19:31:45,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952798361] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:45,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:45,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2023-08-29 19:31:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352521904] [2023-08-29 19:31:45,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-29 19:31:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-29 19:31:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=628, Unknown=15, NotChecked=50, Total=756 [2023-08-29 19:31:45,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:31:45,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 26 transitions, 186 flow. Second operand has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:45,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:45,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:31:45,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:46,640 INFO L130 PetriNetUnfolder]: 17/54 cut-off events. [2023-08-29 19:31:46,640 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2023-08-29 19:31:46,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 54 events. 17/54 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 2 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2023-08-29 19:31:46,640 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2023-08-29 19:31:46,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 32 transitions, 252 flow [2023-08-29 19:31:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:31:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:31:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2023-08-29 19:31:46,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1779788838612368 [2023-08-29 19:31:46,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 354 transitions. [2023-08-29 19:31:46,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 354 transitions. [2023-08-29 19:31:46,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:46,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 354 transitions. [2023-08-29 19:31:46,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:46,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:46,644 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:46,644 INFO L175 Difference]: Start difference. First operand has 54 places, 26 transitions, 186 flow. Second operand 9 states and 354 transitions. [2023-08-29 19:31:46,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 32 transitions, 252 flow [2023-08-29 19:31:46,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 32 transitions, 232 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-29 19:31:46,646 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 181 flow [2023-08-29 19:31:46,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2023-08-29 19:31:46,646 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-29 19:31:46,646 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 181 flow [2023-08-29 19:31:46,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:46,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:46,646 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:46,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-29 19:31:46,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:46,852 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:31:46,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 575804722, now seen corresponding path program 3 times [2023-08-29 19:31:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:46,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113144508] [2023-08-29 19:31:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:47,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113144508] [2023-08-29 19:31:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113144508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622607151] [2023-08-29 19:31:47,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:31:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:47,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:31:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-29 19:31:47,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-29 19:31:47,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:47,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-29 19:31:47,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:47,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:47,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:47,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:47,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:31:47,644 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:31:47,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:31:47,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:47,751 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:31:47,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-29 19:31:47,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:47,769 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-29 19:31:47,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-08-29 19:31:47,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:47,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:47,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:47,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:47,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:48,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:48,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:48,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:48,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622607151] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:48,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-08-29 19:31:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19442002] [2023-08-29 19:31:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-29 19:31:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-29 19:31:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1187, Unknown=13, NotChecked=0, Total=1332 [2023-08-29 19:31:49,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:31:49,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 181 flow. Second operand has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:49,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:49,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:31:49,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:50,639 INFO L130 PetriNetUnfolder]: 11/44 cut-off events. [2023-08-29 19:31:50,640 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-29 19:31:50,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 44 events. 11/44 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 1 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 177. Up to 11 conditions per place. [2023-08-29 19:31:50,640 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 19 selfloop transitions, 11 changer transitions 0/30 dead transitions. [2023-08-29 19:31:50,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 30 transitions, 219 flow [2023-08-29 19:31:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 19:31:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 19:31:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2023-08-29 19:31:50,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.173686042464323 [2023-08-29 19:31:50,642 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 499 transitions. [2023-08-29 19:31:50,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 499 transitions. [2023-08-29 19:31:50,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:50,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 499 transitions. [2023-08-29 19:31:50,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:50,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:50,645 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:50,645 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 181 flow. Second operand 13 states and 499 transitions. [2023-08-29 19:31:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 30 transitions, 219 flow [2023-08-29 19:31:50,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 173 flow, removed 3 selfloop flow, removed 17 redundant places. [2023-08-29 19:31:50,647 INFO L231 Difference]: Finished difference. Result has 49 places, 21 transitions, 116 flow [2023-08-29 19:31:50,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=21} [2023-08-29 19:31:50,648 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-29 19:31:50,648 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 116 flow [2023-08-29 19:31:50,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:50,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:50,649 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:50,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-29 19:31:50,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-29 19:31:50,854 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:31:50,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash -473485548, now seen corresponding path program 4 times [2023-08-29 19:31:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150254233] [2023-08-29 19:31:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150254233] [2023-08-29 19:31:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150254233] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447716896] [2023-08-29 19:31:51,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 19:31:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:51,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:31:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-29 19:31:51,686 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 19:31:51,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:51,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-29 19:31:51,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:51,722 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:31:51,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:31:51,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:51,802 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-29 19:31:51,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 19:31:51,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:51,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:51,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:51,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:52,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:52,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:52,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:52,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:52,165 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-29 19:31:52,170 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-29 19:31:52,227 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-29 19:31:52,294 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 6 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-29 19:31:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-08-29 19:31:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447716896] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:31:54,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:31:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-08-29 19:31:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455291520] [2023-08-29 19:31:54,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:31:54,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-29 19:31:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:31:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-29 19:31:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=16, NotChecked=212, Total=930 [2023-08-29 19:31:54,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:31:54,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 116 flow. Second operand has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:54,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:31:54,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:31:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:31:57,111 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= 3 |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse1 (<= 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1|))) (and (forall ((v_~v~0.base_68 Int) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) v_~v~0.base_68 v_ArrVal_660) 3) 6)) (not (= (select |c_#valid| v_~v~0.base_68) 0)))) (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base| 3) (= c_~v~0.offset 0) (or (not .cse0) (and .cse1 (= (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) 4))) (not (= 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| 3)) (or .cse0 (and (not (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|)) .cse1 (= 116 (select (select |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) 6)) (<= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3))) (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3) (<= 116 (select (select |c_#memory_int| 3) 6)) (= |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 0) (forall ((v_ArrVal_660 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~v~0.base v_ArrVal_660) 3) 6))) (not (= c_~v~0.base 3)))) is different from false [2023-08-29 19:31:58,029 INFO L130 PetriNetUnfolder]: 10/50 cut-off events. [2023-08-29 19:31:58,030 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 19:31:58,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 50 events. 10/50 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 1 based on Foata normal form. 2/52 useless extension candidates. Maximal degree in co-relation 183. Up to 14 conditions per place. [2023-08-29 19:31:58,031 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 17 changer transitions 0/38 dead transitions. [2023-08-29 19:31:58,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 38 transitions, 264 flow [2023-08-29 19:31:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 19:31:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 19:31:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 575 transitions. [2023-08-29 19:31:58,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17345399698340874 [2023-08-29 19:31:58,046 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 575 transitions. [2023-08-29 19:31:58,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 575 transitions. [2023-08-29 19:31:58,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:31:58,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 575 transitions. [2023-08-29 19:31:58,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 38.333333333333336) internal successors, (575), 15 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:58,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 221.0) internal successors, (3536), 16 states have internal predecessors, (3536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:58,051 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 221.0) internal successors, (3536), 16 states have internal predecessors, (3536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:58,051 INFO L175 Difference]: Start difference. First operand has 49 places, 21 transitions, 116 flow. Second operand 15 states and 575 transitions. [2023-08-29 19:31:58,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 38 transitions, 264 flow [2023-08-29 19:31:58,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 230 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-08-29 19:31:58,053 INFO L231 Difference]: Finished difference. Result has 58 places, 32 transitions, 207 flow [2023-08-29 19:31:58,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=207, PETRI_PLACES=58, PETRI_TRANSITIONS=32} [2023-08-29 19:31:58,054 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-29 19:31:58,054 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 207 flow [2023-08-29 19:31:58,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:31:58,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:31:58,055 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:31:58,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-29 19:31:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-29 19:31:58,261 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:31:58,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:31:58,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1589785604, now seen corresponding path program 5 times [2023-08-29 19:31:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:31:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659732591] [2023-08-29 19:31:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:31:58,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:31:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:31:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:31:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659732591] [2023-08-29 19:31:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659732591] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 19:31:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383822874] [2023-08-29 19:31:59,064 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 19:31:59,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 19:31:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:31:59,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 19:31:59,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-29 19:31:59,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-29 19:31:59,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:31:59,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-29 19:31:59,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:31:59,244 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-29 19:31:59,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-29 19:31:59,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:31:59,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:31:59,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-29 19:31:59,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 19:31:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:31:59,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:31:59,868 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_725) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-29 19:32:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-29 19:32:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383822874] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:32:00,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 19:32:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-08-29 19:32:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778314594] [2023-08-29 19:32:00,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 19:32:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-29 19:32:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:32:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-29 19:32:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=775, Unknown=28, NotChecked=56, Total=930 [2023-08-29 19:32:02,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:04,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:06,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:08,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:10,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:10,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-29 19:32:10,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 32 transitions, 207 flow. Second operand has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:10,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:10,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-29 19:32:10,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:11,908 INFO L130 PetriNetUnfolder]: 10/47 cut-off events. [2023-08-29 19:32:11,909 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2023-08-29 19:32:11,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 47 events. 10/47 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2023-08-29 19:32:11,909 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 17 selfloop transitions, 18 changer transitions 0/35 dead transitions. [2023-08-29 19:32:11,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 35 transitions, 297 flow [2023-08-29 19:32:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 19:32:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 19:32:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 388 transitions. [2023-08-29 19:32:11,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1755656108597285 [2023-08-29 19:32:11,911 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 388 transitions. [2023-08-29 19:32:11,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 388 transitions. [2023-08-29 19:32:11,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:11,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 388 transitions. [2023-08-29 19:32:11,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 38.8) internal successors, (388), 10 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:32:11,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:11,914 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:11,914 INFO L175 Difference]: Start difference. First operand has 58 places, 32 transitions, 207 flow. Second operand 10 states and 388 transitions. [2023-08-29 19:32:11,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 35 transitions, 297 flow [2023-08-29 19:32:11,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 35 transitions, 267 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-29 19:32:11,918 INFO L231 Difference]: Finished difference. Result has 58 places, 30 transitions, 193 flow [2023-08-29 19:32:11,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=193, PETRI_PLACES=58, PETRI_TRANSITIONS=30} [2023-08-29 19:32:11,919 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-29 19:32:11,919 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 30 transitions, 193 flow [2023-08-29 19:32:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:11,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:11,920 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:11,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 19:32:12,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-29 19:32:12,126 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:12,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -703171770, now seen corresponding path program 6 times [2023-08-29 19:32:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:32:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758136524] [2023-08-29 19:32:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:32:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:32:12,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:32:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:32:12,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:32:12,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:32:12,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-29 19:32:12,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-29 19:32:12,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-29 19:32:12,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-29 19:32:12,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-29 19:32:12,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-29 19:32:12,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-29 19:32:12,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 19:32:12,249 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:12,254 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:32:12,254 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:32:12,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,275 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,276 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,277 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,278 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,279 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,280 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,281 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,282 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,283 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,284 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:32:12,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:32:12,285 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:32:12,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:32:12 BasicIcfg [2023-08-29 19:32:12,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:32:12,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:32:12,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:32:12,300 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:32:12,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:29:17" (3/4) ... [2023-08-29 19:32:12,302 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:32:12,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:32:12,303 INFO L158 Benchmark]: Toolchain (without parser) took 175378.34ms. Allocated memory was 92.3MB in the beginning and 251.7MB in the end (delta: 159.4MB). Free memory was 69.9MB in the beginning and 118.0MB in the end (delta: -48.1MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,303 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:32:12,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.12ms. Allocated memory is still 92.3MB. Free memory was 69.6MB in the beginning and 58.3MB in the end (delta: 11.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.38ms. Allocated memory is still 92.3MB. Free memory was 58.3MB in the beginning and 55.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,304 INFO L158 Benchmark]: Boogie Preprocessor took 16.66ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 54.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,304 INFO L158 Benchmark]: RCFGBuilder took 449.25ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 67.0MB in the end (delta: -12.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,304 INFO L158 Benchmark]: TraceAbstraction took 174387.74ms. Allocated memory was 92.3MB in the beginning and 251.7MB in the end (delta: 159.4MB). Free memory was 66.5MB in the beginning and 118.0MB in the end (delta: -51.5MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2023-08-29 19:32:12,304 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 251.7MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:32:12,305 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 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.12ms. Allocated memory is still 92.3MB. Free memory was 69.6MB in the beginning and 58.3MB in the end (delta: 11.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.38ms. Allocated memory is still 92.3MB. Free memory was 58.3MB in the beginning and 55.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.66ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 54.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.25ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 67.0MB in the end (delta: -12.8MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 174387.74ms. Allocated memory was 92.3MB in the beginning and 251.7MB in the end (delta: 159.4MB). Free memory was 66.5MB in the beginning and 118.0MB in the end (delta: -51.5MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 251.7MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 103 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 355, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={10:0}, t2={9:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=-2, arg={0:0}, t1={10:0}, t2={9:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={10:0}, t2={9:0}, v={-3:0}] [L1116] COND TRUE 2 \read(*v) [L1116] CALL 2 strcpy(v, "Bigshot") [L1125] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1116] RET 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-3:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 138 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 174.2s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 139.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 299 mSolverCounterUnknown, 5430 SdHoareTripleChecker+Valid, 131.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4343 mSDsluCounter, 7500 SdHoareTripleChecker+Invalid, 130.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 552 IncrementalHoareTripleChecker+Unchecked, 7349 mSDsCounter, 467 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18512 IncrementalHoareTripleChecker+Invalid, 19830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 467 mSolverCounterUnsat, 151 mSDtfsCounter, 18512 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 173 SyntacticMatches, 8 SemanticMatches, 389 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=19, InterpolantAutomatonStates: 168, 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.6s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 465 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 560 ConstructedInterpolants, 128 QuantifiedInterpolants, 9856 SizeOfPredicates, 86 NumberOfNonLiveVariables, 2910 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 48 InterpolantComputations, 14 PerfectInterpolantSequences, 34/420 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:32:12,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/bigshot_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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:32:14,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:32:14,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:32:14,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:32:14,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:32:14,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:32:14,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:32:14,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:32:14,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:32:14,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:32:14,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:32:14,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:32:14,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:32:14,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:32:14,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:32:14,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:32:14,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:32:14,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:32:14,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:32:14,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:32:14,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:32:14,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:32:14,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:32:14,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:32:14,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:32:14,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:32:14,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:32:14,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:32:14,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:32:14,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:32:14,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:32:14,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:32:14,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:32:14,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:32:14,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:32:14,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:32:14,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:32:14,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:32:14,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:32:14,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:32:14,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:32:14,555 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:32:14,574 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:32:14,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:32:14,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:32:14,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:32:14,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:32:14,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:32:14,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:32:14,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:32:14,576 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:32:14,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:32:14,577 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:32:14,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:32:14,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:32:14,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:32:14,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:32:14,578 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:32:14,578 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 19:32:14,579 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:32:14,580 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:32:14,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:32:14,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:32:14,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:32:14,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:32:14,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:32:14,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:32:14,581 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 19:32:14,581 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 19:32:14,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:32:14,582 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:32:14,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:32:14,582 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 19:32:14,582 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:32:14,583 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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:32:14,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:32:14,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:32:14,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:32:14,840 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:32:14,840 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:32:14,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-29 19:32:15,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:32:16,088 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:32:16,088 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-29 19:32:16,109 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a996cd237/24491fd4389346a4b300134efae15dbe/FLAGc20946a26 [2023-08-29 19:32:16,125 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a996cd237/24491fd4389346a4b300134efae15dbe [2023-08-29 19:32:16,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:32:16,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:32:16,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:32:16,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:32:16,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:32:16,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b6b3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16, skipping insertion in model container [2023-08-29 19:32:16,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:32:16,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:32:16,489 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-29 19:32:16,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:32:16,526 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:32:16,581 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-29 19:32:16,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:32:16,649 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:32:16,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16 WrapperNode [2023-08-29 19:32:16,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:32:16,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:32:16,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:32:16,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:32:16,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,686 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:32:16" (1/1) ... [2023-08-29 19:32:16,707 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-08-29 19:32:16,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:32:16,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:32:16,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:32:16,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:32:16,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:32:16,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:32:16,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:32:16,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:32:16,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (1/1) ... [2023-08-29 19:32:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:32:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:32:16,802 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:32:16,810 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:32:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 19:32:16,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 19:32:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 19:32:16,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 19:32:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-08-29 19:32:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 19:32:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:32:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:32:16,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:32:16,834 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:32:16,926 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:32:16,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:32:17,193 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:32:17,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:32:17,199 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-29 19:32:17,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:32:17 BoogieIcfgContainer [2023-08-29 19:32:17,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:32:17,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:32:17,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:32:17,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:32:17,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:32:16" (1/3) ... [2023-08-29 19:32:17,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faccf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:32:17, skipping insertion in model container [2023-08-29 19:32:17,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:32:16" (2/3) ... [2023-08-29 19:32:17,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faccf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:32:17, skipping insertion in model container [2023-08-29 19:32:17,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:32:17" (3/3) ... [2023-08-29 19:32:17,207 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-29 19:32:17,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:32:17,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-29 19:32:17,218 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:32:17,316 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 19:32:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 230 flow [2023-08-29 19:32:17,417 INFO L130 PetriNetUnfolder]: 4/105 cut-off events. [2023-08-29 19:32:17,417 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:32:17,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 4/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-29 19:32:17,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 230 flow [2023-08-29 19:32:17,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 214 flow [2023-08-29 19:32:17,427 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:32:17,437 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-29 19:32:17,439 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-29 19:32:17,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 214 flow [2023-08-29 19:32:17,499 INFO L130 PetriNetUnfolder]: 4/101 cut-off events. [2023-08-29 19:32:17,499 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:32:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-29 19:32:17,500 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-29 19:32:23,603 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-29 19:32:23,603 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-29 19:32:23,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:32:23,625 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;@6fab1cd1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:32:23,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-29 19:32:23,626 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 19:32:23,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:32:23,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:23,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:32:23,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:23,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 410, now seen corresponding path program 1 times [2023-08-29 19:32:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424913876] [2023-08-29 19:32:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:23,638 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:32:23,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:23,640 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:32:23,644 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:32:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:23,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 19:32:23,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:23,727 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:32:23,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:23,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424913876] [2023-08-29 19:32:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424913876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:23,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:32:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138269033] [2023-08-29 19:32:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:23,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:32:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:32:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:32:23,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2023-08-29 19:32:23,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:23,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:23,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2023-08-29 19:32:23,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:23,870 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-29 19:32:23,870 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 19:32:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 212 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-29 19:32:23,871 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-29 19:32:23,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-29 19:32:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:32:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:32:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 230 transitions. [2023-08-29 19:32:23,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251141552511416 [2023-08-29 19:32:23,880 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 230 transitions. [2023-08-29 19:32:23,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 230 transitions. [2023-08-29 19:32:23,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:23,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 230 transitions. [2023-08-29 19:32:23,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:23,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:23,888 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:23,889 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 230 transitions. [2023-08-29 19:32:23,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-29 19:32:23,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:32:23,892 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-29 19:32:23,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-29 19:32:23,895 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-29 19:32:23,896 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-29 19:32:23,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:23,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:23,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:32:23,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:32:24,102 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:32:24,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:24,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash 403585, now seen corresponding path program 1 times [2023-08-29 19:32:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:24,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226200987] [2023-08-29 19:32:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:24,105 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:32:24,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:24,110 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:32:24,112 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:32:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:24,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:32:24,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:24,203 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:32:24,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 19:32:24,220 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:32:24,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:24,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226200987] [2023-08-29 19:32:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226200987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:32:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431085967] [2023-08-29 19:32:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:24,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:32:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:32:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:32:24,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-29 19:32:24,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:24,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-29 19:32:24,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:24,349 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-29 19:32:24,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:32:24,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 202 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-29 19:32:24,350 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-29 19:32:24,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-29 19:32:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:32:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:32:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-29 19:32:24,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550989345509893 [2023-08-29 19:32:24,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-29 19:32:24,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-29 19:32:24,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:24,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-29 19:32:24,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,362 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 299 transitions. [2023-08-29 19:32:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-29 19:32:24,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:32:24,363 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-29 19:32:24,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-29 19:32:24,364 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:32:24,364 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-29 19:32:24,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:24,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:32:24,383 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:32:24,571 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:32:24,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:24,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 403586, now seen corresponding path program 1 times [2023-08-29 19:32:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:24,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588923028] [2023-08-29 19:32:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:24,574 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:32:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:24,582 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:32:24,583 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:32:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:24,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:32:24,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:24,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:24,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:32:24,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 19:32:24,674 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:32:24,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:24,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588923028] [2023-08-29 19:32:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588923028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:32:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364934019] [2023-08-29 19:32:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:32:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:32:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:32:24,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-08-29 19:32:24,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:24,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-08-29 19:32:24,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:24,837 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-29 19:32:24,837 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:32:24,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-29 19:32:24,837 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-29 19:32:24,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-29 19:32:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:32:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:32:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-29 19:32:24,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-29 19:32:24,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-29 19:32:24,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-29 19:32:24,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:24,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-29 19:32:24,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,844 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 309 transitions. [2023-08-29 19:32:24,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-29 19:32:24,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:32:24,845 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-29 19:32:24,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-29 19:32:24,845 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-29 19:32:24,845 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-29 19:32:24,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:24,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:24,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:32:24,854 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:32:25,052 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:32:25,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:25,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 12512186, now seen corresponding path program 1 times [2023-08-29 19:32:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014686802] [2023-08-29 19:32:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:25,054 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:32:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:25,069 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:32:25,072 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:32:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:25,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 19:32:25,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:25,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:25,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-29 19:32:25,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 19:32:25,184 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:32:25,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-29 19:32:25,215 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:32:25,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:25,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014686802] [2023-08-29 19:32:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014686802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:32:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379745419] [2023-08-29 19:32:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:32:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:25,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:32:25,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:32:25,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-29 19:32:25,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 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:32:25,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:25,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-29 19:32:25,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:25,538 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-29 19:32:25,538 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 19:32:25,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 15 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 58 conditions per place. [2023-08-29 19:32:25,538 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-29 19:32:25,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 112 flow [2023-08-29 19:32:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:32:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:32:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2023-08-29 19:32:25,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497716894977169 [2023-08-29 19:32:25,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 394 transitions. [2023-08-29 19:32:25,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 394 transitions. [2023-08-29 19:32:25,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:25,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 394 transitions. [2023-08-29 19:32:25,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:25,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:25,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:25,543 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 4 states and 394 transitions. [2023-08-29 19:32:25,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 112 flow [2023-08-29 19:32:25,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:32:25,544 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 60 flow [2023-08-29 19:32:25,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-29 19:32:25,545 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:32:25,545 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 60 flow [2023-08-29 19:32:25,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 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:32:25,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:25,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:32:25,555 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:32:25,752 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:32:25,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:25,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -861376330, now seen corresponding path program 1 times [2023-08-29 19:32:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452774329] [2023-08-29 19:32:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:25,753 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:32:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:25,754 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:32:25,756 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:32:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:25,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:32:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:25,864 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:32:25,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-29 19:32:25,882 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:32:25,882 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:32:25,890 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:32:25,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:25,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452774329] [2023-08-29 19:32:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452774329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:32:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814887581] [2023-08-29 19:32:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:32:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:32:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:32:25,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-29 19:32:25,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:25,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:25,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-29 19:32:25,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:26,000 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-29 19:32:26,000 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 19:32:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 51 events. 17/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 134 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 105. Up to 47 conditions per place. [2023-08-29 19:32:26,000 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-29 19:32:26,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 100 flow [2023-08-29 19:32:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:32:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:32:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-29 19:32:26,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-29 19:32:26,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-29 19:32:26,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-29 19:32:26,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:26,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-29 19:32:26,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,004 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 60 flow. Second operand 3 states and 297 transitions. [2023-08-29 19:32:26,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 100 flow [2023-08-29 19:32:26,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:32:26,004 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-29 19:32:26,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-29 19:32:26,005 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-29 19:32:26,005 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-29 19:32:26,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:26,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 19:32:26,014 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:32:26,214 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:32:26,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:26,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -861376329, now seen corresponding path program 1 times [2023-08-29 19:32:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199247568] [2023-08-29 19:32:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:26,215 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:32:26,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:26,217 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:32:26,219 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:32:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:26,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:32:26,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:26,291 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:32:26,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-29 19:32:26,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:32:26,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 19:32:26,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:26,360 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:32:26,368 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-29 19:32:26,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-29 19:32:26,380 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:32:26,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:26,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199247568] [2023-08-29 19:32:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199247568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:26,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:32:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471249561] [2023-08-29 19:32:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:26,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:32:26,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:32:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:32:26,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-29 19:32:26,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:26,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-29 19:32:26,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:26,573 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-29 19:32:26,573 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:32:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 66 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-29 19:32:26,573 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-29 19:32:26,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-29 19:32:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:32:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:32:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-29 19:32:26,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353120243531202 [2023-08-29 19:32:26,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-29 19:32:26,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-29 19:32:26,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:26,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-29 19:32:26,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,577 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 286 transitions. [2023-08-29 19:32:26,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-29 19:32:26,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:32:26,578 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-29 19:32:26,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-29 19:32:26,579 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-29 19:32:26,579 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-29 19:32:26,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:26,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:26,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:26,588 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:32:26,786 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:32:26,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:26,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash 305735059, now seen corresponding path program 1 times [2023-08-29 19:32:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145494832] [2023-08-29 19:32:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:26,787 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:32:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:26,788 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:32:26,790 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:32:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:26,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:32:26,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:26,901 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-29 19:32:26,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-29 19:32:26,937 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 19:32:26,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-08-29 19:32:27,032 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:32:27,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:27,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145494832] [2023-08-29 19:32:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145494832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:32:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567611023] [2023-08-29 19:32:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:27,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:32:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:32:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:32:27,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 219 [2023-08-29 19:32:27,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:27,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 219 [2023-08-29 19:32:27,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:27,241 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-29 19:32:27,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:32:27,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 87 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-29 19:32:27,241 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-29 19:32:27,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-29 19:32:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:32:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:32:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-08-29 19:32:27,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3915525114155251 [2023-08-29 19:32:27,243 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-08-29 19:32:27,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-08-29 19:32:27,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:27,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-08-29 19:32:27,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 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:32:27,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,245 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,245 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 343 transitions. [2023-08-29 19:32:27,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-29 19:32:27,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:32:27,246 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-29 19:32:27,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-29 19:32:27,246 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-29 19:32:27,246 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-29 19:32:27,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:27,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:27,253 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 (8)] Ended with exit code 0 [2023-08-29 19:32:27,453 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:32:27,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:27,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 305735143, now seen corresponding path program 1 times [2023-08-29 19:32:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272829298] [2023-08-29 19:32:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:27,454 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:32:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:27,455 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:32:27,457 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:32:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:27,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:32:27,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:27,523 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:32:27,563 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:32:27,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:27,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272829298] [2023-08-29 19:32:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272829298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:27,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:27,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:32:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351564510] [2023-08-29 19:32:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:32:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:32:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:32:27,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-29 19:32:27,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:27,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-29 19:32:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:27,739 INFO L130 PetriNetUnfolder]: 14/54 cut-off events. [2023-08-29 19:32:27,739 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 19:32:27,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 54 events. 14/54 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 147 event pairs, 6 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 116. Up to 35 conditions per place. [2023-08-29 19:32:27,739 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-29 19:32:27,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 135 flow [2023-08-29 19:32:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:32:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:32:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-29 19:32:27,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-29 19:32:27,741 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-29 19:32:27,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-29 19:32:27,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:27,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-29 19:32:27,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,743 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 4 states and 396 transitions. [2023-08-29 19:32:27,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 135 flow [2023-08-29 19:32:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:32:27,743 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 63 flow [2023-08-29 19:32:27,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-29 19:32:27,744 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-29 19:32:27,744 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 63 flow [2023-08-29 19:32:27,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:27,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:27,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:27,769 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:32:27,951 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:32:27,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:27,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582902, now seen corresponding path program 1 times [2023-08-29 19:32:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753253320] [2023-08-29 19:32:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:27,952 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:32:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:27,953 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:32:27,956 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:32:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:28,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:32:28,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:28,035 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:32:28,047 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:32:28,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:28,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753253320] [2023-08-29 19:32:28,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753253320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:28,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:32:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910971884] [2023-08-29 19:32:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:28,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:32:28,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:28,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:32:28,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:32:28,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-29 19:32:28,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:28,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:28,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-29 19:32:28,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:28,215 INFO L130 PetriNetUnfolder]: 12/45 cut-off events. [2023-08-29 19:32:28,215 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 19:32:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 45 events. 12/45 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 112 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2023-08-29 19:32:28,215 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 19 selfloop transitions, 4 changer transitions 0/23 dead transitions. [2023-08-29 19:32:28,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 114 flow [2023-08-29 19:32:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:32:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:32:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-29 19:32:28,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440639269406393 [2023-08-29 19:32:28,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-29 19:32:28,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-29 19:32:28,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:28,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-29 19:32:28,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:28,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:28,220 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:28,220 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 63 flow. Second operand 4 states and 389 transitions. [2023-08-29 19:32:28,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 114 flow [2023-08-29 19:32:28,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:32:28,222 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 63 flow [2023-08-29 19:32:28,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-29 19:32:28,222 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2023-08-29 19:32:28,223 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 63 flow [2023-08-29 19:32:28,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:28,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:28,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:28,232 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 (10)] Ended with exit code 0 [2023-08-29 19:32:28,430 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:32:28,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:28,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582855, now seen corresponding path program 1 times [2023-08-29 19:32:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822301528] [2023-08-29 19:32:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:28,431 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:32:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:28,432 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:32:28,434 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:32:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:28,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-29 19:32:28,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:28,541 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-29 19:32:28,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-29 19:32:28,579 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-29 19:32:28,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-29 19:32:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:28,711 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 19:32:28,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-29 19:32:28,745 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-29 19:32:28,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-29 19:32:28,905 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:32:28,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:32:28,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822301528] [2023-08-29 19:32:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822301528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:32:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:32:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:32:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600103978] [2023-08-29 19:32:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:32:28,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:32:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:32:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:32:29,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-29 19:32:29,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:29,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:29,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-29 19:32:29,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:29,390 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-29 19:32:29,390 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-29 19:32:29,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 42 events. 11/42 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 104. Up to 28 conditions per place. [2023-08-29 19:32:29,391 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 18 selfloop transitions, 7 changer transitions 0/25 dead transitions. [2023-08-29 19:32:29,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 129 flow [2023-08-29 19:32:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:32:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:32:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-08-29 19:32:29,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318330071754729 [2023-08-29 19:32:29,393 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-08-29 19:32:29,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-08-29 19:32:29,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:29,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-08-29 19:32:29,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:29,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:29,396 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:29,396 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 63 flow. Second operand 7 states and 662 transitions. [2023-08-29 19:32:29,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 129 flow [2023-08-29 19:32:29,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:32:29,396 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 77 flow [2023-08-29 19:32:29,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=77, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-29 19:32:29,398 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-29 19:32:29,398 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2023-08-29 19:32:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:29,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:29,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:29,423 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:32:29,598 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:32:29,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:29,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333102, now seen corresponding path program 1 times [2023-08-29 19:32:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334925002] [2023-08-29 19:32:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:29,599 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:32:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:29,601 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:32:29,603 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:32:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:29,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:32:29,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:29,712 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:32:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:29,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:32:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:29,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334925002] [2023-08-29 19:32:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334925002] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:32:29,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:32:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-29 19:32:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498788131] [2023-08-29 19:32:29,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:32:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 19:32:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 19:32:29,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 19:32:30,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-29 19:32:30,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:30,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:32:30,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-29 19:32:30,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:32:30,596 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2023-08-29 19:32:30,596 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 19:32:30,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 74 events. 20/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 243 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2023-08-29 19:32:30,597 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-29 19:32:30,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 239 flow [2023-08-29 19:32:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:32:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:32:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2023-08-29 19:32:30,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43313763861709065 [2023-08-29 19:32:30,599 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2023-08-29 19:32:30,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2023-08-29 19:32:30,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:32:30,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2023-08-29 19:32:30,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:30,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:30,602 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:30,602 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 7 states and 664 transitions. [2023-08-29 19:32:30,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 239 flow [2023-08-29 19:32:30,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:32:30,603 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 121 flow [2023-08-29 19:32:30,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-29 19:32:30,604 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-29 19:32:30,604 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 121 flow [2023-08-29 19:32:30,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:32:30,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:32:30,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:32:30,613 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 (12)] Ended with exit code 0 [2023-08-29 19:32:30,813 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:32:30,813 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:32:30,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:32:30,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333054, now seen corresponding path program 1 times [2023-08-29 19:32:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:32:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031528612] [2023-08-29 19:32:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:32:30,814 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:32:30,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:32:30,815 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:32:30,817 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:32:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:32:30,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 19:32:30,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:32:30,976 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-29 19:32:30,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-29 19:32:31,019 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-29 19:32:31,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-29 19:32:31,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:32:31,112 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 19:32:31,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-29 19:32:31,152 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-29 19:32:31,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-29 19:32:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:31,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:32:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:32:31,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:32:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031528612] [2023-08-29 19:32:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031528612] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:32:31,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:32:31,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-29 19:32:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186493232] [2023-08-29 19:32:31,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:32:31,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 19:32:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:32:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 19:32:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-29 19:32:33,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:35,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:37,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:40,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:42,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:44,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:46,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:48,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:50,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:53,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:55,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:57,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:32:59,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:01,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:03,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:05,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:05,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 219 [2023-08-29 19:33:05,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 121 flow. Second operand has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:05,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:05,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 219 [2023-08-29 19:33:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:06,248 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2023-08-29 19:33:06,249 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 19:33:06,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 65 events. 17/65 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 3 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 204. Up to 20 conditions per place. [2023-08-29 19:33:06,251 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 28 selfloop transitions, 14 changer transitions 0/42 dead transitions. [2023-08-29 19:33:06,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 257 flow [2023-08-29 19:33:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 19:33:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 19:33:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 890 transitions. [2023-08-29 19:33:06,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3126097646645592 [2023-08-29 19:33:06,256 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 890 transitions. [2023-08-29 19:33:06,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 890 transitions. [2023-08-29 19:33:06,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:06,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 890 transitions. [2023-08-29 19:33:06,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.46153846153847) internal successors, (890), 13 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,261 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,261 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 121 flow. Second operand 13 states and 890 transitions. [2023-08-29 19:33:06,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 257 flow [2023-08-29 19:33:06,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 19:33:06,280 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 167 flow [2023-08-29 19:33:06,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2023-08-29 19:33:06,281 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-29 19:33:06,281 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 26 transitions, 167 flow [2023-08-29 19:33:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:06,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:06,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 19:33:06,489 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:33:06,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:06,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1060197226, now seen corresponding path program 1 times [2023-08-29 19:33:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164491102] [2023-08-29 19:33:06,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:33:06,491 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:33:06,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:06,492 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:33:06,493 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:33:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:33:06,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 19:33:06,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:06,560 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:33:06,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:33:06,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164491102] [2023-08-29 19:33:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164491102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:33:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:33:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:33:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807300004] [2023-08-29 19:33:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:33:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:33:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:33:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:33:06,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-29 19:33:06,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 26 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:06,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-29 19:33:06,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:06,636 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2023-08-29 19:33:06,636 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-29 19:33:06,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 59 events. 16/59 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 219. Up to 56 conditions per place. [2023-08-29 19:33:06,636 INFO L137 encePairwiseOnDemand]: 217/219 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-29 19:33:06,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 25 transitions, 210 flow [2023-08-29 19:33:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:33:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:33:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-29 19:33:06,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-29 19:33:06,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-29 19:33:06,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-29 19:33:06,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:06,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-29 19:33:06,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,641 INFO L175 Difference]: Start difference. First operand has 50 places, 26 transitions, 167 flow. Second operand 3 states and 309 transitions. [2023-08-29 19:33:06,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 25 transitions, 210 flow [2023-08-29 19:33:06,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 174 flow, removed 3 selfloop flow, removed 11 redundant places. [2023-08-29 19:33:06,643 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 124 flow [2023-08-29 19:33:06,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-29 19:33:06,644 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-29 19:33:06,644 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 124 flow [2023-08-29 19:33:06,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:06,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:06,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:06,653 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:33:06,851 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:33:06,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:06,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1493255456, now seen corresponding path program 1 times [2023-08-29 19:33:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022427149] [2023-08-29 19:33:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:33:06,853 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:33:06,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:06,853 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:33:06,855 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:33:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:33:06,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:33:06,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:06,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-29 19:33:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:33:06,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:33:06,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022427149] [2023-08-29 19:33:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022427149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:33:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:33:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:33:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485727663] [2023-08-29 19:33:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:33:06,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:33:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:33:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:33:07,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-29 19:33:07,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 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:33:07,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:07,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-29 19:33:07,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:07,139 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2023-08-29 19:33:07,139 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 19:33:07,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 58 events. 16/58 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 149 event pairs, 10 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 189. Up to 50 conditions per place. [2023-08-29 19:33:07,139 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-29 19:33:07,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 187 flow [2023-08-29 19:33:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:33:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:33:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-29 19:33:07,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-29 19:33:07,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-29 19:33:07,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-29 19:33:07,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:07,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-29 19:33:07,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,143 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,143 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 124 flow. Second operand 5 states and 483 transitions. [2023-08-29 19:33:07,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 187 flow [2023-08-29 19:33:07,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:33:07,144 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 134 flow [2023-08-29 19:33:07,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-29 19:33:07,145 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-29 19:33:07,145 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 134 flow [2023-08-29 19:33:07,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 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:33:07,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:07,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:07,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-29 19:33:07,345 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:33:07,346 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:07,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1485378134, now seen corresponding path program 1 times [2023-08-29 19:33:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259073984] [2023-08-29 19:33:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:33:07,346 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:33:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:07,350 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:33:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-29 19:33:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:33:07,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-29 19:33:07,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:07,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:07,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:33:07,475 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-29 19:33:07,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-08-29 19:33:07,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:33:07,542 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:33:07,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:33:07,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259073984] [2023-08-29 19:33:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259073984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:33:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:33:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:33:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054385531] [2023-08-29 19:33:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:33:07,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:33:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:33:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:33:07,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-29 19:33:07,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:07,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-29 19:33:07,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:07,813 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-29 19:33:07,813 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-29 19:33:07,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 53 events. 15/53 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 2 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 190. Up to 38 conditions per place. [2023-08-29 19:33:07,814 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-29 19:33:07,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 26 transitions, 189 flow [2023-08-29 19:33:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:33:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:33:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-29 19:33:07,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315068493150685 [2023-08-29 19:33:07,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-29 19:33:07,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-29 19:33:07,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:07,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-29 19:33:07,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,817 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,817 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 134 flow. Second operand 4 states and 378 transitions. [2023-08-29 19:33:07,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 26 transitions, 189 flow [2023-08-29 19:33:07,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 181 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 19:33:07,818 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 142 flow [2023-08-29 19:33:07,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-29 19:33:07,819 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-29 19:33:07,819 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 142 flow [2023-08-29 19:33:07,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:07,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:07,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:07,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-29 19:33:08,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:33:08,027 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:08,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1197721165, now seen corresponding path program 1 times [2023-08-29 19:33:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985083985] [2023-08-29 19:33:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:33:08,028 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:33:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:08,029 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:33:08,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-29 19:33:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:33:08,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 19:33:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:08,185 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:33:08,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:33:08,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:33:08,243 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:33:08,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:33:08,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:33:08,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:33:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:33:08,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:33:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:33:10,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:10,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985083985] [2023-08-29 19:33:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985083985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:33:10,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:33:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-29 19:33:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408115230] [2023-08-29 19:33:10,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:33:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 19:33:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:10,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 19:33:10,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=98, Unknown=6, NotChecked=0, Total=132 [2023-08-29 19:33:12,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:14,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:33:16,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:18,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:20,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:23,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:33:23,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-29 19:33:23,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 142 flow. Second operand has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:23,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:23,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-29 19:33:23,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:25,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:29,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:30,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:32,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:34,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:36,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:38,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:40,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:33:42,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:44,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:46,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:46,929 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-08-29 19:33:46,929 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-29 19:33:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 47 events. 14/47 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 2 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 179. Up to 15 conditions per place. [2023-08-29 19:33:46,929 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 19 selfloop transitions, 9 changer transitions 0/28 dead transitions. [2023-08-29 19:33:46,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 28 transitions, 201 flow [2023-08-29 19:33:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:33:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:33:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 315 transitions. [2023-08-29 19:33:46,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2054794520547945 [2023-08-29 19:33:46,931 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 315 transitions. [2023-08-29 19:33:46,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 315 transitions. [2023-08-29 19:33:46,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:46,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 315 transitions. [2023-08-29 19:33:46,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.0) internal successors, (315), 7 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:46,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:46,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:46,933 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 142 flow. Second operand 7 states and 315 transitions. [2023-08-29 19:33:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 28 transitions, 201 flow [2023-08-29 19:33:46,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 28 transitions, 191 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 19:33:46,934 INFO L231 Difference]: Finished difference. Result has 44 places, 23 transitions, 143 flow [2023-08-29 19:33:46,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=44, PETRI_TRANSITIONS=23} [2023-08-29 19:33:46,934 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-29 19:33:46,934 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 143 flow [2023-08-29 19:33:46,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:46,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:46,935 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:46,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-08-29 19:33:47,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:33:47,142 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:47,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1720427431, now seen corresponding path program 2 times [2023-08-29 19:33:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088334386] [2023-08-29 19:33:47,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:33:47,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:33:47,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:47,144 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:33:47,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-08-29 19:33:47,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:33:47,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:33:47,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-29 19:33:47,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:47,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:33:47,242 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:33:47,242 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:33:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 19:33:47,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:33:47,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088334386] [2023-08-29 19:33:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088334386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:33:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:33:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:33:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835953683] [2023-08-29 19:33:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:33:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:33:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:33:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:33:47,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-29 19:33:47,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:47,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:33:47,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-29 19:33:47,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:33:47,554 INFO L130 PetriNetUnfolder]: 13/44 cut-off events. [2023-08-29 19:33:47,554 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 19:33:47,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 44 events. 13/44 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 177. Up to 34 conditions per place. [2023-08-29 19:33:47,554 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-29 19:33:47,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 24 transitions, 188 flow [2023-08-29 19:33:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:33:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:33:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-29 19:33:47,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-29 19:33:47,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-29 19:33:47,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-29 19:33:47,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:33:47,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-29 19:33:47,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:47,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:47,558 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:47,558 INFO L175 Difference]: Start difference. First operand has 44 places, 23 transitions, 143 flow. Second operand 5 states and 483 transitions. [2023-08-29 19:33:47,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 24 transitions, 188 flow [2023-08-29 19:33:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 24 transitions, 157 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-29 19:33:47,559 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 111 flow [2023-08-29 19:33:47,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-08-29 19:33:47,559 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-29 19:33:47,559 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 111 flow [2023-08-29 19:33:47,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:33:47,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:33:47,559 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:33:47,569 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 (18)] Ended with exit code 0 [2023-08-29 19:33:47,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:33:47,767 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:33:47,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:33:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1476230215, now seen corresponding path program 2 times [2023-08-29 19:33:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:33:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806994634] [2023-08-29 19:33:47,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:33:47,767 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:33:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:33:47,768 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:33:47,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-08-29 19:33:47,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:33:47,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:33:47,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 19:33:47,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:33:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:33:47,903 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:33:47,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:33:47,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:33:47,955 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:33:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:33:48,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:33:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:33:48,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:33:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806994634] [2023-08-29 19:33:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806994634] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:33:48,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:33:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-29 19:33:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327302766] [2023-08-29 19:33:48,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:33:48,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-29 19:33:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:33:48,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-29 19:33:48,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-08-29 19:33:50,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:52,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:55,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:33:58,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:03,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:03,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 219 [2023-08-29 19:34:03,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 111 flow. Second operand has 16 states, 16 states have (on average 71.625) internal successors, (1146), 16 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:03,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:34:03,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 219 [2023-08-29 19:34:03,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:34:04,170 INFO L130 PetriNetUnfolder]: 21/80 cut-off events. [2023-08-29 19:34:04,170 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-08-29 19:34:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 80 events. 21/80 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 3 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 256. Up to 18 conditions per place. [2023-08-29 19:34:04,170 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 35 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2023-08-29 19:34:04,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 324 flow [2023-08-29 19:34:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 19:34:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 19:34:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1246 transitions. [2023-08-29 19:34:04,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33467633628793986 [2023-08-29 19:34:04,173 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1246 transitions. [2023-08-29 19:34:04,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1246 transitions. [2023-08-29 19:34:04,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:34:04,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1246 transitions. [2023-08-29 19:34:04,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.29411764705883) internal successors, (1246), 17 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:04,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:04,180 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:04,180 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 111 flow. Second operand 17 states and 1246 transitions. [2023-08-29 19:34:04,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 324 flow [2023-08-29 19:34:04,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 319 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 19:34:04,181 INFO L231 Difference]: Finished difference. Result has 58 places, 31 transitions, 216 flow [2023-08-29 19:34:04,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=31} [2023-08-29 19:34:04,181 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-29 19:34:04,182 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 31 transitions, 216 flow [2023-08-29 19:34:04,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 71.625) internal successors, (1146), 16 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:04,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:34:04,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:34:04,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-08-29 19:34:04,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:34:04,390 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:34:04,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:34:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -505724294, now seen corresponding path program 1 times [2023-08-29 19:34:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:34:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148458644] [2023-08-29 19:34:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:34:04,391 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:34:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:34:04,392 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:34:04,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-08-29 19:34:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:34:04,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 19:34:04,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:34:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:34:04,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:04,521 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-29 19:34:04,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-08-29 19:34:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:04,612 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-08-29 19:34:04,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-08-29 19:34:04,648 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 19:34:04,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2023-08-29 19:34:04,676 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 19:34:04,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-29 19:34:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:04,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:34:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:04,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:34:04,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148458644] [2023-08-29 19:34:04,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148458644] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:34:04,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:34:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-08-29 19:34:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157324249] [2023-08-29 19:34:04,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:34:04,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 19:34:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:34:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 19:34:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=2, NotChecked=0, Total=210 [2023-08-29 19:34:06,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-29 19:34:06,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 31 transitions, 216 flow. Second operand has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:06,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:34:06,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-29 19:34:06,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:34:08,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:09,863 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-29 19:34:09,863 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2023-08-29 19:34:09,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 76 events. 21/76 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 1 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 306. Up to 24 conditions per place. [2023-08-29 19:34:09,864 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 33 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2023-08-29 19:34:09,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 47 transitions, 367 flow [2023-08-29 19:34:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 19:34:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 19:34:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2023-08-29 19:34:09,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2648401826484018 [2023-08-29 19:34:09,868 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2023-08-29 19:34:09,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2023-08-29 19:34:09,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:34:09,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2023-08-29 19:34:09,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:09,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:09,872 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:09,872 INFO L175 Difference]: Start difference. First operand has 58 places, 31 transitions, 216 flow. Second operand 12 states and 696 transitions. [2023-08-29 19:34:09,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 47 transitions, 367 flow [2023-08-29 19:34:09,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 47 transitions, 359 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 19:34:09,876 INFO L231 Difference]: Finished difference. Result has 70 places, 32 transitions, 268 flow [2023-08-29 19:34:09,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=268, PETRI_PLACES=70, PETRI_TRANSITIONS=32} [2023-08-29 19:34:09,877 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2023-08-29 19:34:09,877 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 32 transitions, 268 flow [2023-08-29 19:34:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:09,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:34:09,877 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:34:09,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-08-29 19:34:10,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:34:10,085 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:34:10,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:34:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1525546672, now seen corresponding path program 2 times [2023-08-29 19:34:10,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:34:10,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629042904] [2023-08-29 19:34:10,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:34:10,086 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:34:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:34:10,087 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:34:10,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-08-29 19:34:10,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 19:34:10,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:34:10,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 19:34:10,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:34:10,249 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:34:10,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:34:10,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:10,310 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:34:10,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:34:10,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 19:34:10,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:10,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:10,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:10,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:34:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:12,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:34:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629042904] [2023-08-29 19:34:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629042904] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:34:12,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:34:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-08-29 19:34:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781307870] [2023-08-29 19:34:12,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:34:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 19:34:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:34:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 19:34:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2023-08-29 19:34:15,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:17,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:19,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:22,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:24,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:27,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:27,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-29 19:34:27,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 32 transitions, 268 flow. Second operand has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:27,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:34:27,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-29 19:34:27,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:34:32,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:34,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:34,291 INFO L130 PetriNetUnfolder]: 20/71 cut-off events. [2023-08-29 19:34:34,292 INFO L131 PetriNetUnfolder]: For 171/171 co-relation queries the response was YES. [2023-08-29 19:34:34,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 71 events. 20/71 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 1 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 329. Up to 30 conditions per place. [2023-08-29 19:34:34,292 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 25 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2023-08-29 19:34:34,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 38 transitions, 352 flow [2023-08-29 19:34:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:34:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:34:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 516 transitions. [2023-08-29 19:34:34,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2617960426179604 [2023-08-29 19:34:34,296 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 516 transitions. [2023-08-29 19:34:34,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 516 transitions. [2023-08-29 19:34:34,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:34:34,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 516 transitions. [2023-08-29 19:34:34,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 57.333333333333336) internal successors, (516), 9 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:34,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:34,299 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:34,299 INFO L175 Difference]: Start difference. First operand has 70 places, 32 transitions, 268 flow. Second operand 9 states and 516 transitions. [2023-08-29 19:34:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 38 transitions, 352 flow [2023-08-29 19:34:34,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 38 transitions, 303 flow, removed 3 selfloop flow, removed 12 redundant places. [2023-08-29 19:34:34,301 INFO L231 Difference]: Finished difference. Result has 63 places, 31 transitions, 239 flow [2023-08-29 19:34:34,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=63, PETRI_TRANSITIONS=31} [2023-08-29 19:34:34,301 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-08-29 19:34:34,302 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 31 transitions, 239 flow [2023-08-29 19:34:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:34:34,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:34:34,307 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:34:34,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-08-29 19:34:34,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:34:34,513 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:34:34,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:34:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1317354381, now seen corresponding path program 3 times [2023-08-29 19:34:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:34:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166624331] [2023-08-29 19:34:34,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:34:34,514 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:34:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:34:34,515 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:34:34,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-08-29 19:34:34,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 19:34:34,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:34:34,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 19:34:34,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:34:34,681 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:34:34,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:34:34,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:34,759 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:34:34,794 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:34:34,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:34:34,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:34,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:34,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:34,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:34:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:35,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:34:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:34:37,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:34:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166624331] [2023-08-29 19:34:37,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166624331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:34:37,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:34:37,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-29 19:34:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566953647] [2023-08-29 19:34:37,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:34:37,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-29 19:34:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:34:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-29 19:34:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=200, Unknown=1, NotChecked=0, Total=240 [2023-08-29 19:34:39,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:41,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:43,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:48,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:50,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:52,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:54,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:34:57,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:34:59,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:01,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:03,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:05,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:35:07,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:10,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:12,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:14,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:16,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:18,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:21,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:23,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:25,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:27,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:29,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:29,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 219 [2023-08-29 19:35:29,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 31 transitions, 239 flow. Second operand has 16 states, 16 states have (on average 45.75) internal successors, (732), 16 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:29,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:35:29,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 219 [2023-08-29 19:35:29,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:35:32,209 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2023-08-29 19:35:32,209 INFO L131 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2023-08-29 19:35:32,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 66 events. 19/66 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 131 event pairs, 1 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2023-08-29 19:35:32,210 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2023-08-29 19:35:32,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 36 transitions, 311 flow [2023-08-29 19:35:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:35:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:35:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 425 transitions. [2023-08-29 19:35:32,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21562658548959918 [2023-08-29 19:35:32,213 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 425 transitions. [2023-08-29 19:35:32,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 425 transitions. [2023-08-29 19:35:32,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:35:32,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 425 transitions. [2023-08-29 19:35:32,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.22222222222222) internal successors, (425), 9 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:32,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:32,215 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:32,215 INFO L175 Difference]: Start difference. First operand has 63 places, 31 transitions, 239 flow. Second operand 9 states and 425 transitions. [2023-08-29 19:35:32,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 36 transitions, 311 flow [2023-08-29 19:35:32,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 36 transitions, 277 flow, removed 5 selfloop flow, removed 9 redundant places. [2023-08-29 19:35:32,216 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 215 flow [2023-08-29 19:35:32,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2023-08-29 19:35:32,217 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2023-08-29 19:35:32,217 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 215 flow [2023-08-29 19:35:32,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 45.75) internal successors, (732), 16 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:32,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:35:32,217 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:35:32,225 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 (22)] Ended with exit code 0 [2023-08-29 19:35:32,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:35:32,418 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:35:32,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:35:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -676044256, now seen corresponding path program 4 times [2023-08-29 19:35:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:35:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426307302] [2023-08-29 19:35:32,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 19:35:32,419 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:35:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:35:32,420 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:35:32,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-08-29 19:35:32,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 19:35:32,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:35:32,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-29 19:35:32,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:35:32,623 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:35:32,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:35:32,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,730 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:35:32,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:35:32,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:35:32,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:35:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:35:35,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:35:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426307302] [2023-08-29 19:35:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426307302] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:35:35,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:35:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-08-29 19:35:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999219351] [2023-08-29 19:35:35,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:35:35,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-29 19:35:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:35:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-29 19:35:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=235, Unknown=28, NotChecked=0, Total=306 [2023-08-29 19:35:36,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-29 19:35:36,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 215 flow. Second operand has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:36,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:35:36,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-29 19:35:36,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:35:36,846 INFO L130 PetriNetUnfolder]: 18/61 cut-off events. [2023-08-29 19:35:36,846 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2023-08-29 19:35:36,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 61 events. 18/61 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 2 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 259. Up to 20 conditions per place. [2023-08-29 19:35:36,847 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 23 selfloop transitions, 13 changer transitions 0/36 dead transitions. [2023-08-29 19:35:36,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 36 transitions, 299 flow [2023-08-29 19:35:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 19:35:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 19:35:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 443 transitions. [2023-08-29 19:35:36,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20228310502283106 [2023-08-29 19:35:36,849 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 443 transitions. [2023-08-29 19:35:36,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 443 transitions. [2023-08-29 19:35:36,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:35:36,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 443 transitions. [2023-08-29 19:35:36,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.3) internal successors, (443), 10 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:36,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 219.0) internal successors, (2409), 11 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:36,852 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 219.0) internal successors, (2409), 11 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:36,852 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 215 flow. Second operand 10 states and 443 transitions. [2023-08-29 19:35:36,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 36 transitions, 299 flow [2023-08-29 19:35:36,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 36 transitions, 269 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-29 19:35:36,854 INFO L231 Difference]: Finished difference. Result has 58 places, 28 transitions, 207 flow [2023-08-29 19:35:36,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=207, PETRI_PLACES=58, PETRI_TRANSITIONS=28} [2023-08-29 19:35:36,856 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-29 19:35:36,857 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 28 transitions, 207 flow [2023-08-29 19:35:36,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:36,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:35:36,857 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:35:36,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-08-29 19:35:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:35:37,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:35:37,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:35:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 769493405, now seen corresponding path program 5 times [2023-08-29 19:35:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:35:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285844399] [2023-08-29 19:35:37,069 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 19:35:37,069 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:35:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:35:37,070 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:35:37,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-08-29 19:35:37,207 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-29 19:35:37,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:35:37,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-29 19:35:37,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:35:37,238 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:35:37,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 19:35:37,275 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-29 19:35:37,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-29 19:35:37,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:35:37,375 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:35:37,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-29 19:35:37,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:35:37,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 58 [2023-08-29 19:35:37,563 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 19:35:37,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-08-29 19:35:37,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 19:35:38,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 19:35:38,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 19:35:38,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 19:35:38,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-08-29 19:35:38,477 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-29 19:35:38,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 40 [2023-08-29 19:35:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:35:38,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:35:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:35:41,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:35:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285844399] [2023-08-29 19:35:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285844399] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:35:41,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:35:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-08-29 19:35:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401806135] [2023-08-29 19:35:41,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:35:41,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-29 19:35:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:35:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-29 19:35:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=326, Unknown=4, NotChecked=0, Total=380 [2023-08-29 19:35:45,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:35:51,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 219 [2023-08-29 19:35:51,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 28 transitions, 207 flow. Second operand has 20 states, 20 states have (on average 63.6) internal successors, (1272), 20 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:35:51,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:35:51,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 219 [2023-08-29 19:35:51,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:02,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:04,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:36:05,782 INFO L130 PetriNetUnfolder]: 31/100 cut-off events. [2023-08-29 19:36:05,782 INFO L131 PetriNetUnfolder]: For 458/458 co-relation queries the response was YES. [2023-08-29 19:36:05,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 100 events. 31/100 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 236 event pairs, 0 based on Foata normal form. 6/106 useless extension candidates. Maximal degree in co-relation 454. Up to 25 conditions per place. [2023-08-29 19:36:05,783 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 40 selfloop transitions, 25 changer transitions 0/65 dead transitions. [2023-08-29 19:36:05,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 547 flow [2023-08-29 19:36:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-29 19:36:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-29 19:36:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1431 transitions. [2023-08-29 19:36:05,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2970112079701121 [2023-08-29 19:36:05,787 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1431 transitions. [2023-08-29 19:36:05,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1431 transitions. [2023-08-29 19:36:05,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:05,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1431 transitions. [2023-08-29 19:36:05,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 65.04545454545455) internal successors, (1431), 22 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:05,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 219.0) internal successors, (5037), 23 states have internal predecessors, (5037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:05,792 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 219.0) internal successors, (5037), 23 states have internal predecessors, (5037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:05,792 INFO L175 Difference]: Start difference. First operand has 58 places, 28 transitions, 207 flow. Second operand 22 states and 1431 transitions. [2023-08-29 19:36:05,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 547 flow [2023-08-29 19:36:05,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 480 flow, removed 8 selfloop flow, removed 12 redundant places. [2023-08-29 19:36:05,795 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 342 flow [2023-08-29 19:36:05,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=342, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2023-08-29 19:36:05,795 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2023-08-29 19:36:05,795 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 342 flow [2023-08-29 19:36:05,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 63.6) internal successors, (1272), 20 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:05,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:05,796 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:05,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-08-29 19:36:06,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:36:06,004 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:36:06,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash -299748857, now seen corresponding path program 3 times [2023-08-29 19:36:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:36:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888034033] [2023-08-29 19:36:06,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 19:36:06,005 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:36:06,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:36:06,006 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:36:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-08-29 19:36:06,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-29 19:36:06,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:36:06,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-29 19:36:06,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:36:06,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:06,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:06,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:06,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:36:06,210 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:36:06,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:36:06,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:36:06,289 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:36:06,308 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:36:06,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:36:06,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:06,554 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 19:36:06,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-08-29 19:36:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-29 19:36:06,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:36:06,719 WARN L839 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| (_ BitVec 32)) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) (.cse1 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|))) (or (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_460) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse0)) (_ bv0 8)) (not (bvult .cse0 .cse1)) (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)) .cse1)))) is different from false [2023-08-29 19:36:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2023-08-29 19:36:15,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:36:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888034033] [2023-08-29 19:36:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888034033] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:36:15,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:36:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-29 19:36:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349920280] [2023-08-29 19:36:15,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:36:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 19:36:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:36:15,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 19:36:15,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=4, NotChecked=22, Total=182 [2023-08-29 19:36:15,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 219 [2023-08-29 19:36:15,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 342 flow. Second operand has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:15,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:15,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 219 [2023-08-29 19:36:15,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:18,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 19:36:18,318 INFO L130 PetriNetUnfolder]: 25/82 cut-off events. [2023-08-29 19:36:18,319 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2023-08-29 19:36:18,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 82 events. 25/82 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 152 event pairs, 0 based on Foata normal form. 12/94 useless extension candidates. Maximal degree in co-relation 310. Up to 41 conditions per place. [2023-08-29 19:36:18,319 INFO L137 encePairwiseOnDemand]: 212/219 looper letters, 25 selfloop transitions, 12 changer transitions 0/37 dead transitions. [2023-08-29 19:36:18,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 37 transitions, 304 flow [2023-08-29 19:36:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 19:36:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 19:36:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2023-08-29 19:36:18,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18949771689497716 [2023-08-29 19:36:18,321 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 332 transitions. [2023-08-29 19:36:18,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 332 transitions. [2023-08-29 19:36:18,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:36:18,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 332 transitions. [2023-08-29 19:36:18,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:18,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:18,324 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:18,324 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 342 flow. Second operand 8 states and 332 transitions. [2023-08-29 19:36:18,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 37 transitions, 304 flow [2023-08-29 19:36:18,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 37 transitions, 212 flow, removed 18 selfloop flow, removed 18 redundant places. [2023-08-29 19:36:18,325 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 154 flow [2023-08-29 19:36:18,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-29 19:36:18,325 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-29 19:36:18,326 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 154 flow [2023-08-29 19:36:18,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:18,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:36:18,326 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:36:18,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-08-29 19:36:18,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:36:18,534 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:36:18,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:36:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1144776256, now seen corresponding path program 6 times [2023-08-29 19:36:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:36:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153795583] [2023-08-29 19:36:18,535 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 19:36:18,536 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:36:18,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:36:18,537 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:36:18,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-08-29 19:36:18,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-29 19:36:18,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:36:18,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-29 19:36:18,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:36:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:18,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:18,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:36:18,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-29 19:36:18,775 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-29 19:36:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-29 19:36:18,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:18,964 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:36:18,964 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:36:19,033 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-29 19:36:19,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-29 19:36:19,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-29 19:36:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:36:19,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 19:36:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:36:23,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:36:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153795583] [2023-08-29 19:36:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153795583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 19:36:23,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 19:36:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-08-29 19:36:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352201796] [2023-08-29 19:36:23,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 19:36:23,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 19:36:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:36:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 19:36:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=386, Unknown=7, NotChecked=0, Total=462 [2023-08-29 19:36:30,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 219 [2023-08-29 19:36:30,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 154 flow. Second operand has 22 states, 22 states have (on average 45.54545454545455) internal successors, (1002), 22 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:36:30,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:36:30,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 219 [2023-08-29 19:36:30,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:36:38,910 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:36:50,814 WARN L222 SmtUtils]: Spent 10.48s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:36:52,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:37:01,503 WARN L222 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:12,304 WARN L222 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:14,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:37:21,337 WARN L222 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 19:37:23,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 19:37:23,839 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-08-29 19:37:23,839 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-29 19:37:23,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 69 events. 20/69 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 10/79 useless extension candidates. Maximal degree in co-relation 196. Up to 18 conditions per place. [2023-08-29 19:37:23,840 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 31 selfloop transitions, 19 changer transitions 0/50 dead transitions. [2023-08-29 19:37:23,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 50 transitions, 266 flow [2023-08-29 19:37:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 19:37:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 19:37:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 935 transitions. [2023-08-29 19:37:23,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2134703196347032 [2023-08-29 19:37:23,842 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 935 transitions. [2023-08-29 19:37:23,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 935 transitions. [2023-08-29 19:37:23,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:37:23,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 935 transitions. [2023-08-29 19:37:23,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 46.75) internal successors, (935), 20 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:23,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:23,846 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:23,847 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 154 flow. Second operand 20 states and 935 transitions. [2023-08-29 19:37:23,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 50 transitions, 266 flow [2023-08-29 19:37:23,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 19:37:23,848 INFO L231 Difference]: Finished difference. Result has 61 places, 29 transitions, 140 flow [2023-08-29 19:37:23,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=29} [2023-08-29 19:37:23,848 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-29 19:37:23,848 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 29 transitions, 140 flow [2023-08-29 19:37:23,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 45.54545454545455) internal successors, (1002), 22 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:37:23,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:37:23,849 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:23,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-08-29 19:37:24,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:37:24,057 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-29 19:37:24,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:37:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1128522691, now seen corresponding path program 7 times [2023-08-29 19:37:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:37:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340646128] [2023-08-29 19:37:24,058 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-29 19:37:24,058 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:37:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:37:24,059 INFO L229 MonitoredProcess]: Starting monitored process 27 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:37:24,061 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 (27)] Waiting until timeout for monitored process [2023-08-29 19:37:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:37:24,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:37:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:37:24,416 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 19:37:24,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:37:24,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-29 19:37:24,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-29 19:37:24,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-29 19:37:24,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-29 19:37:24,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-29 19:37:24,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-29 19:37:24,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-29 19:37:24,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-29 19:37:24,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-29 19:37:24,438 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 (27)] Ended with exit code 0 [2023-08-29 19:37:24,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:37:24,633 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:37:24,637 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:37:24,637 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:37:24,653 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,654 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,655 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,656 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,657 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,658 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,659 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,660 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-29 19:37:24,661 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-29 19:37:24,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:37:24 BasicIcfg [2023-08-29 19:37:24,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:37:24,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:37:24,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:37:24,675 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:37:24,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:32:17" (3/4) ... [2023-08-29 19:37:24,677 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:37:24,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:37:24,678 INFO L158 Benchmark]: Toolchain (without parser) took 308549.69ms. Allocated memory was 60.8MB in the beginning and 132.1MB in the end (delta: 71.3MB). Free memory was 29.5MB in the beginning and 96.9MB in the end (delta: -67.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,678 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:37:24,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.39ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 29.3MB in the beginning and 35.0MB in the end (delta: -5.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.99ms. Allocated memory is still 73.4MB. Free memory was 35.0MB in the beginning and 32.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,678 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 73.4MB. Free memory was 32.5MB in the beginning and 48.5MB in the end (delta: -15.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,678 INFO L158 Benchmark]: RCFGBuilder took 443.82ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 47.4MB in the end (delta: 1.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,679 INFO L158 Benchmark]: TraceAbstraction took 307472.41ms. Allocated memory was 73.4MB in the beginning and 132.1MB in the end (delta: 58.7MB). Free memory was 46.7MB in the beginning and 96.9MB in the end (delta: -50.1MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2023-08-29 19:37:24,679 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 132.1MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:37:24,679 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 28.8MB in the beginning and 28.8MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.39ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 29.3MB in the beginning and 35.0MB in the end (delta: -5.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.99ms. Allocated memory is still 73.4MB. Free memory was 35.0MB in the beginning and 32.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 73.4MB. Free memory was 32.5MB in the beginning and 48.5MB in the end (delta: -15.9MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 443.82ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 47.4MB in the end (delta: 1.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 307472.41ms. Allocated memory was 73.4MB in the beginning and 132.1MB in the end (delta: 58.7MB). Free memory was 46.7MB in the beginning and 96.9MB in the end (delta: -50.1MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 132.1MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 104 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 181, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 365, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 181, unknown conditional: 0, unknown unconditional: 181] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=1, t1={7:0}, t2={11:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=1, arg={0:0}, t1={7:0}, t2={11:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=1, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=2, t1={7:0}, t2={11:0}, v={5:0}] [L1125] 0 \read(t2) VAL [\read(t2)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 139 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 307.3s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 261.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 362 mSolverCounterUnknown, 5490 SdHoareTripleChecker+Valid, 199.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4362 mSDsluCounter, 3691 SdHoareTripleChecker+Invalid, 196.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 69 IncrementalHoareTripleChecker+Unchecked, 3509 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16294 IncrementalHoareTripleChecker+Invalid, 17169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 182 mSDtfsCounter, 16294 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 272 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 86.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=23, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 283 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 385 ConstructedInterpolants, 150 QuantifiedInterpolants, 7416 SizeOfPredicates, 125 NumberOfNonLiveVariables, 2634 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 36 InterpolantComputations, 14 PerfectInterpolantSequences, 52/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 19:37:24,770 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