/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 -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-27 18:22:23,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:22:23,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:22:23,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:22:23,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:22:23,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:22:23,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:22:23,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:22:23,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:22:23,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:22:23,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:22:23,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:22:23,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:22:23,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:22:23,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:22:23,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:22:23,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:22:23,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:22:23,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:22:23,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:22:23,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:22:23,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:22:23,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:22:23,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:22:23,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:22:23,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:22:23,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:22:23,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:22:23,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:22:23,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:22:23,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:22:23,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:22:23,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:22:23,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:22:23,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:22:23,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:22:23,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:22:23,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:22:23,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:22:23,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:22:23,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:22:23,499 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-27 18:22:23,540 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:22:23,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:22:23,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:22:23,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:22:23,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:22:23,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:22:23,543 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:22:23,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:22:23,543 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:22:23,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:22:23,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:22:23,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:22:23,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:22:23,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:22:23,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:22:23,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:22:23,545 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 [2023-01-27 18:22:23,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:22:23,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:22:23,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:22:23,882 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:22:23,882 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:22:23,883 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-27 18:22:25,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:22:25,653 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:22:25,653 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2023-01-27 18:22:25,687 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480302e8a/dec56092e6374d2093685e02094c151a/FLAG0779b689e [2023-01-27 18:22:25,711 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480302e8a/dec56092e6374d2093685e02094c151a [2023-01-27 18:22:25,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:22:25,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:22:25,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:22:25,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:22:25,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:22:25,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:22:25" (1/1) ... [2023-01-27 18:22:25,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7da08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:25, skipping insertion in model container [2023-01-27 18:22:25,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:22:25" (1/1) ... [2023-01-27 18:22:25,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:22:25,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:22:26,002 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-27 18:22:26,718 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-27 18:22:26,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:22:26,797 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:22:26,805 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-27 18:22:26,860 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-27 18:22:26,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:22:27,012 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:22:27,012 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:22:27,012 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:22:27,017 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:22:27,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27 WrapperNode [2023-01-27 18:22:27,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:22:27,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:22:27,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:22:27,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:22:27,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,115 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2023-01-27 18:22:27,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:22:27,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:22:27,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:22:27,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:22:27,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:22:27,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:22:27,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:22:27,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:22:27,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (1/1) ... [2023-01-27 18:22:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:22:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:22:27,260 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-27 18:22:27,305 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-27 18:22:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:22:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:22:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:22:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-01-27 18:22:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:22:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:22:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:22:27,325 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:22:27,733 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:22:27,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:22:28,078 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:22:28,092 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:22:28,092 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:22:28,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:22:28 BoogieIcfgContainer [2023-01-27 18:22:28,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:22:28,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:22:28,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:22:28,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:22:28,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:22:25" (1/3) ... [2023-01-27 18:22:28,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272b26cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:22:28, skipping insertion in model container [2023-01-27 18:22:28,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:22:27" (2/3) ... [2023-01-27 18:22:28,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272b26cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:22:28, skipping insertion in model container [2023-01-27 18:22:28,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:22:28" (3/3) ... [2023-01-27 18:22:28,115 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-01-27 18:22:28,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:22:28,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-01-27 18:22:28,136 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:22:28,246 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 18:22:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 166 transitions, 348 flow [2023-01-27 18:22:28,394 INFO L130 PetriNetUnfolder]: 10/204 cut-off events. [2023-01-27 18:22:28,395 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 18:22:28,398 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-27 18:22:28,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 166 transitions, 348 flow [2023-01-27 18:22:28,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 154 transitions, 320 flow [2023-01-27 18:22:28,403 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:22:28,438 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 154 transitions, 320 flow [2023-01-27 18:22:28,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 154 transitions, 320 flow [2023-01-27 18:22:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 154 transitions, 320 flow [2023-01-27 18:22:28,497 INFO L130 PetriNetUnfolder]: 7/185 cut-off events. [2023-01-27 18:22:28,497 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 18:22:28,499 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-27 18:22:28,501 INFO L119 LiptonReduction]: Number of co-enabled transitions 1584 [2023-01-27 18:22:40,172 INFO L134 LiptonReduction]: Checked pairs total: 3015 [2023-01-27 18:22:40,172 INFO L136 LiptonReduction]: Total number of compositions: 168 [2023-01-27 18:22:40,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:22:40,215 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;@2cf6b098, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:22:40,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-01-27 18:22:40,218 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:22:40,218 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:22:40,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:40,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-01-27 18:22:40,220 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-27 18:22:40,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-01-27 18:22:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351325867] [2023-01-27 18:22:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:40,548 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-27 18:22:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351325867] [2023-01-27 18:22:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351325867] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:40,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-01-27 18:22:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301200212] [2023-01-27 18:22:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:40,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 18:22:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 18:22:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 18:22:40,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 334 [2023-01-27 18:22:40,620 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-27 18:22:40,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:40,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 334 [2023-01-27 18:22:40,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:40,775 INFO L130 PetriNetUnfolder]: 169/315 cut-off events. [2023-01-27 18:22:40,776 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-27 18:22:40,777 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-27 18:22:40,779 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-01-27 18:22:40,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 110 flow [2023-01-27 18:22:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 18:22:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 18:22:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 323 transitions. [2023-01-27 18:22:40,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48353293413173654 [2023-01-27 18:22:40,812 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 323 transitions. [2023-01-27 18:22:40,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 323 transitions. [2023-01-27 18:22:40,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:40,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 323 transitions. [2023-01-27 18:22:40,821 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-27 18:22:40,823 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-27 18:22:40,824 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-27 18:22:40,825 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 68 flow. Second operand 2 states and 323 transitions. [2023-01-27 18:22:40,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 110 flow [2023-01-27 18:22:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:40,834 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2023-01-27 18:22:40,836 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-27 18:22:40,838 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-01-27 18:22:40,838 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2023-01-27 18:22:40,838 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-27 18:22:40,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:40,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-01-27 18:22:40,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:22:40,854 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-27 18:22:40,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 18058040, now seen corresponding path program 1 times [2023-01-27 18:22:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923980969] [2023-01-27 18:22:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:22:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923980969] [2023-01-27 18:22:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923980969] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:22:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200632324] [2023-01-27 18:22:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:22:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:22:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:22:41,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 334 [2023-01-27 18:22:41,410 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-27 18:22:41,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:41,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 334 [2023-01-27 18:22:41,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:41,588 INFO L130 PetriNetUnfolder]: 264/481 cut-off events. [2023-01-27 18:22:41,588 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 18:22:41,591 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-27 18:22:41,592 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 28 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2023-01-27 18:22:41,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 140 flow [2023-01-27 18:22:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:22:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:22:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-01-27 18:22:41,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38822355289421157 [2023-01-27 18:22:41,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-01-27 18:22:41,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-01-27 18:22:41,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:41,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-01-27 18:22:41,596 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-27 18:22:41,598 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-27 18:22:41,599 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-27 18:22:41,599 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 3 states and 389 transitions. [2023-01-27 18:22:41,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 140 flow [2023-01-27 18:22:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:22:41,600 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 90 flow [2023-01-27 18:22:41,600 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-27 18:22:41,601 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-27 18:22:41,601 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 90 flow [2023-01-27 18:22:41,601 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-27 18:22:41,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:41,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:22:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:22:41,602 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-27 18:22:41,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 559797358, now seen corresponding path program 1 times [2023-01-27 18:22:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876714422] [2023-01-27 18:22:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:22:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876714422] [2023-01-27 18:22:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876714422] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:22:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542919578] [2023-01-27 18:22:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:41,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:22:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:22:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:22:41,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 334 [2023-01-27 18:22:41,919 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-27 18:22:41,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:41,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 334 [2023-01-27 18:22:41,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:42,075 INFO L130 PetriNetUnfolder]: 291/536 cut-off events. [2023-01-27 18:22:42,075 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2023-01-27 18:22:42,076 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-27 18:22:42,078 INFO L137 encePairwiseOnDemand]: 327/334 looper letters, 30 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2023-01-27 18:22:42,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 218 flow [2023-01-27 18:22:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:22:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:22:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-01-27 18:22:42,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872255489021956 [2023-01-27 18:22:42,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-01-27 18:22:42,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-01-27 18:22:42,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:42,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-01-27 18:22:42,093 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-27 18:22:42,094 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-27 18:22:42,095 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-27 18:22:42,095 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 90 flow. Second operand 3 states and 388 transitions. [2023-01-27 18:22:42,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 218 flow [2023-01-27 18:22:42,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:22:42,098 INFO L231 Difference]: Finished difference. Result has 32 places, 35 transitions, 155 flow [2023-01-27 18:22:42,098 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-27 18:22:42,099 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-27 18:22:42,101 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 155 flow [2023-01-27 18:22:42,101 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-27 18:22:42,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:42,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:42,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:22:42,102 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-27 18:22:42,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1429961496, now seen corresponding path program 1 times [2023-01-27 18:22:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182791973] [2023-01-27 18:22:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:42,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:42,219 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-27 18:22:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182791973] [2023-01-27 18:22:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182791973] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365470997] [2023-01-27 18:22:42,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:42,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:22:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:42,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:22:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:22:42,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 334 [2023-01-27 18:22:42,223 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-27 18:22:42,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:42,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 334 [2023-01-27 18:22:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:42,296 INFO L130 PetriNetUnfolder]: 72/144 cut-off events. [2023-01-27 18:22:42,296 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2023-01-27 18:22:42,296 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-27 18:22:42,297 INFO L137 encePairwiseOnDemand]: 332/334 looper letters, 23 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-01-27 18:22:42,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 132 flow [2023-01-27 18:22:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:22:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:22:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-01-27 18:22:42,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530938123752495 [2023-01-27 18:22:42,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-01-27 18:22:42,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-01-27 18:22:42,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:42,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-01-27 18:22:42,302 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-27 18:22:42,303 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-27 18:22:42,304 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-27 18:22:42,304 INFO L175 Difference]: Start difference. First operand has 32 places, 35 transitions, 155 flow. Second operand 3 states and 454 transitions. [2023-01-27 18:22:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 132 flow [2023-01-27 18:22:42,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 116 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-27 18:22:42,316 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 50 flow [2023-01-27 18:22:42,316 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-27 18:22:42,318 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2023-01-27 18:22:42,318 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 50 flow [2023-01-27 18:22:42,318 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-27 18:22:42,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:42,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:42,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:22:42,319 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-27 18:22:42,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -48803317, now seen corresponding path program 1 times [2023-01-27 18:22:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376097004] [2023-01-27 18:22:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:43,381 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-27 18:22:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376097004] [2023-01-27 18:22:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376097004] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:43,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:43,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:22:43,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369312449] [2023-01-27 18:22:43,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:43,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:22:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:22:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:22:43,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 334 [2023-01-27 18:22:43,384 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-27 18:22:43,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:43,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 334 [2023-01-27 18:22:43,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:43,635 INFO L130 PetriNetUnfolder]: 108/232 cut-off events. [2023-01-27 18:22:43,636 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-01-27 18:22:43,636 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-27 18:22:43,637 INFO L137 encePairwiseOnDemand]: 325/334 looper letters, 33 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2023-01-27 18:22:43,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 51 transitions, 247 flow [2023-01-27 18:22:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:22:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:22:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2023-01-27 18:22:43,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3306244653550043 [2023-01-27 18:22:43,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2023-01-27 18:22:43,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2023-01-27 18:22:43,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:43,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2023-01-27 18:22:43,641 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-27 18:22:43,643 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-27 18:22:43,644 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-27 18:22:43,644 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 50 flow. Second operand 7 states and 773 transitions. [2023-01-27 18:22:43,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 51 transitions, 247 flow [2023-01-27 18:22:43,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:22:43,646 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 161 flow [2023-01-27 18:22:43,646 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-27 18:22:43,647 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-27 18:22:43,647 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 161 flow [2023-01-27 18:22:43,648 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-27 18:22:43,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:43,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:43,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:22:43,648 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-27 18:22:43,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1052545929, now seen corresponding path program 2 times [2023-01-27 18:22:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:43,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090406449] [2023-01-27 18:22:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:44,860 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-27 18:22:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090406449] [2023-01-27 18:22:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090406449] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:44,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:44,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:22:44,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766625006] [2023-01-27 18:22:44,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:44,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:22:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:22:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:22:44,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 334 [2023-01-27 18:22:44,866 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-27 18:22:44,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:44,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 334 [2023-01-27 18:22:44,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:45,077 INFO L130 PetriNetUnfolder]: 117/260 cut-off events. [2023-01-27 18:22:45,077 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2023-01-27 18:22:45,077 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-27 18:22:45,078 INFO L137 encePairwiseOnDemand]: 326/334 looper letters, 35 selfloop transitions, 19 changer transitions 0/54 dead transitions. [2023-01-27 18:22:45,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 373 flow [2023-01-27 18:22:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:22:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:22:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions. [2023-01-27 18:22:45,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3283433133732535 [2023-01-27 18:22:45,081 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 658 transitions. [2023-01-27 18:22:45,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions. [2023-01-27 18:22:45,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:45,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions. [2023-01-27 18:22:45,083 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-27 18:22:45,084 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-27 18:22:45,085 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-27 18:22:45,085 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 161 flow. Second operand 6 states and 658 transitions. [2023-01-27 18:22:45,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 373 flow [2023-01-27 18:22:45,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 356 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-27 18:22:45,090 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 290 flow [2023-01-27 18:22:45,090 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-27 18:22:45,092 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-27 18:22:45,092 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 290 flow [2023-01-27 18:22:45,092 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-27 18:22:45,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:45,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:45,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:22:45,093 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-27 18:22:45,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1052545944, now seen corresponding path program 1 times [2023-01-27 18:22:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593816059] [2023-01-27 18:22:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:47,411 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-27 18:22:47,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:47,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593816059] [2023-01-27 18:22:47,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593816059] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:47,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:47,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:22:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310505213] [2023-01-27 18:22:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:47,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:22:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:22:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:22:47,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-27 18:22:47,414 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-27 18:22:47,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:47,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-27 18:22:47,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:48,282 INFO L130 PetriNetUnfolder]: 132/307 cut-off events. [2023-01-27 18:22:48,282 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2023-01-27 18:22:48,283 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-27 18:22:48,284 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 68 selfloop transitions, 26 changer transitions 13/107 dead transitions. [2023-01-27 18:22:48,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 906 flow [2023-01-27 18:22:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:22:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:22:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1068 transitions. [2023-01-27 18:22:48,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3197604790419162 [2023-01-27 18:22:48,288 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1068 transitions. [2023-01-27 18:22:48,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1068 transitions. [2023-01-27 18:22:48,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:48,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1068 transitions. [2023-01-27 18:22:48,290 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-27 18:22:48,293 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-27 18:22:48,294 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-27 18:22:48,294 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 290 flow. Second operand 10 states and 1068 transitions. [2023-01-27 18:22:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 906 flow [2023-01-27 18:22:48,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 107 transitions, 879 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-27 18:22:48,312 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 534 flow [2023-01-27 18:22:48,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-27 18:22:48,312 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-01-27 18:22:48,313 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 534 flow [2023-01-27 18:22:48,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-27 18:22:48,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:48,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-27 18:22:48,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:22:48,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-27 18:22:48,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -943397196, now seen corresponding path program 2 times [2023-01-27 18:22:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:48,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490353979] [2023-01-27 18:22:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:50,125 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-27 18:22:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:50,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490353979] [2023-01-27 18:22:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490353979] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:50,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:22:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342597596] [2023-01-27 18:22:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:22:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:22:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:22:50,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-27 18:22:50,129 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-27 18:22:50,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:50,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-27 18:22:50,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:50,976 INFO L130 PetriNetUnfolder]: 149/348 cut-off events. [2023-01-27 18:22:50,976 INFO L131 PetriNetUnfolder]: For 1293/1293 co-relation queries the response was YES. [2023-01-27 18:22:50,977 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-27 18:22:50,978 INFO L137 encePairwiseOnDemand]: 325/334 looper letters, 60 selfloop transitions, 33 changer transitions 16/109 dead transitions. [2023-01-27 18:22:50,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 1122 flow [2023-01-27 18:22:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:22:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:22:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1063 transitions. [2023-01-27 18:22:50,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31826347305389224 [2023-01-27 18:22:50,982 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1063 transitions. [2023-01-27 18:22:50,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1063 transitions. [2023-01-27 18:22:50,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:50,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1063 transitions. [2023-01-27 18:22:50,984 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-27 18:22:50,987 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-27 18:22:50,988 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-27 18:22:50,988 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 534 flow. Second operand 10 states and 1063 transitions. [2023-01-27 18:22:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 1122 flow [2023-01-27 18:22:50,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 1092 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-01-27 18:22:50,994 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 776 flow [2023-01-27 18:22:50,994 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-27 18:22:50,995 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-01-27 18:22:50,995 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 776 flow [2023-01-27 18:22:50,997 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-27 18:22:50,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:50,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:50,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:22:50,998 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-27 18:22:50,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1145278948, now seen corresponding path program 3 times [2023-01-27 18:22:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991043674] [2023-01-27 18:22:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:52,928 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-27 18:22:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991043674] [2023-01-27 18:22:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991043674] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:52,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:22:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742289992] [2023-01-27 18:22:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:22:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:52,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:22:52,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:22:52,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 334 [2023-01-27 18:22:52,932 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-27 18:22:52,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:52,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 334 [2023-01-27 18:22:52,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:53,695 INFO L130 PetriNetUnfolder]: 156/390 cut-off events. [2023-01-27 18:22:53,695 INFO L131 PetriNetUnfolder]: For 1955/1955 co-relation queries the response was YES. [2023-01-27 18:22:53,696 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-27 18:22:53,698 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 83 selfloop transitions, 48 changer transitions 16/147 dead transitions. [2023-01-27 18:22:53,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 147 transitions, 1614 flow [2023-01-27 18:22:53,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 18:22:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 18:22:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1286 transitions. [2023-01-27 18:22:53,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3208582834331337 [2023-01-27 18:22:53,702 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1286 transitions. [2023-01-27 18:22:53,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1286 transitions. [2023-01-27 18:22:53,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:53,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1286 transitions. [2023-01-27 18:22:53,705 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-27 18:22:53,724 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-27 18:22:53,725 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-27 18:22:53,725 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 776 flow. Second operand 12 states and 1286 transitions. [2023-01-27 18:22:53,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 147 transitions, 1614 flow [2023-01-27 18:22:53,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 1522 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-01-27 18:22:53,736 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 1036 flow [2023-01-27 18:22:53,736 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-27 18:22:53,737 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2023-01-27 18:22:53,737 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 1036 flow [2023-01-27 18:22:53,737 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-27 18:22:53,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:53,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:22:53,738 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-27 18:22:53,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -283674976, now seen corresponding path program 4 times [2023-01-27 18:22:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671356731] [2023-01-27 18:22:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:22:53,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:22:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:22:53,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:22:53,924 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:22:53,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-01-27 18:22:53,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-01-27 18:22:53,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-01-27 18:22:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:22:53,926 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-01-27 18:22:53,929 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:22:53,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:22:54,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:22:54 BasicIcfg [2023-01-27 18:22:54,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:22:54,015 INFO L158 Benchmark]: Toolchain (without parser) took 28302.03ms. Allocated memory was 457.2MB in the beginning and 660.6MB in the end (delta: 203.4MB). Free memory was 398.7MB in the beginning and 319.8MB in the end (delta: 78.9MB). Peak memory consumption was 282.8MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 331.4MB. Free memory was 277.7MB in the beginning and 277.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1301.79ms. Allocated memory is still 457.2MB. Free memory was 398.7MB in the beginning and 343.2MB in the end (delta: 55.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.40ms. Allocated memory is still 457.2MB. Free memory was 343.2MB in the beginning and 339.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: Boogie Preprocessor took 75.04ms. Allocated memory is still 457.2MB. Free memory was 339.9MB in the beginning and 336.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: RCFGBuilder took 918.59ms. Allocated memory is still 457.2MB. Free memory was 336.9MB in the beginning and 406.8MB in the end (delta: -70.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,016 INFO L158 Benchmark]: TraceAbstraction took 25903.78ms. Allocated memory was 457.2MB in the beginning and 660.6MB in the end (delta: 203.4MB). Free memory was 405.8MB in the beginning and 319.8MB in the end (delta: 86.0MB). Peak memory consumption was 289.4MB. Max. memory is 16.0GB. [2023-01-27 18:22:54,017 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 331.4MB. Free memory was 277.7MB in the beginning and 277.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 1301.79ms. Allocated memory is still 457.2MB. Free memory was 398.7MB in the beginning and 343.2MB in the end (delta: 55.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 97.40ms. Allocated memory is still 457.2MB. Free memory was 343.2MB in the beginning and 339.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 75.04ms. Allocated memory is still 457.2MB. Free memory was 339.9MB in the beginning and 336.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 918.59ms. Allocated memory is still 457.2MB. Free memory was 336.9MB in the beginning and 406.8MB in the end (delta: -70.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.0GB. * TraceAbstraction took 25903.78ms. Allocated memory was 457.2MB in the beginning and 660.6MB in the end (delta: 203.4MB). Free memory was 405.8MB in the beginning and 319.8MB in the end (delta: 86.0MB). Peak memory consumption was 289.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 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: 25.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.6s 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.7s 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.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-27 18:22:54,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...