./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:41,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:41,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:41,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:41,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:41,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:41,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:41,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:41,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:41,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:41,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:41,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:41,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:41,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:41,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:41,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:41,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:41,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:41,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:41,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:41,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:41,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:41,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:41,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:41,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:41,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:41,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:41,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:41,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:41,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:41,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:41,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:41,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:41,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:41,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:41,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:41,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:41,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:41,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:41,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:41,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:41,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 00:25:41,511 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:41,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:41,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:41,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:41,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:41,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:41,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:41,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:41,515 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:41,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:41,516 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:41,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:41,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:41,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:41,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:41,517 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:41,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:41,518 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:41,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:41,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:41,518 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:41,519 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:41,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:41,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:41,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:41,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:41,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:41,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:41,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 00:25:41,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 00:25:41,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:41,521 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:41,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:41,521 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:41,521 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 -> 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:41,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:41,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:41,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:41,853 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:41,854 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:41,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:42,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:43,259 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:43,260 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:43,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/683f7fab3/688a6ebd372545dfb42ed7dd8dff4249/FLAGb28e546b0 [2023-09-01 00:25:43,290 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/683f7fab3/688a6ebd372545dfb42ed7dd8dff4249 [2023-09-01 00:25:43,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:43,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:43,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:43,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:43,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:43,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b03c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:43, skipping insertion in model container [2023-09-01 00:25:43,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:43" (1/1) ... [2023-09-01 00:25:43,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:43,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:43,537 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2023-09-01 00:25:43,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:43,961 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:43,972 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2023-09-01 00:25:44,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:44,124 WARN L667 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 00:25:44,130 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:44,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44 WrapperNode [2023-09-01 00:25:44,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:44,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:44,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:44,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:44,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,212 INFO L138 Inliner]: procedures = 354, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-09-01 00:25:44,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:44,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:44,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:44,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:44,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:44,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:44,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:44,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:44,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (1/1) ... [2023-09-01 00:25:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:44,322 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-09-01 00:25:44,350 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-09-01 00:25:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-09-01 00:25:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-09-01 00:25:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-09-01 00:25:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 00:25:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 00:25:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:44,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:44,368 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:44,664 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:44,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:44,874 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:44,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:44,881 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:44,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:44 BoogieIcfgContainer [2023-09-01 00:25:44,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:44,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:44,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:44,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:43" (1/3) ... [2023-09-01 00:25:44,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58be7d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:44, skipping insertion in model container [2023-09-01 00:25:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:44" (2/3) ... [2023-09-01 00:25:44,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58be7d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:44, skipping insertion in model container [2023-09-01 00:25:44,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:44" (3/3) ... [2023-09-01 00:25:44,890 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:44,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:44,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 00:25:44,906 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:44,962 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 00:25:44,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 100 transitions, 216 flow [2023-09-01 00:25:45,036 INFO L130 PetriNetUnfolder]: 1/98 cut-off events. [2023-09-01 00:25:45,037 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:45,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 98 events. 1/98 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-09-01 00:25:45,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 100 transitions, 216 flow [2023-09-01 00:25:45,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:45,048 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:45,057 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:45,059 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:45,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 94 transitions, 200 flow [2023-09-01 00:25:45,080 INFO L130 PetriNetUnfolder]: 1/94 cut-off events. [2023-09-01 00:25:45,081 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:45,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 1/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-09-01 00:25:45,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-09-01 00:25:48,762 INFO L134 LiptonReduction]: Checked pairs total: 2946 [2023-09-01 00:25:48,763 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 00:25:48,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:25:48,781 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;@7fa8cfb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:25:48,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-09-01 00:25:48,783 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 00:25:48,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:48,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:48,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:25:48,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:48,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 356, now seen corresponding path program 1 times [2023-09-01 00:25:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960184364] [2023-09-01 00:25:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960184364] [2023-09-01 00:25:49,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960184364] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:25:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594753395] [2023-09-01 00:25:49,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:25:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:25:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:25:49,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192 [2023-09-01 00:25:49,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192 [2023-09-01 00:25:49,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,268 INFO L130 PetriNetUnfolder]: 245/465 cut-off events. [2023-09-01 00:25:49,268 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 00:25:49,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 465 events. 245/465 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1925 event pairs, 245 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 821. Up to 441 conditions per place. [2023-09-01 00:25:49,275 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 25 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-09-01 00:25:49,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 116 flow [2023-09-01 00:25:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:25:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:25:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2023-09-01 00:25:49,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2023-09-01 00:25:49,296 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 216 transitions. [2023-09-01 00:25:49,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 216 transitions. [2023-09-01 00:25:49,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 216 transitions. [2023-09-01 00:25:49,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,307 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,309 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 74 flow. Second operand 2 states and 216 transitions. [2023-09-01 00:25:49,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 116 flow [2023-09-01 00:25:49,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 00:25:49,314 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 58 flow [2023-09-01 00:25:49,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-09-01 00:25:49,320 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2023-09-01 00:25:49,320 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 58 flow [2023-09-01 00:25:49,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:25:49,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 00:25:49,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 351571, now seen corresponding path program 1 times [2023-09-01 00:25:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443297617] [2023-09-01 00:25:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443297617] [2023-09-01 00:25:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443297617] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:49,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417937320] [2023-09-01 00:25:49,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:49,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 192 [2023-09-01 00:25:49,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 192 [2023-09-01 00:25:49,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,746 INFO L130 PetriNetUnfolder]: 235/442 cut-off events. [2023-09-01 00:25:49,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 442 events. 235/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1806 event pairs, 235 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 867. Up to 417 conditions per place. [2023-09-01 00:25:49,752 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-09-01 00:25:49,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2023-09-01 00:25:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-09-01 00:25:49,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2023-09-01 00:25:49,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-09-01 00:25:49,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-09-01 00:25:49,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-09-01 00:25:49,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,766 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 58 flow. Second operand 3 states and 292 transitions. [2023-09-01 00:25:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2023-09-01 00:25:49,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:25:49,768 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 58 flow [2023-09-01 00:25:49,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-09-01 00:25:49,769 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2023-09-01 00:25:49,769 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 58 flow [2023-09-01 00:25:49,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:25:49,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 00:25:49,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash 351569, now seen corresponding path program 1 times [2023-09-01 00:25:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576005218] [2023-09-01 00:25:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:49,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576005218] [2023-09-01 00:25:49,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576005218] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:49,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953463454] [2023-09-01 00:25:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:49,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:49,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:49,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 192 [2023-09-01 00:25:49,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:49,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 192 [2023-09-01 00:25:49,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:49,985 INFO L130 PetriNetUnfolder]: 225/419 cut-off events. [2023-09-01 00:25:49,985 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:49,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 419 events. 225/419 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1698 event pairs, 225 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 824. Up to 395 conditions per place. [2023-09-01 00:25:49,988 INFO L137 encePairwiseOnDemand]: 188/192 looper letters, 19 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-09-01 00:25:49,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 96 flow [2023-09-01 00:25:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-09-01 00:25:49,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2023-09-01 00:25:49,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-09-01 00:25:49,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-09-01 00:25:49,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:49,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-09-01 00:25:49,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,993 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 58 flow. Second operand 3 states and 278 transitions. [2023-09-01 00:25:49,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 96 flow [2023-09-01 00:25:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:49,994 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2023-09-01 00:25:49,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:25:49,995 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:25:49,995 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2023-09-01 00:25:49,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:49,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:49,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:25:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 00:25:49,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:49,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash 337866210, now seen corresponding path program 1 times [2023-09-01 00:25:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791873327] [2023-09-01 00:25:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:49,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791873327] [2023-09-01 00:25:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791873327] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:25:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204951463] [2023-09-01 00:25:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:50,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 00:25:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 00:25:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 00:25:50,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-09-01 00:25:50,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 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-09-01 00:25:50,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:50,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-09-01 00:25:50,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:50,221 INFO L130 PetriNetUnfolder]: 165/318 cut-off events. [2023-09-01 00:25:50,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:50,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 318 events. 165/318 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1203 event pairs, 165 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 627. Up to 299 conditions per place. [2023-09-01 00:25:50,223 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-09-01 00:25:50,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 92 flow [2023-09-01 00:25:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-09-01 00:25:50,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-09-01 00:25:50,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-09-01 00:25:50,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-09-01 00:25:50,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:50,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-09-01 00:25:50,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,228 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 54 flow. Second operand 3 states and 264 transitions. [2023-09-01 00:25:50,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 92 flow [2023-09-01 00:25:50,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:50,229 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2023-09-01 00:25:50,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:25:50,230 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -9 predicate places. [2023-09-01 00:25:50,230 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2023-09-01 00:25:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 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-09-01 00:25:50,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:50,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:25:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 00:25:50,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:50,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 337866212, now seen corresponding path program 1 times [2023-09-01 00:25:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311561628] [2023-09-01 00:25:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:50,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311561628] [2023-09-01 00:25:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311561628] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 00:25:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598422469] [2023-09-01 00:25:50,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:50,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 00:25:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 00:25:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 00:25:50,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2023-09-01 00:25:50,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:50,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2023-09-01 00:25:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:50,458 INFO L130 PetriNetUnfolder]: 105/217 cut-off events. [2023-09-01 00:25:50,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 217 events. 105/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 745 event pairs, 105 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 430. Up to 203 conditions per place. [2023-09-01 00:25:50,459 INFO L137 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-09-01 00:25:50,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 88 flow [2023-09-01 00:25:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-09-01 00:25:50,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878472222222222 [2023-09-01 00:25:50,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-09-01 00:25:50,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-09-01 00:25:50,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:50,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-09-01 00:25:50,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,464 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 52 flow. Second operand 3 states and 281 transitions. [2023-09-01 00:25:50,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 88 flow [2023-09-01 00:25:50,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:50,465 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2023-09-01 00:25:50,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-09-01 00:25:50,466 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -10 predicate places. [2023-09-01 00:25:50,466 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2023-09-01 00:25:50,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:50,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:25:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 00:25:50,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:50,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1883918441, now seen corresponding path program 1 times [2023-09-01 00:25:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678055688] [2023-09-01 00:25:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678055688] [2023-09-01 00:25:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678055688] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016357663] [2023-09-01 00:25:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:50,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:50,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 192 [2023-09-01 00:25:50,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:50,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 192 [2023-09-01 00:25:50,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:50,599 INFO L130 PetriNetUnfolder]: 101/226 cut-off events. [2023-09-01 00:25:50,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:50,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 226 events. 101/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 879 event pairs, 65 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 439. Up to 146 conditions per place. [2023-09-01 00:25:50,600 INFO L137 encePairwiseOnDemand]: 187/192 looper letters, 24 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2023-09-01 00:25:50,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 125 flow [2023-09-01 00:25:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-09-01 00:25:50,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190972222222222 [2023-09-01 00:25:50,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-09-01 00:25:50,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-09-01 00:25:50,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:50,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-09-01 00:25:50,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,605 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 50 flow. Second operand 3 states and 299 transitions. [2023-09-01 00:25:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 125 flow [2023-09-01 00:25:50,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:50,607 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 72 flow [2023-09-01 00:25:50,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:25:50,608 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:25:50,608 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 72 flow [2023-09-01 00:25:50,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:50,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:50,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 00:25:50,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:50,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1991591267, now seen corresponding path program 1 times [2023-09-01 00:25:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:50,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076010517] [2023-09-01 00:25:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:50,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076010517] [2023-09-01 00:25:50,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076010517] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:50,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:50,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:25:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827055340] [2023-09-01 00:25:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:50,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 192 [2023-09-01 00:25:50,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:50,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 192 [2023-09-01 00:25:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:50,762 INFO L130 PetriNetUnfolder]: 49/134 cut-off events. [2023-09-01 00:25:50,762 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 00:25:50,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 134 events. 49/134 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 433 event pairs, 14 based on Foata normal form. 22/156 useless extension candidates. Maximal degree in co-relation 310. Up to 87 conditions per place. [2023-09-01 00:25:50,763 INFO L137 encePairwiseOnDemand]: 186/192 looper letters, 21 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-09-01 00:25:50,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 138 flow [2023-09-01 00:25:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-09-01 00:25:50,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017361111111112 [2023-09-01 00:25:50,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-09-01 00:25:50,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-09-01 00:25:50,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:50,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-09-01 00:25:50,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,768 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 72 flow. Second operand 3 states and 289 transitions. [2023-09-01 00:25:50,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 138 flow [2023-09-01 00:25:50,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:25:50,770 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 76 flow [2023-09-01 00:25:50,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:25:50,771 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:25:50,771 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 76 flow [2023-09-01 00:25:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:50,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:50,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 00:25:50,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:25:50,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1577083656, now seen corresponding path program 1 times [2023-09-01 00:25:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505822470] [2023-09-01 00:25:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:50,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:25:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:50,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 00:25:50,826 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:25:50,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-09-01 00:25:50,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-09-01 00:25:50,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-09-01 00:25:50,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-09-01 00:25:50,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-09-01 00:25:50,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-09-01 00:25:50,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-09-01 00:25:50,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 00:25:50,837 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:50,842 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:25:50,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:25:50,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:25:50 BasicIcfg [2023-09-01 00:25:50,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:25:50,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:25:50,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:25:50,881 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:25:50,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:44" (3/4) ... [2023-09-01 00:25:50,884 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:25:50,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:25:50,885 INFO L158 Benchmark]: Toolchain (without parser) took 7590.87ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 68.3MB in the beginning and 69.0MB in the end (delta: -642.9kB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,885 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:50,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 836.03ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 49.7MB in the end (delta: 18.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.62ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,886 INFO L158 Benchmark]: Boogie Preprocessor took 56.04ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,886 INFO L158 Benchmark]: RCFGBuilder took 612.93ms. Allocated memory is still 90.2MB. Free memory was 44.4MB in the beginning and 48.3MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,886 INFO L158 Benchmark]: TraceAbstraction took 5996.44ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 47.9MB in the beginning and 69.0MB in the end (delta: -21.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2023-09-01 00:25:50,887 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 136.3MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:50,888 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 836.03ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 49.7MB in the end (delta: 18.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.62ms. Allocated memory is still 90.2MB. Free memory was 49.7MB in the beginning and 46.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.04ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.93ms. Allocated memory is still 90.2MB. Free memory was 44.4MB in the beginning and 48.3MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5996.44ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 47.9MB in the beginning and 69.0MB in the end (delta: -21.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 136.3MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 100 PlacesBefore, 37 PlacesAfterwards, 94 TransitionsBefore, 31 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 2946 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1407, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 550, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1407, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 550, unknown conditional: 0, unknown unconditional: 550] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1152:1151}, argv={1152:1151}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-1, ptr={0:0}, t1={6:0}, t2={5:0}] [L1356] 1 g = 1 VAL [cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1152:1151}, argv={1152:1151}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=0, ptr={0:0}, ptr={0:0}, t1={6:0}, t2={5:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) [L19] 2 reach_error() VAL [\old(cond)=0, cond=0, cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1371]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1377]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 46 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-09-01 00:25:50,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:52,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:52,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:52,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:52,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:52,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:52,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:52,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:52,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:52,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:52,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:52,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:52,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:52,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:52,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:52,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:52,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:52,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:52,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:52,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:52,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:52,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:52,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:52,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:52,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:52,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:52,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:52,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:52,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:52,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:52,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:52,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:52,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:52,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:52,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:52,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:52,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:52,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:52,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:52,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:52,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:52,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-09-01 00:25:52,978 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:52,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:52,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:52,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:52,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:52,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:52,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:52,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:52,982 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:52,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:52,983 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:52,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:52,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:52,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:52,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:52,984 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:52,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:52,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:52,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:52,985 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:52,985 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 00:25:52,985 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 00:25:52,985 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:52,985 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:52,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:52,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:52,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:52,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:52,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:52,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:52,987 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 00:25:52,987 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 00:25:52,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:52,988 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:52,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:52,988 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 00:25:52,988 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:52,988 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 -> 1cd82b96c01a730247618eab1464d47c03eec9013c1d245312913e94981f2bce Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:53,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:53,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:53,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:53,313 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:53,313 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:53,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:54,396 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:54,685 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:54,685 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:54,702 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107e3e8b6/12a3c1da95434b1fa4d7bc73af3b7eed/FLAG3619da787 [2023-09-01 00:25:54,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107e3e8b6/12a3c1da95434b1fa4d7bc73af3b7eed [2023-09-01 00:25:54,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:54,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:54,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:54,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:54,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:54,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d26fe28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:54, skipping insertion in model container [2023-09-01 00:25:54,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:54" (1/1) ... [2023-09-01 00:25:54,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:54,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:54,932 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2023-09-01 00:25:55,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:55,366 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:55,377 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2023-09-01 00:25:55,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:55,505 WARN L667 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 00:25:55,511 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:55,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55 WrapperNode [2023-09-01 00:25:55,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:55,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:55,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:55,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:55,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,573 INFO L138 Inliner]: procedures = 358, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2023-09-01 00:25:55,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:55,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:55,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:55,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:55,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:55,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:55,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:55,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:55,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (1/1) ... [2023-09-01 00:25:55,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:55,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:55,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-09-01 00:25:55,693 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-09-01 00:25:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-09-01 00:25:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-09-01 00:25:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-09-01 00:25:55,715 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-09-01 00:25:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-09-01 00:25:55,715 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-09-01 00:25:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 00:25:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 00:25:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-09-01 00:25:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:55,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:55,718 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:56,029 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:56,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:56,229 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:56,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:56,239 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:56,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:56 BoogieIcfgContainer [2023-09-01 00:25:56,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:56,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:56,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:56,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:56,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:54" (1/3) ... [2023-09-01 00:25:56,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d1d71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:56, skipping insertion in model container [2023-09-01 00:25:56,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:55" (2/3) ... [2023-09-01 00:25:56,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d1d71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:56, skipping insertion in model container [2023-09-01 00:25:56,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:56" (3/3) ... [2023-09-01 00:25:56,251 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-09-01 00:25:56,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:56,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 00:25:56,267 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:56,321 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 00:25:56,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 218 flow [2023-09-01 00:25:56,402 INFO L130 PetriNetUnfolder]: 1/99 cut-off events. [2023-09-01 00:25:56,402 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:56,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 99 events. 1/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-09-01 00:25:56,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 101 transitions, 218 flow [2023-09-01 00:25:56,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:56,413 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:56,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:56,425 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 95 transitions, 202 flow [2023-09-01 00:25:56,455 INFO L130 PetriNetUnfolder]: 1/95 cut-off events. [2023-09-01 00:25:56,455 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 1/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2023-09-01 00:25:56,459 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-09-01 00:26:05,399 INFO L134 LiptonReduction]: Checked pairs total: 2953 [2023-09-01 00:26:05,399 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-09-01 00:26:05,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:26:05,415 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;@4bbf9880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:26:05,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-09-01 00:26:05,416 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 00:26:05,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:26:05,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:05,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:26:05,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:05,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 361, now seen corresponding path program 1 times [2023-09-01 00:26:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:05,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621823076] [2023-09-01 00:26:05,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:05,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:05,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:05,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-09-01 00:26:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:05,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-01 00:26:05,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:05,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:05,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621823076] [2023-09-01 00:26:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621823076] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:26:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121762564] [2023-09-01 00:26:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:05,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:26:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:26:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:26:05,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 196 [2023-09-01 00:26:05,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:05,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 196 [2023-09-01 00:26:05,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:05,804 INFO L130 PetriNetUnfolder]: 245/468 cut-off events. [2023-09-01 00:26:05,805 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2023-09-01 00:26:05,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 468 events. 245/468 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1965 event pairs, 245 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 824. Up to 441 conditions per place. [2023-09-01 00:26:05,828 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 25 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-09-01 00:26:05,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 116 flow [2023-09-01 00:26:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:26:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:26:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 218 transitions. [2023-09-01 00:26:05,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5561224489795918 [2023-09-01 00:26:05,863 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 218 transitions. [2023-09-01 00:26:05,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 218 transitions. [2023-09-01 00:26:05,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:05,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 218 transitions. [2023-09-01 00:26:05,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,904 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,906 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 74 flow. Second operand 2 states and 218 transitions. [2023-09-01 00:26:05,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 116 flow [2023-09-01 00:26:05,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 00:26:05,910 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 58 flow [2023-09-01 00:26:05,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-09-01 00:26:05,914 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2023-09-01 00:26:05,925 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 58 flow [2023-09-01 00:26:05,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:05,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:05,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:26:05,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-09-01 00:26:06,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:06,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 356440, now seen corresponding path program 1 times [2023-09-01 00:26:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066003362] [2023-09-01 00:26:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:06,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:06,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-09-01 00:26:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:06,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 00:26:06,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:06,344 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 00:26:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-09-01 00:26:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:06,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:06,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066003362] [2023-09-01 00:26:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066003362] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:06,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716161476] [2023-09-01 00:26:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:06,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 196 [2023-09-01 00:26:06,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:06,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 196 [2023-09-01 00:26:06,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:06,514 INFO L130 PetriNetUnfolder]: 235/445 cut-off events. [2023-09-01 00:26:06,514 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 00:26:06,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 445 events. 235/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1834 event pairs, 235 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 870. Up to 417 conditions per place. [2023-09-01 00:26:06,518 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-09-01 00:26:06,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2023-09-01 00:26:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-09-01 00:26:06,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812925170068027 [2023-09-01 00:26:06,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-09-01 00:26:06,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-09-01 00:26:06,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:06,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-09-01 00:26:06,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,526 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 58 flow. Second operand 3 states and 283 transitions. [2023-09-01 00:26:06,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2023-09-01 00:26:06,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:26:06,527 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 58 flow [2023-09-01 00:26:06,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-09-01 00:26:06,528 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2023-09-01 00:26:06,528 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 58 flow [2023-09-01 00:26:06,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:06,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:06,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 00:26:06,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:06,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 356438, now seen corresponding path program 1 times [2023-09-01 00:26:06,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:06,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222780317] [2023-09-01 00:26:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:06,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:06,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:06,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:06,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-09-01 00:26:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:06,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:06,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:06,912 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 00:26:06,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-09-01 00:26:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:06,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:06,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:06,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222780317] [2023-09-01 00:26:06,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222780317] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:06,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300377129] [2023-09-01 00:26:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:07,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 196 [2023-09-01 00:26:07,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:07,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 196 [2023-09-01 00:26:07,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:07,101 INFO L130 PetriNetUnfolder]: 225/422 cut-off events. [2023-09-01 00:26:07,101 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 00:26:07,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 422 events. 225/422 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1723 event pairs, 225 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 827. Up to 395 conditions per place. [2023-09-01 00:26:07,106 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 19 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-09-01 00:26:07,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 96 flow [2023-09-01 00:26:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-09-01 00:26:07,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49829931972789115 [2023-09-01 00:26:07,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-09-01 00:26:07,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-09-01 00:26:07,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:07,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-09-01 00:26:07,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,118 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 58 flow. Second operand 3 states and 293 transitions. [2023-09-01 00:26:07,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 96 flow [2023-09-01 00:26:07,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:07,119 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2023-09-01 00:26:07,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:26:07,121 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:26:07,121 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2023-09-01 00:26:07,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:07,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:26:07,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:07,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:07,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash 342545384, now seen corresponding path program 1 times [2023-09-01 00:26:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777406659] [2023-09-01 00:26:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:07,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:07,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-09-01 00:26:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:07,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:07,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:07,481 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 00:26:07,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-09-01 00:26:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:07,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:07,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777406659] [2023-09-01 00:26:07,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777406659] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:07,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:07,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:07,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125451064] [2023-09-01 00:26:07,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:07,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:07,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:07,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:07,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 196 [2023-09-01 00:26:07,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:07,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 196 [2023-09-01 00:26:07,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:07,666 INFO L130 PetriNetUnfolder]: 165/320 cut-off events. [2023-09-01 00:26:07,666 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 00:26:07,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 320 events. 165/320 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1215 event pairs, 165 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 629. Up to 299 conditions per place. [2023-09-01 00:26:07,668 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-09-01 00:26:07,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 92 flow [2023-09-01 00:26:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-09-01 00:26:07,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2023-09-01 00:26:07,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-09-01 00:26:07,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-09-01 00:26:07,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:07,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-09-01 00:26:07,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,675 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 54 flow. Second operand 3 states and 279 transitions. [2023-09-01 00:26:07,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 92 flow [2023-09-01 00:26:07,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:07,676 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2023-09-01 00:26:07,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-09-01 00:26:07,678 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -9 predicate places. [2023-09-01 00:26:07,679 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2023-09-01 00:26:07,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:07,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:07,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 00:26:07,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:07,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:07,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 342545385, now seen corresponding path program 1 times [2023-09-01 00:26:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960827108] [2023-09-01 00:26:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:07,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:07,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-09-01 00:26:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-01 00:26:08,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:08,063 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-09-01 00:26:08,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-09-01 00:26:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:08,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:08,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960827108] [2023-09-01 00:26:08,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960827108] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:08,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:08,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528795355] [2023-09-01 00:26:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:08,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:08,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 196 [2023-09-01 00:26:08,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:08,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 196 [2023-09-01 00:26:08,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:08,262 INFO L130 PetriNetUnfolder]: 105/218 cut-off events. [2023-09-01 00:26:08,262 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 00:26:08,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 218 events. 105/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 738 event pairs, 105 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 431. Up to 203 conditions per place. [2023-09-01 00:26:08,264 INFO L137 encePairwiseOnDemand]: 193/196 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-09-01 00:26:08,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 88 flow [2023-09-01 00:26:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-09-01 00:26:08,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2023-09-01 00:26:08,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-09-01 00:26:08,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-09-01 00:26:08,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:08,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-09-01 00:26:08,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,270 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 52 flow. Second operand 3 states and 290 transitions. [2023-09-01 00:26:08,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 88 flow [2023-09-01 00:26:08,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:08,272 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2023-09-01 00:26:08,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-09-01 00:26:08,274 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -10 predicate places. [2023-09-01 00:26:08,275 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2023-09-01 00:26:08,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:08,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:26:08,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:08,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:08,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2028972836, now seen corresponding path program 1 times [2023-09-01 00:26:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:08,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479469765] [2023-09-01 00:26:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:08,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:08,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-09-01 00:26:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:08,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:08,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:08,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:08,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479469765] [2023-09-01 00:26:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479469765] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:26:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652402075] [2023-09-01 00:26:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:08,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 196 [2023-09-01 00:26:08,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:08,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 196 [2023-09-01 00:26:08,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:08,703 INFO L130 PetriNetUnfolder]: 101/228 cut-off events. [2023-09-01 00:26:08,703 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 00:26:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 228 events. 101/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 888 event pairs, 65 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 441. Up to 146 conditions per place. [2023-09-01 00:26:08,704 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 24 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2023-09-01 00:26:08,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 125 flow [2023-09-01 00:26:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-09-01 00:26:08,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2023-09-01 00:26:08,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-09-01 00:26:08,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-09-01 00:26:08,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:08,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-09-01 00:26:08,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,709 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 50 flow. Second operand 3 states and 302 transitions. [2023-09-01 00:26:08,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 125 flow [2023-09-01 00:26:08,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:08,711 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 72 flow [2023-09-01 00:26:08,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:26:08,712 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:26:08,712 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 72 flow [2023-09-01 00:26:08,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:08,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:08,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:08,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:08,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:08,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash -975290370, now seen corresponding path program 1 times [2023-09-01 00:26:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209736442] [2023-09-01 00:26:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:08,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:08,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:08,927 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:08,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-09-01 00:26:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:26:09,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:26:09,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:26:09,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 00:26:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:26:09,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:26:09,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:26:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209736442] [2023-09-01 00:26:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209736442] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:26:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:26:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:26:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108100715] [2023-09-01 00:26:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:26:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:26:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:26:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:26:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:26:09,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 196 [2023-09-01 00:26:09,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:09,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:26:09,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 196 [2023-09-01 00:26:09,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:26:09,136 INFO L130 PetriNetUnfolder]: 49/134 cut-off events. [2023-09-01 00:26:09,136 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-09-01 00:26:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 134 events. 49/134 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 434 event pairs, 14 based on Foata normal form. 22/156 useless extension candidates. Maximal degree in co-relation 310. Up to 87 conditions per place. [2023-09-01 00:26:09,137 INFO L137 encePairwiseOnDemand]: 190/196 looper letters, 21 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-09-01 00:26:09,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 138 flow [2023-09-01 00:26:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:26:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:26:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-09-01 00:26:09,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2023-09-01 00:26:09,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-09-01 00:26:09,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-09-01 00:26:09,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:26:09,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-09-01 00:26:09,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:09,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:09,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:09,141 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 72 flow. Second operand 3 states and 292 transitions. [2023-09-01 00:26:09,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 138 flow [2023-09-01 00:26:09,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 00:26:09,143 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 76 flow [2023-09-01 00:26:09,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 00:26:09,143 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -8 predicate places. [2023-09-01 00:26:09,143 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 76 flow [2023-09-01 00:26:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:26:09,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:26:09,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:09,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:09,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:09,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-09-01 00:26:09,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:26:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1335942309, now seen corresponding path program 1 times [2023-09-01 00:26:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:26:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334288216] [2023-09-01 00:26:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:26:09,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:26:09,363 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-09-01 00:26:09,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-09-01 00:26:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:26:09,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:26:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:26:09,562 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-09-01 00:26:09,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:26:09,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-09-01 00:26:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-09-01 00:26:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-09-01 00:26:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-09-01 00:26:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-09-01 00:26:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-09-01 00:26:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-09-01 00:26:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-09-01 00:26:09,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-09-01 00:26:09,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-09-01 00:26:09,773 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:26:09,778 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:26:09,778 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:26:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:26:09 BasicIcfg [2023-09-01 00:26:09,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:26:09,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:26:09,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:26:09,801 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:26:09,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:56" (3/4) ... [2023-09-01 00:26:09,804 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:26:09,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:26:09,805 INFO L158 Benchmark]: Toolchain (without parser) took 15087.08ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 68.4MB in the beginning and 58.6MB in the end (delta: 9.8MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,806 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 57.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:26:09,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 792.48ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 48.3MB in the end (delta: 19.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.26ms. Allocated memory is still 90.2MB. Free memory was 48.3MB in the beginning and 45.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,807 INFO L158 Benchmark]: Boogie Preprocessor took 44.06ms. Allocated memory is still 90.2MB. Free memory was 45.3MB in the beginning and 42.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,810 INFO L158 Benchmark]: RCFGBuilder took 622.79ms. Allocated memory is still 90.2MB. Free memory was 42.1MB in the beginning and 42.0MB in the end (delta: 47.6kB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,810 INFO L158 Benchmark]: TraceAbstraction took 13555.74ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 41.2MB in the beginning and 58.6MB in the end (delta: -17.4MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2023-09-01 00:26:09,811 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 136.3MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:26:09,812 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 57.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 792.48ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 48.3MB in the end (delta: 19.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.26ms. Allocated memory is still 90.2MB. Free memory was 48.3MB in the beginning and 45.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.06ms. Allocated memory is still 90.2MB. Free memory was 45.3MB in the beginning and 42.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.79ms. Allocated memory is still 90.2MB. Free memory was 42.1MB in the beginning and 42.0MB in the end (delta: 47.6kB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13555.74ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 41.2MB in the beginning and 58.6MB in the end (delta: -17.4MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 136.3MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 101 PlacesBefore, 37 PlacesAfterwards, 95 TransitionsBefore, 31 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 95 TotalNumberOfCompositions, 2953 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1428, independent: 1303, independent conditional: 0, independent unconditional: 1303, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1428, independent: 770, independent conditional: 0, independent unconditional: 770, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=200, argc=200, argv={202:201}, argv={202:201}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=0, ptr={0:0}, t1={7:0}, t2={5:0}] [L1356] 1 g = 1 VAL [cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=200, argc=200, argv={202:201}, argv={202:201}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=1, ptr={0:0}, ptr={0:0}, t1={7:0}, t2={5:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) [L19] 2 reach_error() VAL [\old(cond)=0, cond=0, cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1371]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1377]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 131 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 59 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 4 NumberOfNonLiveVariables, 473 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-09-01 00:26:09,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample