./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/weaver/mult-dist.wvr.c -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 c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 05:27:57,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 05:27:57,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 05:27:57,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 05:27:57,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 05:27:57,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 05:27:57,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 05:27:57,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 05:27:57,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 05:27:57,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 05:27:57,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 05:27:57,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 05:27:57,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 05:27:57,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 05:27:57,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 05:27:57,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 05:27:57,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 05:27:57,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 05:27:57,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 05:27:57,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 05:27:57,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 05:27:57,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 05:27:57,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 05:27:57,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 05:27:57,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 05:27:57,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 05:27:57,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 05:27:57,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 05:27:57,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 05:27:57,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 05:27:57,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 05:27:57,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 05:27:57,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 05:27:57,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 05:27:57,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 05:27:57,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 05:27:57,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 05:27:57,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 05:27:57,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 05:27:57,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 05:27:57,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 05:27:57,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 05:27:57,518 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 05:27:57,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 05:27:57,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 05:27:57,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 05:27:57,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 05:27:57,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 05:27:57,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 05:27:57,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 05:27:57,521 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 05:27:57,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 05:27:57,522 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 05:27:57,522 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 05:27:57,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 05:27:57,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 05:27:57,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 05:27:57,523 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 05:27:57,523 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 05:27:57,524 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 05:27:57,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 05:27:57,524 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 05:27:57,524 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 05:27:57,524 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 05:27:57,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 05:27:57,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 05:27:57,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 05:27:57,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 05:27:57,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 05:27:57,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 05:27:57,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 05:27:57,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 05:27:57,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 05:27:57,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 05:27:57,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 05:27:57,527 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 05:27:57,527 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 -> c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 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 -> TOGETHER [2023-08-30 05:27:57,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 05:27:57,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 05:27:57,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 05:27:57,827 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 05:27:57,827 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 05:27:57,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-08-30 05:27:59,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 05:27:59,236 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 05:27:59,236 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-08-30 05:27:59,241 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b687990b/cf34386f080b4dab9a97c61b15e95d4c/FLAG64f5e1fa1 [2023-08-30 05:27:59,263 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b687990b/cf34386f080b4dab9a97c61b15e95d4c [2023-08-30 05:27:59,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 05:27:59,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 05:27:59,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 05:27:59,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 05:27:59,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 05:27:59,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0f0869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59, skipping insertion in model container [2023-08-30 05:27:59,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 05:27:59,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 05:27:59,467 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-08-30 05:27:59,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 05:27:59,487 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 05:27:59,519 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c[2116,2129] [2023-08-30 05:27:59,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 05:27:59,540 INFO L208 MainTranslator]: Completed translation [2023-08-30 05:27:59,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59 WrapperNode [2023-08-30 05:27:59,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 05:27:59,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 05:27:59,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 05:27:59,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 05:27:59,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,585 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-08-30 05:27:59,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 05:27:59,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 05:27:59,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 05:27:59,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 05:27:59,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 05:27:59,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 05:27:59,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 05:27:59,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 05:27:59,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (1/1) ... [2023-08-30 05:27:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 05:27:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:27:59,661 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-30 05:27:59,684 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-30 05:27:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 05:27:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 05:27:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 05:27:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 05:27:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 05:27:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 05:27:59,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 05:27:59,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 05:27:59,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 05:27:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 05:27:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 05:27:59,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 05:27:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 05:27:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 05:27:59,716 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 05:27:59,808 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 05:27:59,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 05:28:00,014 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 05:28:00,020 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 05:28:00,020 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 05:28:00,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:28:00 BoogieIcfgContainer [2023-08-30 05:28:00,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 05:28:00,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 05:28:00,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 05:28:00,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 05:28:00,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:27:59" (1/3) ... [2023-08-30 05:28:00,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:28:00, skipping insertion in model container [2023-08-30 05:28:00,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:27:59" (2/3) ... [2023-08-30 05:28:00,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:28:00, skipping insertion in model container [2023-08-30 05:28:00,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:28:00" (3/3) ... [2023-08-30 05:28:00,030 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-08-30 05:28:00,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 05:28:00,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-30 05:28:00,047 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 05:28:00,175 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 05:28:00,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 266 flow [2023-08-30 05:28:00,307 INFO L130 PetriNetUnfolder]: 7/118 cut-off events. [2023-08-30 05:28:00,308 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:00,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 7/118 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-30 05:28:00,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 121 transitions, 266 flow [2023-08-30 05:28:00,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 246 flow [2023-08-30 05:28:00,321 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 05:28:00,335 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 114 transitions, 246 flow [2023-08-30 05:28:00,341 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 246 flow [2023-08-30 05:28:00,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 246 flow [2023-08-30 05:28:00,383 INFO L130 PetriNetUnfolder]: 7/114 cut-off events. [2023-08-30 05:28:00,383 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:00,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 7/114 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-30 05:28:00,387 INFO L119 LiptonReduction]: Number of co-enabled transitions 1680 [2023-08-30 05:28:03,754 INFO L134 LiptonReduction]: Checked pairs total: 1766 [2023-08-30 05:28:03,755 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 05:28:03,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 05:28:03,771 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;@134d24c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 05:28:03,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-30 05:28:03,772 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 05:28:03,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 05:28:03,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:03,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 05:28:03,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:03,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash 449, now seen corresponding path program 1 times [2023-08-30 05:28:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179349146] [2023-08-30 05:28:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:03,861 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-30 05:28:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179349146] [2023-08-30 05:28:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179349146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 05:28:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027624134] [2023-08-30 05:28:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:03,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 05:28:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 05:28:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 05:28:03,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2023-08-30 05:28:03,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:03,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:03,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2023-08-30 05:28:03,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:04,066 INFO L130 PetriNetUnfolder]: 556/763 cut-off events. [2023-08-30 05:28:04,067 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 05:28:04,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 763 events. 556/763 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2742 event pairs, 252 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 1210. Up to 752 conditions per place. [2023-08-30 05:28:04,077 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 05:28:04,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 140 flow [2023-08-30 05:28:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 05:28:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 05:28:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2023-08-30 05:28:04,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2023-08-30 05:28:04,093 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2023-08-30 05:28:04,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2023-08-30 05:28:04,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:04,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2023-08-30 05:28:04,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,107 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,108 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 88 flow. Second operand 2 states and 252 transitions. [2023-08-30 05:28:04,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 140 flow [2023-08-30 05:28:04,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 05:28:04,113 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 70 flow [2023-08-30 05:28:04,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-08-30 05:28:04,118 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-30 05:28:04,118 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 70 flow [2023-08-30 05:28:04,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:04,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 05:28:04,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 05:28:04,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:04,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 440291, now seen corresponding path program 1 times [2023-08-30 05:28:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:04,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056779903] [2023-08-30 05:28:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:04,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:04,287 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-30 05:28:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056779903] [2023-08-30 05:28:04,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056779903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:04,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:04,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653411452] [2023-08-30 05:28:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:04,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:04,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:04,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:04,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-30 05:28:04,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:04,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-30 05:28:04,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:04,425 INFO L130 PetriNetUnfolder]: 529/724 cut-off events. [2023-08-30 05:28:04,425 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:04,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 724 events. 529/724 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2568 event pairs, 239 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 1449. Up to 712 conditions per place. [2023-08-30 05:28:04,430 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 26 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-30 05:28:04,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 120 flow [2023-08-30 05:28:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-30 05:28:04,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47270114942528735 [2023-08-30 05:28:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-30 05:28:04,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-30 05:28:04,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:04,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-30 05:28:04,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,437 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 329 transitions. [2023-08-30 05:28:04,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 120 flow [2023-08-30 05:28:04,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 05:28:04,438 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 68 flow [2023-08-30 05:28:04,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-30 05:28:04,439 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-30 05:28:04,439 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 68 flow [2023-08-30 05:28:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:04,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 05:28:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 05:28:04,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:04,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 440290, now seen corresponding path program 1 times [2023-08-30 05:28:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310167678] [2023-08-30 05:28:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:04,557 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-30 05:28:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310167678] [2023-08-30 05:28:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310167678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895643470] [2023-08-30 05:28:04,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:04,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 232 [2023-08-30 05:28:04,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:04,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 232 [2023-08-30 05:28:04,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:04,669 INFO L130 PetriNetUnfolder]: 502/685 cut-off events. [2023-08-30 05:28:04,669 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:04,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 685 events. 502/685 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2367 event pairs, 226 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 1372. Up to 673 conditions per place. [2023-08-30 05:28:04,674 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 24 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2023-08-30 05:28:04,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 114 flow [2023-08-30 05:28:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-30 05:28:04,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2023-08-30 05:28:04,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-30 05:28:04,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-30 05:28:04,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:04,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-30 05:28:04,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,680 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 68 flow. Second operand 3 states and 342 transitions. [2023-08-30 05:28:04,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 114 flow [2023-08-30 05:28:04,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:04,681 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 65 flow [2023-08-30 05:28:04,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=65, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-08-30 05:28:04,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-08-30 05:28:04,682 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 65 flow [2023-08-30 05:28:04,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:04,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 05:28:04,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 05:28:04,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:04,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 423127422, now seen corresponding path program 1 times [2023-08-30 05:28:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249037309] [2023-08-30 05:28:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:04,749 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-30 05:28:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249037309] [2023-08-30 05:28:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249037309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:04,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594963985] [2023-08-30 05:28:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:04,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-30 05:28:04,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:04,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-30 05:28:04,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:04,854 INFO L130 PetriNetUnfolder]: 476/647 cut-off events. [2023-08-30 05:28:04,854 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 647 events. 476/647 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2206 event pairs, 214 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 1297. Up to 635 conditions per place. [2023-08-30 05:28:04,860 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 22 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-30 05:28:04,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 107 flow [2023-08-30 05:28:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-30 05:28:04,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2023-08-30 05:28:04,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-30 05:28:04,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-30 05:28:04,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:04,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-30 05:28:04,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,866 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 65 flow. Second operand 3 states and 328 transitions. [2023-08-30 05:28:04,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 107 flow [2023-08-30 05:28:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:04,868 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 62 flow [2023-08-30 05:28:04,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-30 05:28:04,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -10 predicate places. [2023-08-30 05:28:04,869 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 62 flow [2023-08-30 05:28:04,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:04,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 05:28:04,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 05:28:04,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:04,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 423127421, now seen corresponding path program 1 times [2023-08-30 05:28:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743562736] [2023-08-30 05:28:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:04,913 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-30 05:28:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743562736] [2023-08-30 05:28:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743562736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:04,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067192508] [2023-08-30 05:28:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:04,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:04,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-30 05:28:04,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:04,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:04,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-30 05:28:04,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:05,004 INFO L130 PetriNetUnfolder]: 450/609 cut-off events. [2023-08-30 05:28:05,004 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:05,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 609 events. 450/609 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2039 event pairs, 202 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1222. Up to 597 conditions per place. [2023-08-30 05:28:05,028 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 20 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-08-30 05:28:05,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 100 flow [2023-08-30 05:28:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 05:28:05,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640804597701149 [2023-08-30 05:28:05,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 05:28:05,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 05:28:05,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:05,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 05:28:05,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 62 flow. Second operand 3 states and 323 transitions. [2023-08-30 05:28:05,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 100 flow [2023-08-30 05:28:05,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:05,041 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 59 flow [2023-08-30 05:28:05,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=59, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-30 05:28:05,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-08-30 05:28:05,044 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 59 flow [2023-08-30 05:28:05,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:05,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:05,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 05:28:05,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:05,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1396432710, now seen corresponding path program 1 times [2023-08-30 05:28:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91718590] [2023-08-30 05:28:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:05,112 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-30 05:28:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91718590] [2023-08-30 05:28:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91718590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889697283] [2023-08-30 05:28:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:05,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:05,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:05,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:05,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-30 05:28:05,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:05,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-30 05:28:05,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:05,212 INFO L130 PetriNetUnfolder]: 351/483 cut-off events. [2023-08-30 05:28:05,213 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 483 events. 351/483 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1558 event pairs, 157 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 971. Up to 471 conditions per place. [2023-08-30 05:28:05,216 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 19 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2023-08-30 05:28:05,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 97 flow [2023-08-30 05:28:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 05:28:05,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-08-30 05:28:05,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 05:28:05,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 05:28:05,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:05,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 05:28:05,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,221 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 59 flow. Second operand 3 states and 324 transitions. [2023-08-30 05:28:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 97 flow [2023-08-30 05:28:05,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:05,222 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 58 flow [2023-08-30 05:28:05,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-30 05:28:05,225 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-08-30 05:28:05,225 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 58 flow [2023-08-30 05:28:05,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:05,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:05,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 05:28:05,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:05,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1396432712, now seen corresponding path program 1 times [2023-08-30 05:28:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695153783] [2023-08-30 05:28:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:05,335 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-30 05:28:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695153783] [2023-08-30 05:28:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695153783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 05:28:05,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151776901] [2023-08-30 05:28:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:05,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 05:28:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 05:28:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 05:28:05,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-30 05:28:05,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 58 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-30 05:28:05,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:05,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-30 05:28:05,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:05,465 INFO L130 PetriNetUnfolder]: 252/357 cut-off events. [2023-08-30 05:28:05,466 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 05:28:05,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 357 events. 252/357 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1098 event pairs, 112 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 720. Up to 345 conditions per place. [2023-08-30 05:28:05,468 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 18 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-08-30 05:28:05,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 94 flow [2023-08-30 05:28:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-30 05:28:05,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2023-08-30 05:28:05,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-30 05:28:05,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-30 05:28:05,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:05,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-30 05:28:05,471 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-30 05:28:05,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,473 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-08-30 05:28:05,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 94 flow [2023-08-30 05:28:05,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 93 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:05,474 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 57 flow [2023-08-30 05:28:05,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-08-30 05:28:05,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-08-30 05:28:05,475 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 57 flow [2023-08-30 05:28:05,475 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-30 05:28:05,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:05,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:05,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 05:28:05,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:05,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1966083998, now seen corresponding path program 1 times [2023-08-30 05:28:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179274663] [2023-08-30 05:28:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:05,839 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-30 05:28:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179274663] [2023-08-30 05:28:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179274663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 05:28:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139568658] [2023-08-30 05:28:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:05,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 05:28:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 05:28:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 05:28:05,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2023-08-30 05:28:05,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:05,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2023-08-30 05:28:05,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:05,920 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2023-08-30 05:28:05,920 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 05:28:05,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 506 events. 359/506 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1628 event pairs, 39 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 1028. Up to 421 conditions per place. [2023-08-30 05:28:05,923 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-08-30 05:28:05,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 164 flow [2023-08-30 05:28:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 05:28:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 05:28:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-30 05:28:05,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-08-30 05:28:05,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-30 05:28:05,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-30 05:28:05,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:05,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-30 05:28:05,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,928 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 57 flow. Second operand 3 states and 357 transitions. [2023-08-30 05:28:05,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 164 flow [2023-08-30 05:28:05,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:05,930 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 82 flow [2023-08-30 05:28:05,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 05:28:05,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-08-30 05:28:05,931 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 82 flow [2023-08-30 05:28:05,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:05,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:05,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:05,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 05:28:05,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:05,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -451109797, now seen corresponding path program 1 times [2023-08-30 05:28:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184487062] [2023-08-30 05:28:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184487062] [2023-08-30 05:28:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184487062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:28:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415197513] [2023-08-30 05:28:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:06,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:28:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:28:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:28:06,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 05:28:06,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:06,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:06,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 05:28:06,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:06,533 INFO L130 PetriNetUnfolder]: 638/974 cut-off events. [2023-08-30 05:28:06,533 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2023-08-30 05:28:06,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 974 events. 638/974 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3838 event pairs, 158 based on Foata normal form. 18/992 useless extension candidates. Maximal degree in co-relation 2343. Up to 394 conditions per place. [2023-08-30 05:28:06,538 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 71 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2023-08-30 05:28:06,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 89 transitions, 440 flow [2023-08-30 05:28:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:28:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:28:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2023-08-30 05:28:06,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-08-30 05:28:06,541 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 754 transitions. [2023-08-30 05:28:06,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 754 transitions. [2023-08-30 05:28:06,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:06,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 754 transitions. [2023-08-30 05:28:06,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:06,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:06,547 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:06,547 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 82 flow. Second operand 7 states and 754 transitions. [2023-08-30 05:28:06,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 89 transitions, 440 flow [2023-08-30 05:28:06,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 89 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:06,549 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 145 flow [2023-08-30 05:28:06,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-30 05:28:06,550 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 05:28:06,550 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 145 flow [2023-08-30 05:28:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:06,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:06,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:06,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 05:28:06,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:06,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1630608704, now seen corresponding path program 1 times [2023-08-30 05:28:06,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:06,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493192526] [2023-08-30 05:28:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:06,735 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-30 05:28:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493192526] [2023-08-30 05:28:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493192526] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65653219] [2023-08-30 05:28:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:06,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:28:06,741 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-30 05:28:06,768 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-30 05:28:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:06,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 05:28:06,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:28:07,061 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-30 05:28:07,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:28:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65653219] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:28:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 9 [2023-08-30 05:28:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274434392] [2023-08-30 05:28:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:07,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:28:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:28:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:28:07,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:28:07,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:07,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:07,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:28:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:07,651 INFO L130 PetriNetUnfolder]: 815/1235 cut-off events. [2023-08-30 05:28:07,651 INFO L131 PetriNetUnfolder]: For 1371/1417 co-relation queries the response was YES. [2023-08-30 05:28:07,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1235 events. 815/1235 cut-off events. For 1371/1417 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5260 event pairs, 193 based on Foata normal form. 47/1265 useless extension candidates. Maximal degree in co-relation 3869. Up to 398 conditions per place. [2023-08-30 05:28:07,660 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 94 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2023-08-30 05:28:07,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 112 transitions, 668 flow [2023-08-30 05:28:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:28:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:28:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-08-30 05:28:07,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47790948275862066 [2023-08-30 05:28:07,664 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-08-30 05:28:07,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-08-30 05:28:07,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:07,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-08-30 05:28:07,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:07,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:07,671 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:07,671 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 145 flow. Second operand 8 states and 887 transitions. [2023-08-30 05:28:07,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 112 transitions, 668 flow [2023-08-30 05:28:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 112 transitions, 640 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 05:28:07,680 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 270 flow [2023-08-30 05:28:07,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 05:28:07,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-30 05:28:07,682 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 270 flow [2023-08-30 05:28:07,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:07,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:07,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:07,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 05:28:07,888 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,SelfDestructingSolverStorable9 [2023-08-30 05:28:07,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:07,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1885073951, now seen corresponding path program 1 times [2023-08-30 05:28:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123078412] [2023-08-30 05:28:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123078412] [2023-08-30 05:28:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123078412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:28:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305592657] [2023-08-30 05:28:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:28:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:28:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:28:08,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 05:28:08,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:08,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:08,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 05:28:08,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:08,539 INFO L130 PetriNetUnfolder]: 1126/1709 cut-off events. [2023-08-30 05:28:08,540 INFO L131 PetriNetUnfolder]: For 4606/4606 co-relation queries the response was YES. [2023-08-30 05:28:08,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6513 conditions, 1709 events. 1126/1709 cut-off events. For 4606/4606 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7472 event pairs, 276 based on Foata normal form. 20/1729 useless extension candidates. Maximal degree in co-relation 6498. Up to 728 conditions per place. [2023-08-30 05:28:08,553 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 99 selfloop transitions, 29 changer transitions 13/141 dead transitions. [2023-08-30 05:28:08,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 141 transitions, 1066 flow [2023-08-30 05:28:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 05:28:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 05:28:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1057 transitions. [2023-08-30 05:28:08,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556034482758621 [2023-08-30 05:28:08,557 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1057 transitions. [2023-08-30 05:28:08,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1057 transitions. [2023-08-30 05:28:08,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:08,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1057 transitions. [2023-08-30 05:28:08,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:08,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:08,566 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:08,566 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 270 flow. Second operand 10 states and 1057 transitions. [2023-08-30 05:28:08,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 141 transitions, 1066 flow [2023-08-30 05:28:08,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 1052 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-30 05:28:08,582 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 511 flow [2023-08-30 05:28:08,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=511, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-30 05:28:08,583 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-30 05:28:08,583 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 511 flow [2023-08-30 05:28:08,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:08,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:08,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:08,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 05:28:08,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:08,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2144658137, now seen corresponding path program 2 times [2023-08-30 05:28:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899202263] [2023-08-30 05:28:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:08,807 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-30 05:28:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899202263] [2023-08-30 05:28:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899202263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049673273] [2023-08-30 05:28:08,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 05:28:08,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:28:08,810 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-30 05:28:08,812 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-30 05:28:08,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 05:28:08,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:28:08,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 05:28:08,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:28:09,035 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-30 05:28:09,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:28:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049673273] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:28:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-08-30 05:28:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864868] [2023-08-30 05:28:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:09,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:28:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:28:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:28:09,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:28:09,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:09,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:09,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:28:09,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:09,793 INFO L130 PetriNetUnfolder]: 1482/2209 cut-off events. [2023-08-30 05:28:09,794 INFO L131 PetriNetUnfolder]: For 9998/10096 co-relation queries the response was YES. [2023-08-30 05:28:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 2209 events. 1482/2209 cut-off events. For 9998/10096 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9945 event pairs, 356 based on Foata normal form. 102/2295 useless extension candidates. Maximal degree in co-relation 10466. Up to 755 conditions per place. [2023-08-30 05:28:09,812 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 117 selfloop transitions, 26 changer transitions 3/148 dead transitions. [2023-08-30 05:28:09,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 148 transitions, 1303 flow [2023-08-30 05:28:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:28:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:28:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2023-08-30 05:28:09,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898706896551724 [2023-08-30 05:28:09,816 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2023-08-30 05:28:09,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2023-08-30 05:28:09,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:09,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2023-08-30 05:28:09,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:09,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:09,821 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:09,821 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 511 flow. Second operand 8 states and 889 transitions. [2023-08-30 05:28:09,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 148 transitions, 1303 flow [2023-08-30 05:28:09,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1221 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-30 05:28:09,844 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 683 flow [2023-08-30 05:28:09,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=683, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-30 05:28:09,846 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-30 05:28:09,846 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 683 flow [2023-08-30 05:28:09,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:09,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:09,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:09,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 05:28:10,053 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-30 05:28:10,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:10,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -127297912, now seen corresponding path program 2 times [2023-08-30 05:28:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465823500] [2023-08-30 05:28:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:10,243 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-30 05:28:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465823500] [2023-08-30 05:28:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465823500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753416368] [2023-08-30 05:28:10,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 05:28:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:28:10,246 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-30 05:28:10,248 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-30 05:28:10,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 05:28:10,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:28:10,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 05:28:10,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:28:10,507 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-30 05:28:10,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:28:11,456 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-30 05:28:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753416368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:28:11,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:28:11,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2023-08-30 05:28:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972973130] [2023-08-30 05:28:11,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:28:11,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 05:28:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 05:28:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-08-30 05:28:11,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 232 [2023-08-30 05:28:11,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 683 flow. Second operand has 14 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:11,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:11,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 232 [2023-08-30 05:28:11,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:13,028 INFO L130 PetriNetUnfolder]: 2313/3566 cut-off events. [2023-08-30 05:28:13,029 INFO L131 PetriNetUnfolder]: For 21403/21403 co-relation queries the response was YES. [2023-08-30 05:28:13,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17805 conditions, 3566 events. 2313/3566 cut-off events. For 21403/21403 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18289 event pairs, 384 based on Foata normal form. 56/3622 useless extension candidates. Maximal degree in co-relation 17778. Up to 1292 conditions per place. [2023-08-30 05:28:13,072 INFO L137 encePairwiseOnDemand]: 222/232 looper letters, 226 selfloop transitions, 76 changer transitions 1/303 dead transitions. [2023-08-30 05:28:13,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 303 transitions, 2854 flow [2023-08-30 05:28:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 05:28:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 05:28:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2106 transitions. [2023-08-30 05:28:13,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538793103448276 [2023-08-30 05:28:13,080 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2106 transitions. [2023-08-30 05:28:13,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2106 transitions. [2023-08-30 05:28:13,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:13,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2106 transitions. [2023-08-30 05:28:13,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 105.3) internal successors, (2106), 20 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:13,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 232.0) internal successors, (4872), 21 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:13,092 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 232.0) internal successors, (4872), 21 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:13,092 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 683 flow. Second operand 20 states and 2106 transitions. [2023-08-30 05:28:13,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 303 transitions, 2854 flow [2023-08-30 05:28:13,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 303 transitions, 2784 flow, removed 35 selfloop flow, removed 0 redundant places. [2023-08-30 05:28:13,211 INFO L231 Difference]: Finished difference. Result has 111 places, 133 transitions, 1643 flow [2023-08-30 05:28:13,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1643, PETRI_PLACES=111, PETRI_TRANSITIONS=133} [2023-08-30 05:28:13,212 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2023-08-30 05:28:13,212 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 1643 flow [2023-08-30 05:28:13,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:13,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:13,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:13,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 05:28:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:13,420 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:13,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 985135421, now seen corresponding path program 3 times [2023-08-30 05:28:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337514857] [2023-08-30 05:28:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337514857] [2023-08-30 05:28:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337514857] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:13,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282550552] [2023-08-30 05:28:13,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 05:28:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:28:13,608 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-30 05:28:13,634 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-30 05:28:13,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 05:28:13,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:28:13,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 05:28:13,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:28:13,793 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-30 05:28:13,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:28:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282550552] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:13,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:28:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 9 [2023-08-30 05:28:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829487464] [2023-08-30 05:28:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:13,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:28:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:28:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-30 05:28:13,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:28:13,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 1643 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:13,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:13,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:28:13,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:14,833 INFO L130 PetriNetUnfolder]: 2593/3980 cut-off events. [2023-08-30 05:28:14,834 INFO L131 PetriNetUnfolder]: For 51122/51289 co-relation queries the response was YES. [2023-08-30 05:28:14,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25874 conditions, 3980 events. 2593/3980 cut-off events. For 51122/51289 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20741 event pairs, 608 based on Foata normal form. 145/4106 useless extension candidates. Maximal degree in co-relation 25831. Up to 1410 conditions per place. [2023-08-30 05:28:14,874 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 164 selfloop transitions, 61 changer transitions 0/228 dead transitions. [2023-08-30 05:28:14,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 228 transitions, 2877 flow [2023-08-30 05:28:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:28:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:28:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2023-08-30 05:28:14,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898706896551724 [2023-08-30 05:28:14,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2023-08-30 05:28:14,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2023-08-30 05:28:14,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:14,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2023-08-30 05:28:14,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:14,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:14,883 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:14,883 INFO L175 Difference]: Start difference. First operand has 111 places, 133 transitions, 1643 flow. Second operand 8 states and 889 transitions. [2023-08-30 05:28:14,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 228 transitions, 2877 flow [2023-08-30 05:28:14,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 228 transitions, 2659 flow, removed 109 selfloop flow, removed 0 redundant places. [2023-08-30 05:28:14,996 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 1936 flow [2023-08-30 05:28:14,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1936, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2023-08-30 05:28:14,998 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2023-08-30 05:28:14,998 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1936 flow [2023-08-30 05:28:14,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:14,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:14,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:15,005 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-30 05:28:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:15,205 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:15,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -457190798, now seen corresponding path program 3 times [2023-08-30 05:28:15,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:15,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376933783] [2023-08-30 05:28:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:28:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376933783] [2023-08-30 05:28:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376933783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:28:15,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:28:15,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:28:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207432149] [2023-08-30 05:28:15,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:28:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:28:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:28:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:28:15,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 05:28:15,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:15,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:15,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 05:28:15,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:28:16,215 INFO L130 PetriNetUnfolder]: 2671/4113 cut-off events. [2023-08-30 05:28:16,215 INFO L131 PetriNetUnfolder]: For 61193/61193 co-relation queries the response was YES. [2023-08-30 05:28:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27204 conditions, 4113 events. 2671/4113 cut-off events. For 61193/61193 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21506 event pairs, 936 based on Foata normal form. 4/4117 useless extension candidates. Maximal degree in co-relation 27156. Up to 2106 conditions per place. [2023-08-30 05:28:16,261 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 171 selfloop transitions, 38 changer transitions 12/221 dead transitions. [2023-08-30 05:28:16,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 221 transitions, 2992 flow [2023-08-30 05:28:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:28:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:28:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 848 transitions. [2023-08-30 05:28:16,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2023-08-30 05:28:16,265 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 848 transitions. [2023-08-30 05:28:16,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 848 transitions. [2023-08-30 05:28:16,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:28:16,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 848 transitions. [2023-08-30 05:28:16,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:16,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:16,323 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:16,323 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 1936 flow. Second operand 8 states and 848 transitions. [2023-08-30 05:28:16,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 221 transitions, 2992 flow [2023-08-30 05:28:16,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 221 transitions, 2898 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-08-30 05:28:16,505 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 2003 flow [2023-08-30 05:28:16,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2003, PETRI_PLACES=130, PETRI_TRANSITIONS=154} [2023-08-30 05:28:16,506 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2023-08-30 05:28:16,507 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 2003 flow [2023-08-30 05:28:16,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:16,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:28:16,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:28:16,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 05:28:16,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:28:16,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:28:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1252591096, now seen corresponding path program 4 times [2023-08-30 05:28:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:28:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584811861] [2023-08-30 05:28:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:28:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:28:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:28:16,670 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-30 05:28:16,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:28:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584811861] [2023-08-30 05:28:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584811861] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:28:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412296597] [2023-08-30 05:28:16,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 05:28:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:28:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:28:16,673 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-30 05:28:16,683 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-30 05:28:16,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 05:28:16,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:28:16,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 05:28:16,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:28:16,916 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-30 05:28:16,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:28:25,459 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-30 05:28:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412296597] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:28:25,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:28:25,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-08-30 05:28:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900260761] [2023-08-30 05:28:25,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:28:25,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 05:28:25,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:28:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 05:28:25,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=157, Unknown=4, NotChecked=0, Total=210 [2023-08-30 05:28:27,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:29,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:31,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:33,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:35,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:37,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:39,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:41,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:43,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:46,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:48,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:50,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:52,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:54,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:57,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:59,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:28:59,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 232 [2023-08-30 05:28:59,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 154 transitions, 2003 flow. Second operand has 15 states, 15 states have (on average 93.26666666666667) internal successors, (1399), 15 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:28:59,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:28:59,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 232 [2023-08-30 05:28:59,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:29:01,862 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-30 05:29:03,875 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-30 05:29:05,885 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-30 05:29:07,892 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-30 05:29:09,902 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-30 05:29:11,908 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-30 05:29:13,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:15,591 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-30 05:29:17,606 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-30 05:29:19,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:21,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:23,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:25,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:27,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:29,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:32,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:34,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:36,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:37,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:39,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:41,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:43,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:45,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:48,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:50,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:52,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:54,429 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_~b~0_35 Int)) (let ((.cse0 (mod (+ 4294967295 (* 4294967295 aux_mod_~b~0_35)) 4294967296))) (or (<= .cse0 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296) .cse0) (< (+ (mod c_thread3Thread1of1ForFork2_~i~2 4294967296) aux_mod_~b~0_35) 4294967295) (>= aux_mod_~b~0_35 4294967296)))) (<= (+ (* (div c_~a~0 4294967296) 4294967296) 1) c_~a~0)) is different from false [2023-08-30 05:29:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:29:58,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:00,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:02,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:06,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:08,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:10,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:12,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:14,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:16,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:18,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:20,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:22,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:24,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:26,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:28,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:30,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:30:32,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:07,286 WARN L222 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 05:31:09,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:10,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:13,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:15,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:18,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:20,877 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-30 05:31:22,888 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-30 05:31:24,893 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-30 05:31:26,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:29,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:31,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:33,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:35,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:37,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:39,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:41,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:43,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:45,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:47,941 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread3Thread1of1ForFork2_~i~2 4294967296))) (and (< .cse0 (+ c_~b~0 4294967296 (* (div (+ (- 1) (- c_~b~0)) 4294967296) 4294967296))) (forall ((aux_mod_~b~0_35 Int)) (let ((.cse1 (mod (+ 4294967295 (* 4294967295 aux_mod_~b~0_35)) 4294967296))) (or (<= .cse1 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296) .cse1) (< (+ .cse0 aux_mod_~b~0_35) 4294967295) (>= aux_mod_~b~0_35 4294967296)))))) is different from false [2023-08-30 05:31:49,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:31:56,353 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-30 05:31:58,363 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-30 05:32:00,374 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-30 05:32:02,383 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-30 05:32:04,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-30 05:32:06,411 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-30 05:32:08,429 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-30 05:32:10,439 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-30 05:32:12,561 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-30 05:32:14,568 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-30 05:32:16,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:18,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:20,683 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse0 (mod c_thread3Thread1of1ForFork2_~i~2 4294967296))) (and (or (< .cse0 (+ c_~b~0 4294967296 (* (div (+ (- 1) (- c_~b~0)) 4294967296) 4294967296))) (< .cse1 (mod c_~b~0 4294967296))) (forall ((aux_mod_~b~0_35 Int)) (let ((.cse2 (mod (+ 4294967295 (* 4294967295 aux_mod_~b~0_35)) 4294967296))) (or (<= .cse2 .cse1) (< (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296) .cse2) (< (+ .cse0 aux_mod_~b~0_35) 4294967295) (>= aux_mod_~b~0_35 4294967296)))) (<= (+ (* (div c_~a~0 4294967296) 4294967296) 1) c_~a~0))) is different from false [2023-08-30 05:32:22,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:24,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:28,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:30,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:32:32,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:06,276 WARN L222 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 05:33:11,083 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-30 05:33:13,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:15,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:17,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:19,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:21,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:23,196 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-30 05:33:25,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:27,384 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-30 05:33:29,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:31,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:33,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:35,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:37,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:39,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:41,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:43,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:45,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:47,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:50,029 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-30 05:33:52,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:54,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:33:54,101 INFO L130 PetriNetUnfolder]: 5280/8210 cut-off events. [2023-08-30 05:33:54,101 INFO L131 PetriNetUnfolder]: For 119878/119878 co-relation queries the response was YES. [2023-08-30 05:33:54,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54002 conditions, 8210 events. 5280/8210 cut-off events. For 119878/119878 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 49356 event pairs, 585 based on Foata normal form. 52/8262 useless extension candidates. Maximal degree in co-relation 53952. Up to 2909 conditions per place. [2023-08-30 05:33:54,254 INFO L137 encePairwiseOnDemand]: 218/232 looper letters, 321 selfloop transitions, 297 changer transitions 3/621 dead transitions. [2023-08-30 05:33:54,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 621 transitions, 8147 flow [2023-08-30 05:33:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 05:33:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 05:33:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3143 transitions. [2023-08-30 05:33:54,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4370133481646274 [2023-08-30 05:33:54,277 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3143 transitions. [2023-08-30 05:33:54,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3143 transitions. [2023-08-30 05:33:54,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:33:54,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3143 transitions. [2023-08-30 05:33:54,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 101.38709677419355) internal successors, (3143), 31 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:54,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 232.0) internal successors, (7424), 32 states have internal predecessors, (7424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:54,310 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 232.0) internal successors, (7424), 32 states have internal predecessors, (7424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:54,310 INFO L175 Difference]: Start difference. First operand has 130 places, 154 transitions, 2003 flow. Second operand 31 states and 3143 transitions. [2023-08-30 05:33:54,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 621 transitions, 8147 flow [2023-08-30 05:33:54,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 621 transitions, 7856 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 05:33:54,570 INFO L231 Difference]: Finished difference. Result has 182 places, 385 transitions, 6502 flow [2023-08-30 05:33:54,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6502, PETRI_PLACES=182, PETRI_TRANSITIONS=385} [2023-08-30 05:33:54,571 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2023-08-30 05:33:54,571 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 385 transitions, 6502 flow [2023-08-30 05:33:54,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.26666666666667) internal successors, (1399), 15 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:54,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:33:54,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:33:54,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 05:33:54,772 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,SelfDestructingSolverStorable15 [2023-08-30 05:33:54,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:33:54,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:33:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1220860868, now seen corresponding path program 5 times [2023-08-30 05:33:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:33:54,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22376567] [2023-08-30 05:33:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:33:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:33:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:33:54,946 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-30 05:33:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:33:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22376567] [2023-08-30 05:33:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22376567] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:33:54,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629428970] [2023-08-30 05:33:54,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 05:33:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:33:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:33:54,948 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-30 05:33:54,953 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-30 05:33:55,059 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 05:33:55,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:33:55,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-30 05:33:55,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:33:55,162 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-30 05:33:55,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:33:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:33:55,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629428970] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:33:55,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:33:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-08-30 05:33:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211573956] [2023-08-30 05:33:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:33:55,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:33:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:33:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:33:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:33:55,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:33:55,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 385 transitions, 6502 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:55,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:33:55,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:33:55,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:33:57,609 INFO L130 PetriNetUnfolder]: 6082/9534 cut-off events. [2023-08-30 05:33:57,610 INFO L131 PetriNetUnfolder]: For 331580/331697 co-relation queries the response was YES. [2023-08-30 05:33:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93722 conditions, 9534 events. 6082/9534 cut-off events. For 331580/331697 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 59678 event pairs, 1071 based on Foata normal form. 129/9614 useless extension candidates. Maximal degree in co-relation 93646. Up to 4763 conditions per place. [2023-08-30 05:33:57,752 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 426 selfloop transitions, 224 changer transitions 3/671 dead transitions. [2023-08-30 05:33:57,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 671 transitions, 12169 flow [2023-08-30 05:33:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 05:33:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 05:33:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 885 transitions. [2023-08-30 05:33:57,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47683189655172414 [2023-08-30 05:33:57,755 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 885 transitions. [2023-08-30 05:33:57,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 885 transitions. [2023-08-30 05:33:57,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:33:57,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 885 transitions. [2023-08-30 05:33:57,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.625) internal successors, (885), 8 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:57,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:57,760 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:57,760 INFO L175 Difference]: Start difference. First operand has 182 places, 385 transitions, 6502 flow. Second operand 8 states and 885 transitions. [2023-08-30 05:33:57,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 671 transitions, 12169 flow [2023-08-30 05:33:59,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 671 transitions, 10573 flow, removed 774 selfloop flow, removed 1 redundant places. [2023-08-30 05:33:59,041 INFO L231 Difference]: Finished difference. Result has 194 places, 458 transitions, 7848 flow [2023-08-30 05:33:59,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=5659, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7848, PETRI_PLACES=194, PETRI_TRANSITIONS=458} [2023-08-30 05:33:59,041 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2023-08-30 05:33:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 458 transitions, 7848 flow [2023-08-30 05:33:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:33:59,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:33:59,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:33:59,049 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-30 05:33:59,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 05:33:59,248 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:33:59,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:33:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1876048527, now seen corresponding path program 4 times [2023-08-30 05:33:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:33:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180301584] [2023-08-30 05:33:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:33:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:33:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:33:59,413 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-30 05:33:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:33:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180301584] [2023-08-30 05:33:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180301584] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:33:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815182504] [2023-08-30 05:33:59,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 05:33:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:33:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:33:59,416 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-30 05:33:59,418 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-30 05:33:59,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 05:33:59,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:33:59,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 05:33:59,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:33:59,681 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-30 05:33:59,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:33:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:33:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815182504] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:33:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:33:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 16 [2023-08-30 05:33:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742046061] [2023-08-30 05:33:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:33:59,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:33:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:33:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:33:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-08-30 05:34:01,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 05:34:01,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:34:01,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 458 transitions, 7848 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:01,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:01,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:34:01,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:03,914 INFO L130 PetriNetUnfolder]: 6174/9635 cut-off events. [2023-08-30 05:34:03,915 INFO L131 PetriNetUnfolder]: For 328725/329010 co-relation queries the response was YES. [2023-08-30 05:34:04,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91232 conditions, 9635 events. 6174/9635 cut-off events. For 328725/329010 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 60181 event pairs, 1866 based on Foata normal form. 119/9714 useless extension candidates. Maximal degree in co-relation 91150. Up to 4851 conditions per place. [2023-08-30 05:34:04,154 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 376 selfloop transitions, 125 changer transitions 0/515 dead transitions. [2023-08-30 05:34:04,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 515 transitions, 9449 flow [2023-08-30 05:34:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 05:34:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 05:34:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions. [2023-08-30 05:34:04,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2023-08-30 05:34:04,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions. [2023-08-30 05:34:04,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions. [2023-08-30 05:34:04,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:04,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions. [2023-08-30 05:34:04,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 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-30 05:34:04,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:04,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:04,180 INFO L175 Difference]: Start difference. First operand has 194 places, 458 transitions, 7848 flow. Second operand 6 states and 664 transitions. [2023-08-30 05:34:04,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 515 transitions, 9449 flow [2023-08-30 05:34:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 515 transitions, 9389 flow, removed 30 selfloop flow, removed 0 redundant places. [2023-08-30 05:34:05,008 INFO L231 Difference]: Finished difference. Result has 202 places, 460 transitions, 8116 flow [2023-08-30 05:34:05,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=7802, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8116, PETRI_PLACES=202, PETRI_TRANSITIONS=460} [2023-08-30 05:34:05,009 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2023-08-30 05:34:05,009 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 460 transitions, 8116 flow [2023-08-30 05:34:05,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:05,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:05,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:05,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 05:34:05,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:05,218 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:05,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 947611889, now seen corresponding path program 5 times [2023-08-30 05:34:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573668674] [2023-08-30 05:34:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:05,412 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-30 05:34:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573668674] [2023-08-30 05:34:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573668674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288780041] [2023-08-30 05:34:05,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 05:34:05,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:34:05,421 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-30 05:34:05,450 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-30 05:34:05,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 05:34:05,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:34:05,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 05:34:05,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:34:05,627 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-30 05:34:05,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:34:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288780041] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:05,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:34:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-08-30 05:34:05,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250014085] [2023-08-30 05:34:05,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:05,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:34:05,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:05,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:34:05,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-30 05:34:05,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:34:05,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 460 transitions, 8116 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:05,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:05,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:34:05,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:07,852 INFO L130 PetriNetUnfolder]: 6158/9621 cut-off events. [2023-08-30 05:34:07,852 INFO L131 PetriNetUnfolder]: For 294132/294425 co-relation queries the response was YES. [2023-08-30 05:34:07,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89010 conditions, 9621 events. 6158/9621 cut-off events. For 294132/294425 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 60142 event pairs, 1815 based on Foata normal form. 123/9700 useless extension candidates. Maximal degree in co-relation 88924. Up to 4851 conditions per place. [2023-08-30 05:34:07,956 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 394 selfloop transitions, 141 changer transitions 0/549 dead transitions. [2023-08-30 05:34:07,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 549 transitions, 10047 flow [2023-08-30 05:34:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 05:34:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 05:34:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2023-08-30 05:34:07,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4755747126436782 [2023-08-30 05:34:07,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 662 transitions. [2023-08-30 05:34:07,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions. [2023-08-30 05:34:07,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:07,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions. [2023-08-30 05:34:07,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 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-30 05:34:07,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:07,964 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:07,964 INFO L175 Difference]: Start difference. First operand has 202 places, 460 transitions, 8116 flow. Second operand 6 states and 662 transitions. [2023-08-30 05:34:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 549 transitions, 10047 flow [2023-08-30 05:34:08,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 549 transitions, 9819 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 05:34:08,697 INFO L231 Difference]: Finished difference. Result has 208 places, 464 transitions, 8295 flow [2023-08-30 05:34:08,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=7891, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8295, PETRI_PLACES=208, PETRI_TRANSITIONS=464} [2023-08-30 05:34:08,698 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2023-08-30 05:34:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 464 transitions, 8295 flow [2023-08-30 05:34:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:08,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:08,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:08,703 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-30 05:34:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:08,899 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:08,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 975317519, now seen corresponding path program 6 times [2023-08-30 05:34:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322448134] [2023-08-30 05:34:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:09,051 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-30 05:34:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322448134] [2023-08-30 05:34:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322448134] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661823468] [2023-08-30 05:34:09,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 05:34:09,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:09,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:34:09,057 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-30 05:34:09,060 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-30 05:34:09,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 05:34:09,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:34:09,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 05:34:09,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:34:09,312 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-30 05:34:09,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:34:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661823468] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 05:34:09,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-08-30 05:34:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159836903] [2023-08-30 05:34:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:09,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 05:34:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 05:34:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-08-30 05:34:09,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-30 05:34:09,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 464 transitions, 8295 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:09,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:09,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-30 05:34:09,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:11,599 INFO L130 PetriNetUnfolder]: 6142/9585 cut-off events. [2023-08-30 05:34:11,600 INFO L131 PetriNetUnfolder]: For 296498/296791 co-relation queries the response was YES. [2023-08-30 05:34:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89457 conditions, 9585 events. 6142/9585 cut-off events. For 296498/296791 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 59754 event pairs, 1847 based on Foata normal form. 119/9660 useless extension candidates. Maximal degree in co-relation 89368. Up to 4851 conditions per place. [2023-08-30 05:34:11,701 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 392 selfloop transitions, 141 changer transitions 0/547 dead transitions. [2023-08-30 05:34:11,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 547 transitions, 10155 flow [2023-08-30 05:34:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 05:34:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 05:34:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2023-08-30 05:34:11,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2023-08-30 05:34:11,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 660 transitions. [2023-08-30 05:34:11,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions. [2023-08-30 05:34:11,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:11,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions. [2023-08-30 05:34:11,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:11,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:11,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:11,708 INFO L175 Difference]: Start difference. First operand has 208 places, 464 transitions, 8295 flow. Second operand 6 states and 660 transitions. [2023-08-30 05:34:11,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 547 transitions, 10155 flow [2023-08-30 05:34:12,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 547 transitions, 9916 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 05:34:12,501 INFO L231 Difference]: Finished difference. Result has 213 places, 465 transitions, 8371 flow [2023-08-30 05:34:12,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=8056, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8371, PETRI_PLACES=213, PETRI_TRANSITIONS=465} [2023-08-30 05:34:12,502 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2023-08-30 05:34:12,502 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 465 transitions, 8371 flow [2023-08-30 05:34:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:12,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:12,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:12,511 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-30 05:34:12,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:12,703 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:12,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 547539218, now seen corresponding path program 6 times [2023-08-30 05:34:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21125245] [2023-08-30 05:34:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:12,851 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-30 05:34:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21125245] [2023-08-30 05:34:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21125245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164583269] [2023-08-30 05:34:12,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 05:34:12,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:34:12,857 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-30 05:34:12,888 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-30 05:34:12,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-30 05:34:12,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:34:12,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 05:34:12,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:34:13,113 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-30 05:34:13,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:34:13,242 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-30 05:34:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164583269] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:34:13,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:34:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-30 05:34:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585606626] [2023-08-30 05:34:13,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:34:13,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 05:34:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 05:34:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-08-30 05:34:13,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-30 05:34:13,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 465 transitions, 8371 flow. Second operand has 16 states, 16 states have (on average 95.6875) internal successors, (1531), 16 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:13,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:13,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-30 05:34:13,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:16,223 INFO L130 PetriNetUnfolder]: 6685/10582 cut-off events. [2023-08-30 05:34:16,224 INFO L131 PetriNetUnfolder]: For 314502/314502 co-relation queries the response was YES. [2023-08-30 05:34:16,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97571 conditions, 10582 events. 6685/10582 cut-off events. For 314502/314502 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 68560 event pairs, 1202 based on Foata normal form. 52/10634 useless extension candidates. Maximal degree in co-relation 97480. Up to 5248 conditions per place. [2023-08-30 05:34:16,348 INFO L137 encePairwiseOnDemand]: 222/232 looper letters, 438 selfloop transitions, 338 changer transitions 6/782 dead transitions. [2023-08-30 05:34:16,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 782 transitions, 13843 flow [2023-08-30 05:34:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 05:34:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 05:34:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1246 transitions. [2023-08-30 05:34:16,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475574712643678 [2023-08-30 05:34:16,351 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1246 transitions. [2023-08-30 05:34:16,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1246 transitions. [2023-08-30 05:34:16,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:16,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1246 transitions. [2023-08-30 05:34:16,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 12 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-30 05:34:16,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:16,357 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 232.0) internal successors, (3016), 13 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:16,357 INFO L175 Difference]: Start difference. First operand has 213 places, 465 transitions, 8371 flow. Second operand 12 states and 1246 transitions. [2023-08-30 05:34:16,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 782 transitions, 13843 flow [2023-08-30 05:34:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 782 transitions, 13556 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 05:34:17,225 INFO L231 Difference]: Finished difference. Result has 224 places, 549 transitions, 10367 flow [2023-08-30 05:34:17,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=8090, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10367, PETRI_PLACES=224, PETRI_TRANSITIONS=549} [2023-08-30 05:34:17,226 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2023-08-30 05:34:17,226 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 549 transitions, 10367 flow [2023-08-30 05:34:17,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 95.6875) internal successors, (1531), 16 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:17,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:17,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:17,235 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-30 05:34:17,432 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,SelfDestructingSolverStorable20 [2023-08-30 05:34:17,432 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:17,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1133707896, now seen corresponding path program 7 times [2023-08-30 05:34:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747328337] [2023-08-30 05:34:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:17,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747328337] [2023-08-30 05:34:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747328337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:34:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714376478] [2023-08-30 05:34:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:17,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:34:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:34:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:34:17,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-30 05:34:17,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 549 transitions, 10367 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:17,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:17,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-30 05:34:17,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:20,164 INFO L130 PetriNetUnfolder]: 6688/10584 cut-off events. [2023-08-30 05:34:20,164 INFO L131 PetriNetUnfolder]: For 333368/333368 co-relation queries the response was YES. [2023-08-30 05:34:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100905 conditions, 10584 events. 6688/10584 cut-off events. For 333368/333368 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 68489 event pairs, 1790 based on Foata normal form. 20/10604 useless extension candidates. Maximal degree in co-relation 100811. Up to 5248 conditions per place. [2023-08-30 05:34:20,282 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 499 selfloop transitions, 147 changer transitions 0/646 dead transitions. [2023-08-30 05:34:20,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 646 transitions, 12855 flow [2023-08-30 05:34:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:34:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:34:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-30 05:34:20,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-08-30 05:34:20,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-30 05:34:20,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-30 05:34:20,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:20,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-30 05:34:20,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:20,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:20,288 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:20,288 INFO L175 Difference]: Start difference. First operand has 224 places, 549 transitions, 10367 flow. Second operand 7 states and 740 transitions. [2023-08-30 05:34:20,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 646 transitions, 12855 flow [2023-08-30 05:34:21,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 646 transitions, 12794 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-30 05:34:21,300 INFO L231 Difference]: Finished difference. Result has 227 places, 552 transitions, 10681 flow [2023-08-30 05:34:21,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=10310, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10681, PETRI_PLACES=227, PETRI_TRANSITIONS=552} [2023-08-30 05:34:21,301 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places. [2023-08-30 05:34:21,301 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 552 transitions, 10681 flow [2023-08-30 05:34:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:21,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:21,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:21,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 05:34:21,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:21,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1112134376, now seen corresponding path program 8 times [2023-08-30 05:34:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910360579] [2023-08-30 05:34:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910360579] [2023-08-30 05:34:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910360579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:34:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988969485] [2023-08-30 05:34:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:21,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:34:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:34:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:34:21,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 05:34:21,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 552 transitions, 10681 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:21,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:21,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 05:34:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:24,169 INFO L130 PetriNetUnfolder]: 6783/10818 cut-off events. [2023-08-30 05:34:24,169 INFO L131 PetriNetUnfolder]: For 350535/350535 co-relation queries the response was YES. [2023-08-30 05:34:24,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104074 conditions, 10818 events. 6783/10818 cut-off events. For 350535/350535 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 71626 event pairs, 1128 based on Foata normal form. 52/10870 useless extension candidates. Maximal degree in co-relation 103980. Up to 5389 conditions per place. [2023-08-30 05:34:24,294 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 570 selfloop transitions, 254 changer transitions 9/833 dead transitions. [2023-08-30 05:34:24,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 833 transitions, 16737 flow [2023-08-30 05:34:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:34:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:34:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-30 05:34:24,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-08-30 05:34:24,296 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-30 05:34:24,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-30 05:34:24,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:24,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-30 05:34:24,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:24,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:24,300 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:24,300 INFO L175 Difference]: Start difference. First operand has 227 places, 552 transitions, 10681 flow. Second operand 7 states and 740 transitions. [2023-08-30 05:34:24,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 833 transitions, 16737 flow [2023-08-30 05:34:25,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 833 transitions, 16289 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 05:34:25,297 INFO L231 Difference]: Finished difference. Result has 233 places, 580 transitions, 11881 flow [2023-08-30 05:34:25,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=10379, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11881, PETRI_PLACES=233, PETRI_TRANSITIONS=580} [2023-08-30 05:34:25,298 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 191 predicate places. [2023-08-30 05:34:25,298 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 580 transitions, 11881 flow [2023-08-30 05:34:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:25,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:25,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 05:34:25,299 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:25,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1509588982, now seen corresponding path program 9 times [2023-08-30 05:34:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:25,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188832157] [2023-08-30 05:34:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:25,434 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-30 05:34:25,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188832157] [2023-08-30 05:34:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188832157] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383997529] [2023-08-30 05:34:25,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 05:34:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:34:25,437 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-30 05:34:25,452 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-30 05:34:25,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 05:34:25,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:34:25,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 05:34:25,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:34:25,738 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-30 05:34:25,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:34:26,308 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-30 05:34:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383997529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:34:26,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:34:26,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2023-08-30 05:34:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237208059] [2023-08-30 05:34:26,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:34:26,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 05:34:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 05:34:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-08-30 05:34:26,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 232 [2023-08-30 05:34:26,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 580 transitions, 11881 flow. Second operand has 15 states, 15 states have (on average 96.6) internal successors, (1449), 15 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:26,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:26,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 232 [2023-08-30 05:34:26,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:30,314 INFO L130 PetriNetUnfolder]: 8818/14045 cut-off events. [2023-08-30 05:34:30,314 INFO L131 PetriNetUnfolder]: For 502022/502022 co-relation queries the response was YES. [2023-08-30 05:34:30,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141091 conditions, 14045 events. 8818/14045 cut-off events. For 502022/502022 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 96931 event pairs, 1302 based on Foata normal form. 80/14125 useless extension candidates. Maximal degree in co-relation 140992. Up to 7023 conditions per place. [2023-08-30 05:34:30,504 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 750 selfloop transitions, 295 changer transitions 1/1046 dead transitions. [2023-08-30 05:34:30,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1046 transitions, 21540 flow [2023-08-30 05:34:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 05:34:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 05:34:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1884 transitions. [2023-08-30 05:34:30,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511494252873563 [2023-08-30 05:34:30,508 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1884 transitions. [2023-08-30 05:34:30,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1884 transitions. [2023-08-30 05:34:30,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:30,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1884 transitions. [2023-08-30 05:34:30,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 104.66666666666667) internal successors, (1884), 18 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:30,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 232.0) internal successors, (4408), 19 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:30,516 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 232.0) internal successors, (4408), 19 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:30,516 INFO L175 Difference]: Start difference. First operand has 233 places, 580 transitions, 11881 flow. Second operand 18 states and 1884 transitions. [2023-08-30 05:34:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1046 transitions, 21540 flow [2023-08-30 05:34:32,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1046 transitions, 20891 flow, removed 176 selfloop flow, removed 2 redundant places. [2023-08-30 05:34:32,410 INFO L231 Difference]: Finished difference. Result has 262 places, 651 transitions, 14154 flow [2023-08-30 05:34:32,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=11477, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=14154, PETRI_PLACES=262, PETRI_TRANSITIONS=651} [2023-08-30 05:34:32,411 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2023-08-30 05:34:32,411 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 651 transitions, 14154 flow [2023-08-30 05:34:32,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 96.6) internal successors, (1449), 15 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:32,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:32,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:32,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-30 05:34:32,611 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-30 05:34:32,612 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:32,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2065332540, now seen corresponding path program 10 times [2023-08-30 05:34:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511530443] [2023-08-30 05:34:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511530443] [2023-08-30 05:34:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511530443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:32,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:34:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815429748] [2023-08-30 05:34:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:32,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:34:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:34:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:34:32,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-30 05:34:32,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 651 transitions, 14154 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:32,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:32,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-30 05:34:32,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:36,873 INFO L130 PetriNetUnfolder]: 9498/15414 cut-off events. [2023-08-30 05:34:36,874 INFO L131 PetriNetUnfolder]: For 658374/658374 co-relation queries the response was YES. [2023-08-30 05:34:37,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162043 conditions, 15414 events. 9498/15414 cut-off events. For 658374/658374 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 110372 event pairs, 2368 based on Foata normal form. 72/15486 useless extension candidates. Maximal degree in co-relation 161930. Up to 7727 conditions per place. [2023-08-30 05:34:37,114 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 561 selfloop transitions, 377 changer transitions 10/948 dead transitions. [2023-08-30 05:34:37,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 948 transitions, 21053 flow [2023-08-30 05:34:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:34:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:34:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-08-30 05:34:37,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-08-30 05:34:37,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-08-30 05:34:37,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-08-30 05:34:37,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:37,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-08-30 05:34:37,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:37,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:37,121 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:37,121 INFO L175 Difference]: Start difference. First operand has 262 places, 651 transitions, 14154 flow. Second operand 7 states and 756 transitions. [2023-08-30 05:34:37,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 948 transitions, 21053 flow [2023-08-30 05:34:39,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 948 transitions, 20474 flow, removed 156 selfloop flow, removed 5 redundant places. [2023-08-30 05:34:39,922 INFO L231 Difference]: Finished difference. Result has 268 places, 737 transitions, 17128 flow [2023-08-30 05:34:39,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=13709, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=17128, PETRI_PLACES=268, PETRI_TRANSITIONS=737} [2023-08-30 05:34:39,923 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2023-08-30 05:34:39,923 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 737 transitions, 17128 flow [2023-08-30 05:34:39,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:39,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:39,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:39,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 05:34:39,924 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:39,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash -80910900, now seen corresponding path program 11 times [2023-08-30 05:34:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384945179] [2023-08-30 05:34:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384945179] [2023-08-30 05:34:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384945179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:34:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613957684] [2023-08-30 05:34:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:34:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:40,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:34:40,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:34:40,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 05:34:40,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 737 transitions, 17128 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:40,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:40,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 05:34:40,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:44,520 INFO L130 PetriNetUnfolder]: 9402/15157 cut-off events. [2023-08-30 05:34:44,520 INFO L131 PetriNetUnfolder]: For 678894/678894 co-relation queries the response was YES. [2023-08-30 05:34:44,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163252 conditions, 15157 events. 9402/15157 cut-off events. For 678894/678894 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 107241 event pairs, 2855 based on Foata normal form. 24/15181 useless extension candidates. Maximal degree in co-relation 163137. Up to 7823 conditions per place. [2023-08-30 05:34:44,988 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 576 selfloop transitions, 275 changer transitions 8/859 dead transitions. [2023-08-30 05:34:44,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 859 transitions, 20580 flow [2023-08-30 05:34:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:34:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:34:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 748 transitions. [2023-08-30 05:34:44,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605911330049261 [2023-08-30 05:34:44,990 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 748 transitions. [2023-08-30 05:34:44,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 748 transitions. [2023-08-30 05:34:44,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:44,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 748 transitions. [2023-08-30 05:34:44,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:44,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:44,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:44,994 INFO L175 Difference]: Start difference. First operand has 268 places, 737 transitions, 17128 flow. Second operand 7 states and 748 transitions. [2023-08-30 05:34:44,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 859 transitions, 20580 flow [2023-08-30 05:34:47,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 859 transitions, 20288 flow, removed 146 selfloop flow, removed 1 redundant places. [2023-08-30 05:34:47,720 INFO L231 Difference]: Finished difference. Result has 275 places, 738 transitions, 17545 flow [2023-08-30 05:34:47,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16876, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=17545, PETRI_PLACES=275, PETRI_TRANSITIONS=738} [2023-08-30 05:34:47,722 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places. [2023-08-30 05:34:47,722 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 738 transitions, 17545 flow [2023-08-30 05:34:47,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:47,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:47,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:47,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 05:34:47,723 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:47,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1334008104, now seen corresponding path program 12 times [2023-08-30 05:34:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933195057] [2023-08-30 05:34:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:34:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933195057] [2023-08-30 05:34:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933195057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:34:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:34:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:34:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400326265] [2023-08-30 05:34:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:34:47,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:34:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:34:47,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:34:47,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-30 05:34:47,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 738 transitions, 17545 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:47,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:47,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-30 05:34:47,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:34:52,699 INFO L130 PetriNetUnfolder]: 9375/15305 cut-off events. [2023-08-30 05:34:52,699 INFO L131 PetriNetUnfolder]: For 674244/674244 co-relation queries the response was YES. [2023-08-30 05:34:52,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163792 conditions, 15305 events. 9375/15305 cut-off events. For 674244/674244 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 110579 event pairs, 2906 based on Foata normal form. 68/15373 useless extension candidates. Maximal degree in co-relation 163674. Up to 7823 conditions per place. [2023-08-30 05:34:52,958 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 585 selfloop transitions, 337 changer transitions 10/932 dead transitions. [2023-08-30 05:34:52,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 932 transitions, 22422 flow [2023-08-30 05:34:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:34:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:34:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2023-08-30 05:34:52,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667487684729064 [2023-08-30 05:34:52,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2023-08-30 05:34:52,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2023-08-30 05:34:52,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:34:52,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2023-08-30 05:34:52,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:52,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:52,963 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:52,963 INFO L175 Difference]: Start difference. First operand has 275 places, 738 transitions, 17545 flow. Second operand 7 states and 758 transitions. [2023-08-30 05:34:52,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 932 transitions, 22422 flow [2023-08-30 05:34:55,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 932 transitions, 21853 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-30 05:34:55,747 INFO L231 Difference]: Finished difference. Result has 280 places, 769 transitions, 19051 flow [2023-08-30 05:34:55,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=17040, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19051, PETRI_PLACES=280, PETRI_TRANSITIONS=769} [2023-08-30 05:34:55,748 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 238 predicate places. [2023-08-30 05:34:55,748 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 769 transitions, 19051 flow [2023-08-30 05:34:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:55,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:34:55,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:34:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 05:34:55,748 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:34:55,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:34:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 101477699, now seen corresponding path program 7 times [2023-08-30 05:34:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:34:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177179080] [2023-08-30 05:34:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:34:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:34:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:55,883 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-30 05:34:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:34:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177179080] [2023-08-30 05:34:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177179080] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:34:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854144242] [2023-08-30 05:34:55,884 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 05:34:55,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:34:55,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:34:55,889 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-30 05:34:55,895 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-30 05:34:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:34:56,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 05:34:56,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:34:56,099 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-30 05:34:56,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:34:58,269 WARN L839 $PredicateComparison]: unable to prove that (forall ((aux_mod_~a~0_21 Int)) (or (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) .cse0)) (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)))) is different from false [2023-08-30 05:34:58,282 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-30 05:34:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854144242] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:34:58,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:34:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-08-30 05:34:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026596384] [2023-08-30 05:34:58,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:34:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 05:34:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:34:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 05:34:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2023-08-30 05:34:58,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 232 [2023-08-30 05:34:58,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 769 transitions, 19051 flow. Second operand has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:34:58,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:34:58,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 232 [2023-08-30 05:34:58,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:35:00,819 WARN L839 $PredicateComparison]: unable to prove that (and (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296)) (forall ((aux_mod_~a~0_21 Int)) (or (let ((.cse0 (* 4294967295 aux_mod_~a~0_21))) (< (+ (* 4294967296 (div .cse0 4294967296)) (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) .cse0)) (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))))) is different from false [2023-08-30 05:35:06,426 INFO L130 PetriNetUnfolder]: 11485/18516 cut-off events. [2023-08-30 05:35:06,426 INFO L131 PetriNetUnfolder]: For 838818/838818 co-relation queries the response was YES. [2023-08-30 05:35:06,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201676 conditions, 18516 events. 11485/18516 cut-off events. For 838818/838818 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 134911 event pairs, 2569 based on Foata normal form. 26/18542 useless extension candidates. Maximal degree in co-relation 201555. Up to 9465 conditions per place. [2023-08-30 05:35:06,784 INFO L137 encePairwiseOnDemand]: 218/232 looper letters, 553 selfloop transitions, 580 changer transitions 4/1137 dead transitions. [2023-08-30 05:35:06,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1137 transitions, 27018 flow [2023-08-30 05:35:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 05:35:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 05:35:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1767 transitions. [2023-08-30 05:35:06,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802231237322515 [2023-08-30 05:35:06,787 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1767 transitions. [2023-08-30 05:35:06,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1767 transitions. [2023-08-30 05:35:06,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:35:06,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1767 transitions. [2023-08-30 05:35:06,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 103.94117647058823) internal successors, (1767), 17 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:06,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:06,794 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 232.0) internal successors, (4176), 18 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:06,794 INFO L175 Difference]: Start difference. First operand has 280 places, 769 transitions, 19051 flow. Second operand 17 states and 1767 transitions. [2023-08-30 05:35:06,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1137 transitions, 27018 flow [2023-08-30 05:35:10,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 1137 transitions, 26575 flow, removed 120 selfloop flow, removed 2 redundant places. [2023-08-30 05:35:10,437 INFO L231 Difference]: Finished difference. Result has 305 places, 886 transitions, 23360 flow [2023-08-30 05:35:10,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=18654, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=476, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=23360, PETRI_PLACES=305, PETRI_TRANSITIONS=886} [2023-08-30 05:35:10,439 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 263 predicate places. [2023-08-30 05:35:10,439 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 886 transitions, 23360 flow [2023-08-30 05:35:10,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:10,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:35:10,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:35:10,447 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-30 05:35:10,644 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,SelfDestructingSolverStorable27 [2023-08-30 05:35:10,645 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:35:10,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:35:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1360521338, now seen corresponding path program 13 times [2023-08-30 05:35:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:35:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165584143] [2023-08-30 05:35:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:35:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:35:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:35:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:35:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:35:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165584143] [2023-08-30 05:35:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165584143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:35:10,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:35:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:35:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233652289] [2023-08-30 05:35:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:35:10,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:35:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:35:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:35:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:35:10,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 05:35:10,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 886 transitions, 23360 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:10,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:35:10,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 05:35:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:35:16,794 INFO L130 PetriNetUnfolder]: 11332/18278 cut-off events. [2023-08-30 05:35:16,794 INFO L131 PetriNetUnfolder]: For 1003589/1003589 co-relation queries the response was YES. [2023-08-30 05:35:16,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222953 conditions, 18278 events. 11332/18278 cut-off events. For 1003589/1003589 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 133069 event pairs, 3447 based on Foata normal form. 94/18372 useless extension candidates. Maximal degree in co-relation 222822. Up to 10634 conditions per place. [2023-08-30 05:35:17,077 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 665 selfloop transitions, 357 changer transitions 5/1027 dead transitions. [2023-08-30 05:35:17,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1027 transitions, 27370 flow [2023-08-30 05:35:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:35:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:35:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2023-08-30 05:35:17,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46366995073891626 [2023-08-30 05:35:17,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2023-08-30 05:35:17,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2023-08-30 05:35:17,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:35:17,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2023-08-30 05:35:17,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:17,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:17,082 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:17,082 INFO L175 Difference]: Start difference. First operand has 305 places, 886 transitions, 23360 flow. Second operand 7 states and 753 transitions. [2023-08-30 05:35:17,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1027 transitions, 27370 flow [2023-08-30 05:35:22,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 1027 transitions, 26468 flow, removed 307 selfloop flow, removed 3 redundant places. [2023-08-30 05:35:22,170 INFO L231 Difference]: Finished difference. Result has 312 places, 898 transitions, 23797 flow [2023-08-30 05:35:22,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=22463, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=23797, PETRI_PLACES=312, PETRI_TRANSITIONS=898} [2023-08-30 05:35:22,172 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 270 predicate places. [2023-08-30 05:35:22,172 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 898 transitions, 23797 flow [2023-08-30 05:35:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:22,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:35:22,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:35:22,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 05:35:22,173 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:35:22,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:35:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1135719077, now seen corresponding path program 8 times [2023-08-30 05:35:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:35:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583800232] [2023-08-30 05:35:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:35:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:35:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:35:22,300 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-30 05:35:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:35:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583800232] [2023-08-30 05:35:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583800232] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:35:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216645554] [2023-08-30 05:35:22,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 05:35:22,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:35:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:35:22,302 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 05:35:22,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 05:35:22,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 05:35:22,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:35:22,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 05:35:22,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:35:22,544 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-30 05:35:22,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:35:35,676 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-30 05:35:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216645554] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:35:35,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:35:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-08-30 05:35:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486140156] [2023-08-30 05:35:35,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:35:35,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-30 05:35:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:35:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-30 05:35:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=148, Unknown=6, NotChecked=0, Total=210 [2023-08-30 05:35:35,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 232 [2023-08-30 05:35:35,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 898 transitions, 23797 flow. Second operand has 15 states, 15 states have (on average 96.6) internal successors, (1449), 15 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:35:35,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:35:35,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 232 [2023-08-30 05:35:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:35:37,928 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-30 05:35:39,963 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-30 05:35:41,989 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-30 05:35:44,004 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-30 05:35:46,019 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-30 05:35:48,038 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-30 05:35:50,060 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-30 05:35:52,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:35:54,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:35:56,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:35:58,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:00,355 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-30 05:36:02,389 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-30 05:36:04,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:08,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:10,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:12,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:14,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:16,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:18,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:20,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:22,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:24,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:26,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:28,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:30,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:34,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:36,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:38,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:40,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:43,017 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (- (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) (.cse2 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (let ((.cse0 (* 4294967295 c_~b~0))) (or (< .cse0 (+ 4294967296 (* (div (+ (- 1) .cse0 .cse1) 4294967296) 4294967296))) (< .cse0 (+ (* (div .cse0 4294967296) 4294967296) .cse2 1)))) (forall ((aux_mod_~b~0_21 Int)) (let ((.cse3 (* 4294967295 aux_mod_~b~0_21))) (or (> 0 aux_mod_~b~0_21) (< .cse3 (+ (* (div (+ (- 1) .cse3 .cse1) 4294967296) 4294967296) 4294967296)) (< .cse3 (+ .cse2 (* (div .cse3 4294967296) 4294967296) 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21)))))) is different from false [2023-08-30 05:36:45,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:47,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:49,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:51,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:53,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:55,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:57,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:36:59,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:01,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:05,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:07,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:09,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:11,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:13,487 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (or (< 0 (mod (+ c_~b~0 c_~a~0) 4294967296)) (< .cse0 (mod c_~a~0 4294967296))) (= c_thread1Thread1of1ForFork1_~i~0 0) (forall ((aux_mod_~b~0_21 Int)) (let ((.cse1 (* 4294967295 aux_mod_~b~0_21))) (or (> 0 aux_mod_~b~0_21) (< .cse1 (+ (* (div (+ (- 1) .cse1 (- (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) 4294967296) 4294967296) 4294967296)) (< .cse1 (+ .cse0 (* (div .cse1 4294967296) 4294967296) 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21)))))) is different from false [2023-08-30 05:37:15,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:17,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:19,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:21,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:23,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:25,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:27,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:29,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:31,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:33,976 WARN L839 $PredicateComparison]: unable to prove that (and (< 0 (mod c_~a~0 4294967296)) (<= c_~b~0 (* 4294967296 (div c_~b~0 4294967296))) (forall ((aux_mod_~b~0_21 Int)) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (or (> 0 aux_mod_~b~0_21) (< .cse0 (+ (* (div (+ (- 1) .cse0 (- (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) 4294967296) 4294967296) 4294967296)) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21)))) (= c_thread1Thread1of1ForFork1_~i~0 1)) is different from false [2023-08-30 05:37:36,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:38,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:40,256 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-30 05:37:42,276 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-30 05:37:44,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:46,342 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-30 05:37:48,358 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-30 05:37:50,381 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-30 05:37:52,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:54,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:56,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:37:58,604 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-30 05:38:00,614 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-30 05:38:02,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:04,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:06,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:08,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:10,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:12,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:14,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:17,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:19,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:21,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:23,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:25,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:27,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:29,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:31,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:33,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:35,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:37,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:39,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:41,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:43,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:45,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:47,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:49,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:52,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:54,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:56,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:38:58,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:00,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:04,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:06,298 WARN L839 $PredicateComparison]: unable to prove that (and (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296)) (forall ((aux_mod_~b~0_21 Int)) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (or (> 0 aux_mod_~b~0_21) (< .cse0 (+ (* (div (+ (- 1) .cse0 (- (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) 4294967296) 4294967296) 4294967296)) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21))))) is different from false [2023-08-30 05:39:10,924 WARN L839 $PredicateComparison]: unable to prove that (and (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296)) (= c_thread1Thread1of1ForFork1_~i~0 0) (forall ((aux_mod_~b~0_21 Int)) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (or (> 0 aux_mod_~b~0_21) (< .cse0 (+ (* (div (+ (- 1) .cse0 (- (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296))) 4294967296) 4294967296) 4294967296)) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1)) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21))))) is different from false [2023-08-30 05:39:13,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:15,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:39:17,875 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-30 05:39:19,887 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-30 05:39:28,161 INFO L130 PetriNetUnfolder]: 15943/26254 cut-off events. [2023-08-30 05:39:28,161 INFO L131 PetriNetUnfolder]: For 1439048/1439048 co-relation queries the response was YES. [2023-08-30 05:39:28,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318172 conditions, 26254 events. 15943/26254 cut-off events. For 1439048/1439048 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 209293 event pairs, 2971 based on Foata normal form. 232/26486 useless extension candidates. Maximal degree in co-relation 318039. Up to 13409 conditions per place. [2023-08-30 05:39:28,666 INFO L137 encePairwiseOnDemand]: 217/232 looper letters, 920 selfloop transitions, 1033 changer transitions 6/1959 dead transitions. [2023-08-30 05:39:28,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1959 transitions, 51028 flow [2023-08-30 05:39:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-30 05:39:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-30 05:39:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3068 transitions. [2023-08-30 05:39:28,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45600475624256837 [2023-08-30 05:39:28,670 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3068 transitions. [2023-08-30 05:39:28,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3068 transitions. [2023-08-30 05:39:28,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:39:28,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3068 transitions. [2023-08-30 05:39:28,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 105.79310344827586) internal successors, (3068), 29 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:28,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 232.0) internal successors, (6960), 30 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:28,678 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 232.0) internal successors, (6960), 30 states have internal predecessors, (6960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:28,678 INFO L175 Difference]: Start difference. First operand has 312 places, 898 transitions, 23797 flow. Second operand 29 states and 3068 transitions. [2023-08-30 05:39:28,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1959 transitions, 51028 flow [2023-08-30 05:39:35,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 1959 transitions, 50180 flow, removed 277 selfloop flow, removed 3 redundant places. [2023-08-30 05:39:35,466 INFO L231 Difference]: Finished difference. Result has 359 places, 1444 transitions, 43182 flow [2023-08-30 05:39:35,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=23380, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=43182, PETRI_PLACES=359, PETRI_TRANSITIONS=1444} [2023-08-30 05:39:35,467 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 317 predicate places. [2023-08-30 05:39:35,468 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1444 transitions, 43182 flow [2023-08-30 05:39:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 96.6) internal successors, (1449), 15 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:35,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:39:35,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:39:35,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 05:39:35,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:39:35,674 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:39:35,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:39:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1397145201, now seen corresponding path program 9 times [2023-08-30 05:39:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:39:35,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097039769] [2023-08-30 05:39:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:39:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:39:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:39:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 05:39:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:39:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097039769] [2023-08-30 05:39:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097039769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 05:39:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 05:39:35,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 05:39:35,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586537070] [2023-08-30 05:39:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 05:39:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 05:39:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:39:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 05:39:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 05:39:35,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-30 05:39:35,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1444 transitions, 43182 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:35,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:39:35,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-30 05:39:35,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:39:48,660 INFO L130 PetriNetUnfolder]: 15896/26153 cut-off events. [2023-08-30 05:39:48,661 INFO L131 PetriNetUnfolder]: For 1867671/1867671 co-relation queries the response was YES. [2023-08-30 05:39:49,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371602 conditions, 26153 events. 15896/26153 cut-off events. For 1867671/1867671 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 208004 event pairs, 4602 based on Foata normal form. 38/26191 useless extension candidates. Maximal degree in co-relation 371449. Up to 13358 conditions per place. [2023-08-30 05:39:49,736 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 1202 selfloop transitions, 368 changer transitions 1/1571 dead transitions. [2023-08-30 05:39:49,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1571 transitions, 48818 flow [2023-08-30 05:39:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 05:39:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 05:39:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-08-30 05:39:49,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722906403940887 [2023-08-30 05:39:49,737 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-08-30 05:39:49,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-08-30 05:39:49,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 05:39:49,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-08-30 05:39:49,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:49,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:49,740 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:39:49,740 INFO L175 Difference]: Start difference. First operand has 359 places, 1444 transitions, 43182 flow. Second operand 7 states and 767 transitions. [2023-08-30 05:39:49,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1571 transitions, 48818 flow [2023-08-30 05:40:01,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1571 transitions, 46486 flow, removed 890 selfloop flow, removed 3 redundant places. [2023-08-30 05:40:01,486 INFO L231 Difference]: Finished difference. Result has 365 places, 1446 transitions, 42035 flow [2023-08-30 05:40:01,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=41103, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42035, PETRI_PLACES=365, PETRI_TRANSITIONS=1446} [2023-08-30 05:40:01,488 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 323 predicate places. [2023-08-30 05:40:01,488 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 1446 transitions, 42035 flow [2023-08-30 05:40:01,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:40:01,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 05:40:01,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 05:40:01,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 05:40:01,488 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 05:40:01,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 05:40:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash 77149377, now seen corresponding path program 10 times [2023-08-30 05:40:01,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 05:40:01,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065486781] [2023-08-30 05:40:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 05:40:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 05:40:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 05:40:01,644 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-30 05:40:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 05:40:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065486781] [2023-08-30 05:40:01,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065486781] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 05:40:01,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433176921] [2023-08-30 05:40:01,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 05:40:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 05:40:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 05:40:01,647 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 05:40:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 05:40:01,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 05:40:01,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 05:40:01,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 05:40:01,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 05:40:01,950 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-30 05:40:01,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 05:40:08,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-30 05:40:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433176921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 05:40:08,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 05:40:08,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2023-08-30 05:40:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082232796] [2023-08-30 05:40:08,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 05:40:08,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 05:40:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 05:40:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 05:40:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=183, Unknown=3, NotChecked=0, Total=240 [2023-08-30 05:40:10,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:12,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:14,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:14,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 232 [2023-08-30 05:40:14,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1446 transitions, 42035 flow. Second operand has 16 states, 16 states have (on average 93.1875) internal successors, (1491), 16 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 05:40:14,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 05:40:14,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 232 [2023-08-30 05:40:14,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 05:40:16,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:18,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:20,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:23,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:25,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:27,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:30,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:32,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:34,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:36,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:38,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:40,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:41,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:43,860 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-30 05:40:45,878 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-30 05:40:47,910 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-30 05:40:49,917 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-30 05:40:51,940 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-30 05:40:55,116 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-30 05:40:57,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:40:59,142 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-30 05:41:01,151 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-30 05:41:03,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:05,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:07,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:09,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:11,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:14,010 WARN L839 $PredicateComparison]: unable to prove that (and (<= (+ (* 4294967296 (div c_~b~0 4294967296)) 1) c_~b~0) (forall ((aux_mod_~a~0_35 Int)) (let ((.cse0 (mod (+ (* 4294967295 aux_mod_~a~0_35) 4294967295) 4294967296))) (or (< (+ (mod c_thread3Thread1of1ForFork2_~i~2 4294967296) aux_mod_~a~0_35) 4294967295) (>= aux_mod_~a~0_35 4294967296) (<= .cse0 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse0))))) is different from false [2023-08-30 05:41:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:18,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:20,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:22,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:23,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:25,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:30,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:32,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:34,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:36,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:38,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:40,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:42,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:44,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:46,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:48,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:50,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:52,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:55,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:57,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:41:59,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-30 05:42:01,649 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (.cse0 (mod c_thread3Thread1of1ForFork2_~i~2 4294967296))) (and (forall ((aux_mod_~a~0_35 Int)) (let ((.cse1 (mod (+ (* 4294967295 aux_mod_~a~0_35) 4294967295) 4294967296))) (or (< (+ .cse0 aux_mod_~a~0_35) 4294967295) (>= aux_mod_~a~0_35 4294967296) (<= .cse1 .cse2) (< (mod (+ c_thread1Thread1of1ForFork1_~i~0 1) 4294967296) .cse1)))) (or (< .cse2 (mod c_~a~0 4294967296)) (< .cse0 (+ (* (div (+ (- 1) (- c_~a~0)) 4294967296) 4294967296) 4294967296 c_~a~0))))) is different from false Killed by 15