/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:50:31,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:50:31,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:50:31,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:50:31,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:50:31,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:50:31,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:50:31,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:50:31,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:50:31,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:50:31,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:50:31,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:50:31,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:50:31,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:50:31,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:50:31,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:50:31,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:50:31,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:50:31,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:50:31,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:50:31,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:50:31,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:50:31,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:50:31,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:50:31,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:50:31,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:50:31,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:50:31,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:50:31,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:50:31,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:50:31,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:50:31,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:50:31,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:50:31,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:50:31,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:50:31,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:50:31,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:50:31,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:50:31,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:50:31,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:50:31,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:50:31,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:50:31,536 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:50:31,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:50:31,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:50:31,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:50:31,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:50:31,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:50:31,539 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:50:31,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:50:31,540 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:50:31,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:50:31,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:50:31,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:50:31,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:50:31,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:50:31,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:50:31,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:50:31,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:50:31,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:50:31,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:50:31,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:50:31,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:50:31,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:50:31,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:50:31,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:50:31,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:50:31,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:50:31,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:50:31,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:50:31,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:50:31,763 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:50:31,763 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:50:31,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-01-28 00:50:32,840 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:50:33,168 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:50:33,169 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-01-28 00:50:33,186 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296f272ea/3dd0caa7a0244e1fbaad8274a1ee8782/FLAGe8deafd4f [2023-01-28 00:50:33,197 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296f272ea/3dd0caa7a0244e1fbaad8274a1ee8782 [2023-01-28 00:50:33,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:50:33,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:50:33,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:50:33,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:50:33,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:50:33,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:33,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5b12fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33, skipping insertion in model container [2023-01-28 00:50:33,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:33,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:50:33,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:50:33,374 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-28 00:50:33,763 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-01-28 00:50:33,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:50:33,802 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:50:33,812 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-28 00:50:33,837 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2023-01-28 00:50:33,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:50:33,959 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:50:33,960 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:50:33,960 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:50:33,966 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:50:33,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33 WrapperNode [2023-01-28 00:50:33,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:50:33,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:50:33,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:50:33,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:50:33,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:33,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,020 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2023-01-28 00:50:34,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:50:34,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:50:34,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:50:34,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:50:34,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:50:34,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:50:34,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:50:34,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:50:34,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (1/1) ... [2023-01-28 00:50:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:50:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:50:34,092 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-01-28 00:50:34,107 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-01-28 00:50:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:50:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:50:34,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:50:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:50:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:50:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-01-28 00:50:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:50:34,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:50:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-01-28 00:50:34,136 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-01-28 00:50:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:50:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:50:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:50:34,138 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:50:34,476 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:50:34,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:50:34,697 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:50:34,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:50:34,714 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:50:34,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:50:34 BoogieIcfgContainer [2023-01-28 00:50:34,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:50:34,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:50:34,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:50:34,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:50:34,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:50:33" (1/3) ... [2023-01-28 00:50:34,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f16a2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:50:34, skipping insertion in model container [2023-01-28 00:50:34,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:50:33" (2/3) ... [2023-01-28 00:50:34,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f16a2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:50:34, skipping insertion in model container [2023-01-28 00:50:34,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:50:34" (3/3) ... [2023-01-28 00:50:34,722 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-01-28 00:50:34,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:50:34,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-01-28 00:50:34,741 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:50:34,807 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 00:50:34,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 166 transitions, 348 flow [2023-01-28 00:50:34,897 INFO L130 PetriNetUnfolder]: 10/204 cut-off events. [2023-01-28 00:50:34,897 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 00:50:34,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 204 events. 10/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 309 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 121. Up to 4 conditions per place. [2023-01-28 00:50:34,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 166 transitions, 348 flow [2023-01-28 00:50:34,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 154 transitions, 320 flow [2023-01-28 00:50:34,921 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:50:34,929 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 154 transitions, 320 flow [2023-01-28 00:50:34,936 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 154 transitions, 320 flow [2023-01-28 00:50:34,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 154 transitions, 320 flow [2023-01-28 00:50:34,987 INFO L130 PetriNetUnfolder]: 7/185 cut-off events. [2023-01-28 00:50:34,987 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 00:50:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 185 events. 7/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 259 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2023-01-28 00:50:34,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 1584 [2023-01-28 00:50:45,456 INFO L134 LiptonReduction]: Checked pairs total: 3015 [2023-01-28 00:50:45,457 INFO L136 LiptonReduction]: Total number of compositions: 168 [2023-01-28 00:50:45,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:50:45,472 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=LoopsAndPotentialCycles, 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;@3e6fcdb9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:50:45,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-01-28 00:50:45,475 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:50:45,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:50:45,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:45,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-01-28 00:50:45,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:45,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-01-28 00:50:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564077294] [2023-01-28 00:50:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564077294] [2023-01-28 00:50:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564077294] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:45,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:45,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-01-28 00:50:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652334913] [2023-01-28 00:50:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:45,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 00:50:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 00:50:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 00:50:45,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-28 00:50:45,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:45,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:45,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-28 00:50:45,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:45,827 INFO L130 PetriNetUnfolder]: 169/315 cut-off events. [2023-01-28 00:50:45,827 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-28 00:50:45,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 315 events. 169/315 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1202 event pairs, 168 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 567. Up to 312 conditions per place. [2023-01-28 00:50:45,832 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-01-28 00:50:45,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 110 flow [2023-01-28 00:50:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 00:50:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 00:50:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 323 transitions. [2023-01-28 00:50:45,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48353293413173654 [2023-01-28 00:50:45,852 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 323 transitions. [2023-01-28 00:50:45,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 323 transitions. [2023-01-28 00:50:45,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:45,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 323 transitions. [2023-01-28 00:50:45,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 161.5) internal successors, (323), 2 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:45,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:45,866 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:45,867 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 68 flow. Second operand 2 states and 323 transitions. [2023-01-28 00:50:45,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 110 flow [2023-01-28 00:50:45,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:50:45,872 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2023-01-28 00:50:45,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-01-28 00:50:45,878 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-01-28 00:50:45,878 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2023-01-28 00:50:45,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:45,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:45,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-01-28 00:50:45,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:50:45,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:45,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash 18058040, now seen corresponding path program 1 times [2023-01-28 00:50:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158776468] [2023-01-28 00:50:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158776468] [2023-01-28 00:50:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158776468] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:46,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:50:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710220020] [2023-01-28 00:50:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:46,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:50:46,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:46,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:50:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:50:46,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 334 [2023-01-28 00:50:46,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:46,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 334 [2023-01-28 00:50:46,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:46,454 INFO L130 PetriNetUnfolder]: 264/481 cut-off events. [2023-01-28 00:50:46,454 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 00:50:46,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 481 events. 264/481 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2028 event pairs, 121 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 967. Up to 381 conditions per place. [2023-01-28 00:50:46,459 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 28 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2023-01-28 00:50:46,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 140 flow [2023-01-28 00:50:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:50:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:50:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-01-28 00:50:46,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38822355289421157 [2023-01-28 00:50:46,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-01-28 00:50:46,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-01-28 00:50:46,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:46,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-01-28 00:50:46,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,468 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 3 states and 389 transitions. [2023-01-28 00:50:46,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 140 flow [2023-01-28 00:50:46,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:50:46,470 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 90 flow [2023-01-28 00:50:46,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2023-01-28 00:50:46,470 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 00:50:46,471 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 90 flow [2023-01-28 00:50:46,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:46,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:50:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:50:46,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:46,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash 559797358, now seen corresponding path program 1 times [2023-01-28 00:50:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445145915] [2023-01-28 00:50:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445145915] [2023-01-28 00:50:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445145915] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:50:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509532837] [2023-01-28 00:50:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:50:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:50:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:50:46,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 334 [2023-01-28 00:50:46,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:46,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 334 [2023-01-28 00:50:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:46,890 INFO L130 PetriNetUnfolder]: 291/536 cut-off events. [2023-01-28 00:50:46,891 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2023-01-28 00:50:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 536 events. 291/536 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2400 event pairs, 135 based on Foata normal form. 32/566 useless extension candidates. Maximal degree in co-relation 1391. Up to 417 conditions per place. [2023-01-28 00:50:46,895 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 30 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2023-01-28 00:50:46,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 218 flow [2023-01-28 00:50:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:50:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:50:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-01-28 00:50:46,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872255489021956 [2023-01-28 00:50:46,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-01-28 00:50:46,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-01-28 00:50:46,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:46,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-01-28 00:50:46,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,901 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 90 flow. Second operand 3 states and 388 transitions. [2023-01-28 00:50:46,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 218 flow [2023-01-28 00:50:46,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:50:46,903 INFO L231 Difference]: Finished difference. Result has 32 places, 35 transitions, 155 flow [2023-01-28 00:50:46,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=32, PETRI_TRANSITIONS=35} [2023-01-28 00:50:46,904 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-28 00:50:46,904 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 155 flow [2023-01-28 00:50:46,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:46,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:46,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:50:46,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:46,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1429961496, now seen corresponding path program 1 times [2023-01-28 00:50:46,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:46,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368062663] [2023-01-28 00:50:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368062663] [2023-01-28 00:50:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368062663] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:46,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:46,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:50:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275844185] [2023-01-28 00:50:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:46,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:50:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:50:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:50:46,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 334 [2023-01-28 00:50:46,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:46,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:46,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 334 [2023-01-28 00:50:46,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:47,057 INFO L130 PetriNetUnfolder]: 72/144 cut-off events. [2023-01-28 00:50:47,058 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2023-01-28 00:50:47,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 144 events. 72/144 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 420 event pairs, 15 based on Foata normal form. 16/159 useless extension candidates. Maximal degree in co-relation 409. Up to 104 conditions per place. [2023-01-28 00:50:47,059 INFO L137 encePairwiseOnDemand]: 332/334 looper letters, 23 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-01-28 00:50:47,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 132 flow [2023-01-28 00:50:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:50:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:50:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-01-28 00:50:47,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530938123752495 [2023-01-28 00:50:47,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-01-28 00:50:47,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-01-28 00:50:47,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:47,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-01-28 00:50:47,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:47,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:47,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:47,070 INFO L175 Difference]: Start difference. First operand has 32 places, 35 transitions, 155 flow. Second operand 3 states and 454 transitions. [2023-01-28 00:50:47,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 132 flow [2023-01-28 00:50:47,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 116 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 00:50:47,072 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 50 flow [2023-01-28 00:50:47,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-01-28 00:50:47,073 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-01-28 00:50:47,073 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 50 flow [2023-01-28 00:50:47,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:47,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:47,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:47,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:50:47,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:47,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -48803317, now seen corresponding path program 1 times [2023-01-28 00:50:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:47,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911763063] [2023-01-28 00:50:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911763063] [2023-01-28 00:50:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911763063] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:50:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693845682] [2023-01-28 00:50:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:47,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:50:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:50:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:50:47,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 334 [2023-01-28 00:50:47,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:47,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:47,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 334 [2023-01-28 00:50:47,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:48,063 INFO L130 PetriNetUnfolder]: 108/232 cut-off events. [2023-01-28 00:50:48,063 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-01-28 00:50:48,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 232 events. 108/232 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 862 event pairs, 10 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 582. Up to 91 conditions per place. [2023-01-28 00:50:48,064 INFO L137 encePairwiseOnDemand]: 325/334 looper letters, 33 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2023-01-28 00:50:48,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 51 transitions, 247 flow [2023-01-28 00:50:48,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:50:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:50:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2023-01-28 00:50:48,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3306244653550043 [2023-01-28 00:50:48,068 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2023-01-28 00:50:48,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2023-01-28 00:50:48,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:48,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2023-01-28 00:50:48,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:48,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:48,075 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:48,075 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 50 flow. Second operand 7 states and 773 transitions. [2023-01-28 00:50:48,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 51 transitions, 247 flow [2023-01-28 00:50:48,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:50:48,077 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 161 flow [2023-01-28 00:50:48,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=161, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-01-28 00:50:48,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-28 00:50:48,080 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 161 flow [2023-01-28 00:50:48,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:48,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:48,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:48,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:50:48,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:48,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1052545929, now seen corresponding path program 2 times [2023-01-28 00:50:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:48,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149732538] [2023-01-28 00:50:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149732538] [2023-01-28 00:50:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149732538] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:50:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278799659] [2023-01-28 00:50:48,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:48,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:50:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:50:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:50:48,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 334 [2023-01-28 00:50:48,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:48,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:48,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 334 [2023-01-28 00:50:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:49,095 INFO L130 PetriNetUnfolder]: 117/260 cut-off events. [2023-01-28 00:50:49,095 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2023-01-28 00:50:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 260 events. 117/260 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1010 event pairs, 39 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 822. Up to 106 conditions per place. [2023-01-28 00:50:49,097 INFO L137 encePairwiseOnDemand]: 326/334 looper letters, 35 selfloop transitions, 19 changer transitions 0/54 dead transitions. [2023-01-28 00:50:49,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 373 flow [2023-01-28 00:50:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:50:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:50:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2023-01-28 00:50:49,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3283433133732535 [2023-01-28 00:50:49,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2023-01-28 00:50:49,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2023-01-28 00:50:49,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:49,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2023-01-28 00:50:49,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:49,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:49,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:49,104 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 161 flow. Second operand 6 states and 658 transitions. [2023-01-28 00:50:49,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 373 flow [2023-01-28 00:50:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 356 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 00:50:49,107 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 290 flow [2023-01-28 00:50:49,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2023-01-28 00:50:49,108 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-28 00:50:49,108 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 290 flow [2023-01-28 00:50:49,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:49,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:49,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:49,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:50:49,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:49,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1052545944, now seen corresponding path program 1 times [2023-01-28 00:50:49,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081344379] [2023-01-28 00:50:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:49,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081344379] [2023-01-28 00:50:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081344379] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 00:50:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012559126] [2023-01-28 00:50:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:50,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 00:50:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 00:50:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-01-28 00:50:50,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-28 00:50:50,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 290 flow. Second operand has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:50,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:50,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-28 00:50:50,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:51,292 INFO L130 PetriNetUnfolder]: 132/307 cut-off events. [2023-01-28 00:50:51,293 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2023-01-28 00:50:51,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 307 events. 132/307 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1354 event pairs, 9 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1103. Up to 104 conditions per place. [2023-01-28 00:50:51,295 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 68 selfloop transitions, 26 changer transitions 13/107 dead transitions. [2023-01-28 00:50:51,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 906 flow [2023-01-28 00:50:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:50:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:50:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1068 transitions. [2023-01-28 00:50:51,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3197604790419162 [2023-01-28 00:50:51,299 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1068 transitions. [2023-01-28 00:50:51,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1068 transitions. [2023-01-28 00:50:51,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:51,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1068 transitions. [2023-01-28 00:50:51,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.8) internal successors, (1068), 10 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:51,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:51,306 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:51,306 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 290 flow. Second operand 10 states and 1068 transitions. [2023-01-28 00:50:51,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 906 flow [2023-01-28 00:50:51,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 107 transitions, 879 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 00:50:51,311 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 534 flow [2023-01-28 00:50:51,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=534, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2023-01-28 00:50:51,312 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-01-28 00:50:51,312 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 534 flow [2023-01-28 00:50:51,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:51,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:51,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:51,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:50:51,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:51,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -943397196, now seen corresponding path program 2 times [2023-01-28 00:50:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061266607] [2023-01-28 00:50:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:52,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:52,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061266607] [2023-01-28 00:50:52,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061266607] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:52,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:52,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 00:50:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908471573] [2023-01-28 00:50:52,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:52,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 00:50:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 00:50:52,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-01-28 00:50:52,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-28 00:50:52,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 534 flow. Second operand has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:52,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:52,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-28 00:50:52,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:53,183 INFO L130 PetriNetUnfolder]: 149/348 cut-off events. [2023-01-28 00:50:53,183 INFO L131 PetriNetUnfolder]: For 1293/1293 co-relation queries the response was YES. [2023-01-28 00:50:53,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 348 events. 149/348 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1607 event pairs, 25 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1609. Up to 189 conditions per place. [2023-01-28 00:50:53,186 INFO L137 encePairwiseOnDemand]: 325/334 looper letters, 60 selfloop transitions, 33 changer transitions 16/109 dead transitions. [2023-01-28 00:50:53,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 1122 flow [2023-01-28 00:50:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:50:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:50:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1063 transitions. [2023-01-28 00:50:53,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31826347305389224 [2023-01-28 00:50:53,190 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1063 transitions. [2023-01-28 00:50:53,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1063 transitions. [2023-01-28 00:50:53,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:53,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1063 transitions. [2023-01-28 00:50:53,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:53,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:53,197 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 334.0) internal successors, (3674), 11 states have internal predecessors, (3674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:53,197 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 534 flow. Second operand 10 states and 1063 transitions. [2023-01-28 00:50:53,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 1122 flow [2023-01-28 00:50:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 1092 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-01-28 00:50:53,204 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 776 flow [2023-01-28 00:50:53,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=776, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2023-01-28 00:50:53,205 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-01-28 00:50:53,205 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 776 flow [2023-01-28 00:50:53,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:53,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:53,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:53,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:50:53,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:53,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1145278948, now seen corresponding path program 3 times [2023-01-28 00:50:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933232561] [2023-01-28 00:50:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933232561] [2023-01-28 00:50:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933232561] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 00:50:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127456077] [2023-01-28 00:50:54,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:54,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 00:50:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 00:50:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-01-28 00:50:54,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-28 00:50:54,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 776 flow. Second operand has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:54,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:54,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-28 00:50:54,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:54,982 INFO L130 PetriNetUnfolder]: 156/390 cut-off events. [2023-01-28 00:50:54,982 INFO L131 PetriNetUnfolder]: For 1955/1955 co-relation queries the response was YES. [2023-01-28 00:50:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1996 conditions, 390 events. 156/390 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1968 event pairs, 20 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1972. Up to 124 conditions per place. [2023-01-28 00:50:54,985 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 83 selfloop transitions, 48 changer transitions 16/147 dead transitions. [2023-01-28 00:50:54,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 147 transitions, 1614 flow [2023-01-28 00:50:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 00:50:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 00:50:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1286 transitions. [2023-01-28 00:50:54,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3208582834331337 [2023-01-28 00:50:54,989 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1286 transitions. [2023-01-28 00:50:54,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1286 transitions. [2023-01-28 00:50:54,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:54,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1286 transitions. [2023-01-28 00:50:54,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.16666666666667) internal successors, (1286), 12 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:54,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 334.0) internal successors, (4342), 13 states have internal predecessors, (4342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:54,998 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 334.0) internal successors, (4342), 13 states have internal predecessors, (4342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:54,998 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 776 flow. Second operand 12 states and 1286 transitions. [2023-01-28 00:50:54,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 147 transitions, 1614 flow [2023-01-28 00:50:55,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 1522 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-01-28 00:50:55,008 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 1036 flow [2023-01-28 00:50:55,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1036, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2023-01-28 00:50:55,009 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2023-01-28 00:50:55,009 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 1036 flow [2023-01-28 00:50:55,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:55,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:55,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:55,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:50:55,010 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-01-28 00:50:55,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -283674976, now seen corresponding path program 4 times [2023-01-28 00:50:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059323831] [2023-01-28 00:50:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:50:55,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:50:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:50:55,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:50:55,124 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:50:55,125 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-01-28 00:50:55,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-01-28 00:50:55,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-01-28 00:50:55,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-01-28 00:50:55,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-01-28 00:50:55,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-01-28 00:50:55,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-01-28 00:50:55,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-01-28 00:50:55,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:50:55,128 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-01-28 00:50:55,132 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:50:55,132 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:50:55,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:50:55 BasicIcfg [2023-01-28 00:50:55,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:50:55,193 INFO L158 Benchmark]: Toolchain (without parser) took 21992.97ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 299.2MB in the beginning and 446.6MB in the end (delta: -147.4MB). Peak memory consumption was 281.3MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,194 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:50:55,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.17ms. Allocated memory is still 341.8MB. Free memory was 299.1MB in the beginning and 302.1MB in the end (delta: -3.1MB). Peak memory consumption was 53.5MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.57ms. Allocated memory is still 341.8MB. Free memory was 302.1MB in the beginning and 298.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,194 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 341.8MB. Free memory was 298.5MB in the beginning and 295.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,194 INFO L158 Benchmark]: RCFGBuilder took 658.81ms. Allocated memory is still 341.8MB. Free memory was 295.8MB in the beginning and 272.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,195 INFO L158 Benchmark]: TraceAbstraction took 20475.21ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 271.3MB in the beginning and 446.6MB in the end (delta: -175.3MB). Peak memory consumption was 250.8MB. Max. memory is 16.0GB. [2023-01-28 00:50:55,196 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 765.17ms. Allocated memory is still 341.8MB. Free memory was 299.1MB in the beginning and 302.1MB in the end (delta: -3.1MB). Peak memory consumption was 53.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.57ms. Allocated memory is still 341.8MB. Free memory was 302.1MB in the beginning and 298.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 341.8MB. Free memory was 298.5MB in the beginning and 295.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 658.81ms. Allocated memory is still 341.8MB. Free memory was 295.8MB in the beginning and 272.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 20475.21ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 271.3MB in the beginning and 446.6MB in the end (delta: -175.3MB). Peak memory consumption was 250.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 154 PlacesBefore, 32 PlacesAfterwards, 154 TransitionsBefore, 28 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 7 FixpointIterations, 98 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 168 TotalNumberOfCompositions, 3015 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1500, independent: 1358, independent conditional: 0, independent unconditional: 1358, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 877, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1500, independent: 524, independent conditional: 0, independent unconditional: 524, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] EXPR 0 data->shared.a [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={5:0}, data={5:0}, my_dev={5:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=-2, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={5:0}, data={5:0}, my_dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=-1, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) VAL [arg={0:0}, data={5:0}, my_dev={5:24}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1696] 1 int lb = data->shared.b; [L1738] COND TRUE 0 probe_ret==0 [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=-2, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-2, \result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, pthread_join(t1, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=-1, \result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, pthread_join(t2, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1714]: 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: 1713]: 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 4 procedures, 170 locations, 8 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: 20.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 1 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1036occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 proved your program to be incorrect! [2023-01-28 00:50:55,218 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...