/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:58:29,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:58:29,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:58:29,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:58:29,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:58:29,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:58:29,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:58:29,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:58:29,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:58:29,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:58:29,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:58:29,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:58:29,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:58:29,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:58:29,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:58:29,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:58:29,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:58:29,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:58:29,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:58:29,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:58:29,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:58:29,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:58:29,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:58:29,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:58:29,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:58:29,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:58:29,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:58:29,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:58:29,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:58:29,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:58:29,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:58:29,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:58:29,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:58:29,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:58:29,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:58:29,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:58:29,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:58:29,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:58:29,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:58:29,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:58:29,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:58:29,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:58:29,130 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:58:29,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:58:29,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:58:29,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:58:29,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:58:29,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:58:29,132 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:58:29,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:58:29,133 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:58:29,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:58:29,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:58:29,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:58:29,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:58:29,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:58:29,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:58:29,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:58:29,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:58:29,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:58:29,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:58:29,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:58:29,136 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:58:29,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:58:29,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:58:29,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:58:29,337 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:58:29,338 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:58:29,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-01-28 07:58:30,482 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:58:30,735 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:58:30,735 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-01-28 07:58:30,757 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482712b1f/0b12276196d54190b8c37cf18b47df05/FLAG113f20f97 [2023-01-28 07:58:30,768 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482712b1f/0b12276196d54190b8c37cf18b47df05 [2023-01-28 07:58:30,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:58:30,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:58:30,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:58:30,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:58:30,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:58:30,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:58:30" (1/1) ... [2023-01-28 07:58:30,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e06b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:30, skipping insertion in model container [2023-01-28 07:58:30,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:58:30" (1/1) ... [2023-01-28 07:58:30,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:58:30,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:58:31,208 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-01-28 07:58:31,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:58:31,261 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:58:31,295 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-01-28 07:58:31,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:58:31,409 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:58:31,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31 WrapperNode [2023-01-28 07:58:31,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:58:31,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:58:31,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:58:31,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:58:31,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,464 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-01-28 07:58:31,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:58:31,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:58:31,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:58:31,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:58:31,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:58:31,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:58:31,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:58:31,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:58:31,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (1/1) ... [2023-01-28 07:58:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:58:31,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:31,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 07:58:31,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 07:58:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:58:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:58:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:58:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:58:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 07:58:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:58:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 07:58:31,569 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 07:58:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:58:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:58:31,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:58:31,570 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:58:31,737 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:58:31,738 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:58:32,091 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:58:32,099 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:58:32,099 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-01-28 07:58:32,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:58:32 BoogieIcfgContainer [2023-01-28 07:58:32,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:58:32,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:58:32,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:58:32,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:58:32,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:58:30" (1/3) ... [2023-01-28 07:58:32,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609268cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:58:32, skipping insertion in model container [2023-01-28 07:58:32,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:58:31" (2/3) ... [2023-01-28 07:58:32,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609268cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:58:32, skipping insertion in model container [2023-01-28 07:58:32,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:58:32" (3/3) ... [2023-01-28 07:58:32,116 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-01-28 07:58:32,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:58:32,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 07:58:32,133 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:58:32,217 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 07:58:32,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 243 transitions, 494 flow [2023-01-28 07:58:32,387 INFO L130 PetriNetUnfolder]: 73/375 cut-off events. [2023-01-28 07:58:32,387 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 07:58:32,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 375 events. 73/375 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1649 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-01-28 07:58:32,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 243 transitions, 494 flow [2023-01-28 07:58:32,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 238 transitions, 481 flow [2023-01-28 07:58:32,411 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:58:32,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 238 transitions, 481 flow [2023-01-28 07:58:32,425 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 238 transitions, 481 flow [2023-01-28 07:58:32,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 238 transitions, 481 flow [2023-01-28 07:58:32,468 INFO L130 PetriNetUnfolder]: 72/370 cut-off events. [2023-01-28 07:58:32,468 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 370 events. 72/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1605 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-01-28 07:58:32,484 INFO L119 LiptonReduction]: Number of co-enabled transitions 19044 [2023-01-28 07:58:35,118 INFO L134 LiptonReduction]: Checked pairs total: 28154 [2023-01-28 07:58:35,118 INFO L136 LiptonReduction]: Total number of compositions: 181 [2023-01-28 07:58:35,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:58:35,146 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;@2f76441f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:58:35,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:58:35,156 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-01-28 07:58:35,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:35,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:35,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:35,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:35,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1091327747, now seen corresponding path program 1 times [2023-01-28 07:58:35,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048523337] [2023-01-28 07:58:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048523337] [2023-01-28 07:58:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048523337] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:58:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:58:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187627256] [2023-01-28 07:58:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:35,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:58:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:58:35,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:58:35,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 424 [2023-01-28 07:58:35,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:35,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 424 [2023-01-28 07:58:35,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:35,656 INFO L130 PetriNetUnfolder]: 596/1256 cut-off events. [2023-01-28 07:58:35,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:35,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 1256 events. 596/1256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7130 event pairs, 480 based on Foata normal form. 217/1239 useless extension candidates. Maximal degree in co-relation 2266. Up to 1093 conditions per place. [2023-01-28 07:58:35,663 INFO L137 encePairwiseOnDemand]: 391/424 looper letters, 52 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-01-28 07:58:35,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 247 flow [2023-01-28 07:58:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:58:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:58:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2023-01-28 07:58:35,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220125786163522 [2023-01-28 07:58:35,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2023-01-28 07:58:35,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2023-01-28 07:58:35,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:35,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2023-01-28 07:58:35,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,701 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 664 transitions. [2023-01-28 07:58:35,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 247 flow [2023-01-28 07:58:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:58:35,706 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 149 flow [2023-01-28 07:58:35,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2023-01-28 07:58:35,712 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-01-28 07:58:35,712 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 149 flow [2023-01-28 07:58:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:35,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:58:35,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:35,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1919799580, now seen corresponding path program 1 times [2023-01-28 07:58:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719619049] [2023-01-28 07:58:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:58:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719619049] [2023-01-28 07:58:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719619049] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:35,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:58:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:58:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909968065] [2023-01-28 07:58:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:35,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:58:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:58:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:58:35,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 424 [2023-01-28 07:58:35,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:35,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:35,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 424 [2023-01-28 07:58:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:36,008 INFO L130 PetriNetUnfolder]: 563/1210 cut-off events. [2023-01-28 07:58:36,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:36,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 1210 events. 563/1210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7469 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 2288. Up to 1044 conditions per place. [2023-01-28 07:58:36,015 INFO L137 encePairwiseOnDemand]: 421/424 looper letters, 69 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-01-28 07:58:36,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 325 flow [2023-01-28 07:58:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:58:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:58:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2023-01-28 07:58:36,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110062893081762 [2023-01-28 07:58:36,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2023-01-28 07:58:36,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2023-01-28 07:58:36,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:36,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2023-01-28 07:58:36,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 424.0) internal successors, (1696), 4 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,025 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 149 flow. Second operand 3 states and 650 transitions. [2023-01-28 07:58:36,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 325 flow [2023-01-28 07:58:36,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 321 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:58:36,029 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 153 flow [2023-01-28 07:58:36,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-01-28 07:58:36,030 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2023-01-28 07:58:36,030 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 153 flow [2023-01-28 07:58:36,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:36,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:36,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:58:36,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:36,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1899619685, now seen corresponding path program 1 times [2023-01-28 07:58:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508463920] [2023-01-28 07:58:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:36,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508463920] [2023-01-28 07:58:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508463920] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:36,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861842033] [2023-01-28 07:58:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:36,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:58:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 07:58:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:58:36,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:36,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861842033] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:36,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:58:36,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918986469] [2023-01-28 07:58:36,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:36,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:58:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:36,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:58:36,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:58:36,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 424 [2023-01-28 07:58:36,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:36,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 424 [2023-01-28 07:58:36,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:36,545 INFO L130 PetriNetUnfolder]: 593/1232 cut-off events. [2023-01-28 07:58:36,546 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-01-28 07:58:36,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1232 events. 593/1232 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6946 event pairs, 480 based on Foata normal form. 3/1026 useless extension candidates. Maximal degree in co-relation 2334. Up to 1062 conditions per place. [2023-01-28 07:58:36,552 INFO L137 encePairwiseOnDemand]: 421/424 looper letters, 52 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-01-28 07:58:36,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 279 flow [2023-01-28 07:58:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:58:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:58:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1218 transitions. [2023-01-28 07:58:36,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47877358490566035 [2023-01-28 07:58:36,556 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1218 transitions. [2023-01-28 07:58:36,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1218 transitions. [2023-01-28 07:58:36,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:36,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1218 transitions. [2023-01-28 07:58:36,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,565 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 153 flow. Second operand 6 states and 1218 transitions. [2023-01-28 07:58:36,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 279 flow [2023-01-28 07:58:36,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:58:36,567 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 185 flow [2023-01-28 07:58:36,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-01-28 07:58:36,568 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2023-01-28 07:58:36,568 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 185 flow [2023-01-28 07:58:36,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:36,570 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:36,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 07:58:36,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:36,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:36,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1327426864, now seen corresponding path program 2 times [2023-01-28 07:58:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:36,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694124800] [2023-01-28 07:58:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694124800] [2023-01-28 07:58:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694124800] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434559156] [2023-01-28 07:58:36,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:58:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:36,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:58:36,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 07:58:36,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:58:36,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:58:36,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-28 07:58:37,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:37,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:58:37,126 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:58:37,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:58:37,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:58:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:58:37,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:58:37,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434559156] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:58:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:58:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185971219] [2023-01-28 07:58:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:37,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:58:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:58:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:58:37,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 424 [2023-01-28 07:58:37,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:37,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:37,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 424 [2023-01-28 07:58:37,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:37,594 INFO L130 PetriNetUnfolder]: 920/1892 cut-off events. [2023-01-28 07:58:37,595 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-01-28 07:58:37,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 1892 events. 920/1892 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11374 event pairs, 123 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 3663. Up to 1162 conditions per place. [2023-01-28 07:58:37,605 INFO L137 encePairwiseOnDemand]: 415/424 looper letters, 121 selfloop transitions, 12 changer transitions 2/146 dead transitions. [2023-01-28 07:58:37,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 613 flow [2023-01-28 07:58:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:58:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:58:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1083 transitions. [2023-01-28 07:58:37,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257075471698113 [2023-01-28 07:58:37,609 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1083 transitions. [2023-01-28 07:58:37,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1083 transitions. [2023-01-28 07:58:37,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:37,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1083 transitions. [2023-01-28 07:58:37,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:37,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:37,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:37,617 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 185 flow. Second operand 6 states and 1083 transitions. [2023-01-28 07:58:37,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 613 flow [2023-01-28 07:58:37,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 599 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:58:37,624 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 252 flow [2023-01-28 07:58:37,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2023-01-28 07:58:37,626 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2023-01-28 07:58:37,627 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 252 flow [2023-01-28 07:58:37,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:37,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:37,628 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:37,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 07:58:37,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-28 07:58:37,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:37,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1046442792, now seen corresponding path program 1 times [2023-01-28 07:58:37,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684899639] [2023-01-28 07:58:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 07:58:37,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684899639] [2023-01-28 07:58:37,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684899639] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532141637] [2023-01-28 07:58:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:37,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:58:37,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 07:58:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:37,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:58:37,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:58:38,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 07:58:38,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532141637] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:38,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:38,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:58:38,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767321899] [2023-01-28 07:58:38,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:38,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:58:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:38,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:58:38,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:58:38,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 424 [2023-01-28 07:58:38,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 188.92857142857142) internal successors, (2645), 14 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:38,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:38,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 424 [2023-01-28 07:58:38,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:38,158 INFO L130 PetriNetUnfolder]: 61/186 cut-off events. [2023-01-28 07:58:38,158 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-01-28 07:58:38,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 186 events. 61/186 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 640 event pairs, 1 based on Foata normal form. 33/213 useless extension candidates. Maximal degree in co-relation 434. Up to 111 conditions per place. [2023-01-28 07:58:38,160 INFO L137 encePairwiseOnDemand]: 419/424 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-01-28 07:58:38,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 316 flow [2023-01-28 07:58:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:58:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:58:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2674 transitions. [2023-01-28 07:58:38,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45047169811320753 [2023-01-28 07:58:38,166 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2674 transitions. [2023-01-28 07:58:38,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2674 transitions. [2023-01-28 07:58:38,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:38,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2674 transitions. [2023-01-28 07:58:38,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:38,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 424.0) internal successors, (6360), 15 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:38,182 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 424.0) internal successors, (6360), 15 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:38,182 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 252 flow. Second operand 14 states and 2674 transitions. [2023-01-28 07:58:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 316 flow [2023-01-28 07:58:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 07:58:38,184 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 171 flow [2023-01-28 07:58:38,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-01-28 07:58:38,185 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-01-28 07:58:38,185 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 171 flow [2023-01-28 07:58:38,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 188.92857142857142) internal successors, (2645), 14 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:38,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:38,187 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:38,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 07:58:38,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:38,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:38,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash -586709385, now seen corresponding path program 1 times [2023-01-28 07:58:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418220643] [2023-01-28 07:58:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:38,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 07:58:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418220643] [2023-01-28 07:58:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418220643] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727597147] [2023-01-28 07:58:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:38,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:58:38,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 07:58:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:39,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 07:58:39,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:39,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:58:39,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:58:39,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:58:39,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:58:39,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 07:58:39,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 07:58:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 07:58:39,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 07:58:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727597147] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:51,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:51,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 07:58:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966313910] [2023-01-28 07:58:51,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:51,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 07:58:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:51,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 07:58:51,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2023-01-28 07:58:51,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 424 [2023-01-28 07:58:51,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 171 flow. Second operand has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:51,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:51,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 424 [2023-01-28 07:58:51,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:52,010 INFO L130 PetriNetUnfolder]: 55/178 cut-off events. [2023-01-28 07:58:52,011 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-01-28 07:58:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 178 events. 55/178 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 480 event pairs, 2 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 370. Up to 38 conditions per place. [2023-01-28 07:58:52,012 INFO L137 encePairwiseOnDemand]: 413/424 looper letters, 54 selfloop transitions, 17 changer transitions 2/77 dead transitions. [2023-01-28 07:58:52,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 417 flow [2023-01-28 07:58:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 07:58:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 07:58:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1840 transitions. [2023-01-28 07:58:52,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36163522012578614 [2023-01-28 07:58:52,017 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1840 transitions. [2023-01-28 07:58:52,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1840 transitions. [2023-01-28 07:58:52,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:52,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1840 transitions. [2023-01-28 07:58:52,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 153.33333333333334) internal successors, (1840), 12 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:52,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 424.0) internal successors, (5512), 13 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:52,030 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 424.0) internal successors, (5512), 13 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:52,030 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 171 flow. Second operand 12 states and 1840 transitions. [2023-01-28 07:58:52,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 417 flow [2023-01-28 07:58:52,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 342 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-01-28 07:58:52,034 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 211 flow [2023-01-28 07:58:52,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-01-28 07:58:52,038 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2023-01-28 07:58:52,038 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 211 flow [2023-01-28 07:58:52,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 150.54545454545453) internal successors, (3312), 22 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:52,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:52,041 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:52,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 07:58:52,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:52,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:58:52,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:52,247 INFO L85 PathProgramCache]: Analyzing trace with hash -431194824, now seen corresponding path program 1 times [2023-01-28 07:58:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:52,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172734204] [2023-01-28 07:58:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 07:58:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172734204] [2023-01-28 07:58:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172734204] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914429899] [2023-01-28 07:58:52,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:52,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:58:52,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 07:58:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:52,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 07:58:52,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:52,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:58:53,050 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:58:53,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:58:53,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:58:53,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 07:58:53,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 07:58:53,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 07:58:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 07:58:56,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:03,956 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 07:59:05,992 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_302)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 07:59:06,015 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_301 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_301))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_302))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 07:59:06,045 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_299 Int) (v_ArrVal_301 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_299)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_301))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_302))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 07:59:06,093 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_299 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_301 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_299)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_301) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_302) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-01-28 07:59:06,125 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_299 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_298))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_299))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_301) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_302) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-01-28 07:59:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-01-28 07:59:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914429899] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:06,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:06,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2023-01-28 07:59:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354142908] [2023-01-28 07:59:06,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:06,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 07:59:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:06,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 07:59:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=206, Unknown=12, NotChecked=210, Total=506 [2023-01-28 07:59:06,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 424 [2023-01-28 07:59:06,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 211 flow. Second operand has 23 states, 23 states have (on average 154.47826086956522) internal successors, (3553), 23 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:06,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:06,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 424 [2023-01-28 07:59:06,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:07,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:09,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:11,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:13,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:21,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:22,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:23,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:24,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:26,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 07:59:32,377 INFO L130 PetriNetUnfolder]: 95/326 cut-off events. [2023-01-28 07:59:32,377 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2023-01-28 07:59:32,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 326 events. 95/326 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1122 event pairs, 3 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 844. Up to 94 conditions per place. [2023-01-28 07:59:32,380 INFO L137 encePairwiseOnDemand]: 416/424 looper letters, 86 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2023-01-28 07:59:32,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 642 flow [2023-01-28 07:59:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 07:59:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 07:59:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1592 transitions. [2023-01-28 07:59:32,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3754716981132076 [2023-01-28 07:59:32,384 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1592 transitions. [2023-01-28 07:59:32,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1592 transitions. [2023-01-28 07:59:32,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:32,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1592 transitions. [2023-01-28 07:59:32,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 159.2) internal successors, (1592), 10 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:32,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 424.0) internal successors, (4664), 11 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:32,394 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 424.0) internal successors, (4664), 11 states have internal predecessors, (4664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:32,394 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 211 flow. Second operand 10 states and 1592 transitions. [2023-01-28 07:59:32,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 642 flow [2023-01-28 07:59:32,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 627 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 07:59:32,398 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 358 flow [2023-01-28 07:59:32,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=358, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-01-28 07:59:32,399 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-01-28 07:59:32,399 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 358 flow [2023-01-28 07:59:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.47826086956522) internal successors, (3553), 23 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:32,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:32,400 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:32,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 07:59:32,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:32,607 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 07:59:32,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2107132424, now seen corresponding path program 2 times [2023-01-28 07:59:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334892111] [2023-01-28 07:59:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 07:59:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334892111] [2023-01-28 07:59:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334892111] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83785877] [2023-01-28 07:59:33,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:33,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 07:59:33,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 07:59:33,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 07:59:33,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:33,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-28 07:59:33,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:33,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:59:33,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:33,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:33,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:33,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 07:59:33,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 07:59:33,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 07:59:33,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:39,520 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-01-28 07:59:41,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-01-28 07:59:41,537 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)) is different from false [2023-01-28 07:59:43,542 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|))) is different from false [2023-01-28 07:59:43,553 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)) is different from false [2023-01-28 07:59:43,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|))) is different from false [2023-01-28 07:59:45,574 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)) is different from false [2023-01-28 07:59:45,587 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_399 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_399))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_404) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)) is different from false [2023-01-28 07:59:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-01-28 07:59:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83785877] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:45,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 24 [2023-01-28 07:59:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342750810] [2023-01-28 07:59:45,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:45,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 07:59:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 07:59:45,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=243, Unknown=10, NotChecked=312, Total=650 [2023-01-28 07:59:45,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 424 [2023-01-28 07:59:45,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 358 flow. Second operand has 26 states, 26 states have (on average 150.46153846153845) internal successors, (3912), 26 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:59:45,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:45,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 424 [2023-01-28 07:59:45,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:55,875 WARN L222 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 42 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:00:00,376 INFO L130 PetriNetUnfolder]: 99/334 cut-off events. [2023-01-28 08:00:00,376 INFO L131 PetriNetUnfolder]: For 476/476 co-relation queries the response was YES. [2023-01-28 08:00:00,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 334 events. 99/334 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1152 event pairs, 7 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 1038. Up to 130 conditions per place. [2023-01-28 08:00:00,377 INFO L137 encePairwiseOnDemand]: 414/424 looper letters, 0 selfloop transitions, 0 changer transitions 87/87 dead transitions. [2023-01-28 08:00:00,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 87 transitions, 629 flow [2023-01-28 08:00:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:00:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:00:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1975 transitions. [2023-01-28 08:00:00,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583091436865022 [2023-01-28 08:00:00,383 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1975 transitions. [2023-01-28 08:00:00,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1975 transitions. [2023-01-28 08:00:00,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:00,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1975 transitions. [2023-01-28 08:00:00,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 151.92307692307693) internal successors, (1975), 13 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:00,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 424.0) internal successors, (5936), 14 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:00,396 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 424.0) internal successors, (5936), 14 states have internal predecessors, (5936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:00,396 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 358 flow. Second operand 13 states and 1975 transitions. [2023-01-28 08:00:00,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 87 transitions, 629 flow [2023-01-28 08:00:00,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 606 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 08:00:00,399 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2023-01-28 08:00:00,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=424, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2023-01-28 08:00:00,400 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places. [2023-01-28 08:00:00,400 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2023-01-28 08:00:00,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 150.46153846153845) internal successors, (3912), 26 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:00,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:00:00,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:00:00,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:00:00,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:00:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:00,616 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-01-28 08:00:00,617 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 08:00:00,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 243 transitions, 494 flow [2023-01-28 08:00:00,646 INFO L130 PetriNetUnfolder]: 73/375 cut-off events. [2023-01-28 08:00:00,647 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 08:00:00,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 375 events. 73/375 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1649 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-01-28 08:00:00,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 243 transitions, 494 flow [2023-01-28 08:00:00,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 238 transitions, 481 flow [2023-01-28 08:00:00,650 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:00:00,650 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 238 transitions, 481 flow [2023-01-28 08:00:00,650 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 238 transitions, 481 flow [2023-01-28 08:00:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 238 transitions, 481 flow [2023-01-28 08:00:00,672 INFO L130 PetriNetUnfolder]: 72/370 cut-off events. [2023-01-28 08:00:00,672 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:00:00,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 370 events. 72/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1605 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 206. Up to 8 conditions per place. [2023-01-28 08:00:00,680 INFO L119 LiptonReduction]: Number of co-enabled transitions 19044 [2023-01-28 08:00:02,803 INFO L134 LiptonReduction]: Checked pairs total: 30988 [2023-01-28 08:00:02,803 INFO L136 LiptonReduction]: Total number of compositions: 179 [2023-01-28 08:00:02,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 08:00:02,805 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;@2f76441f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:00:02,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 08:00:02,807 INFO L130 PetriNetUnfolder]: 12/42 cut-off events. [2023-01-28 08:00:02,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:00:02,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:02,808 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-01-28 08:00:02,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:00:02,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash -86544663, now seen corresponding path program 1 times [2023-01-28 08:00:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124371463] [2023-01-28 08:00:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124371463] [2023-01-28 08:00:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124371463] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:00:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:00:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124165293] [2023-01-28 08:00:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:00:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:00:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:00:02,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 422 [2023-01-28 08:00:02,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:02,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:02,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 422 [2023-01-28 08:00:02,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:02,949 INFO L130 PetriNetUnfolder]: 596/1254 cut-off events. [2023-01-28 08:00:02,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:00:02,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1254 events. 596/1254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7154 event pairs, 480 based on Foata normal form. 216/1231 useless extension candidates. Maximal degree in co-relation 2264. Up to 1093 conditions per place. [2023-01-28 08:00:02,952 INFO L137 encePairwiseOnDemand]: 388/422 looper letters, 22 selfloop transitions, 2 changer transitions 38/67 dead transitions. [2023-01-28 08:00:02,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 247 flow [2023-01-28 08:00:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:00:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:00:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2023-01-28 08:00:02,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252764612954186 [2023-01-28 08:00:02,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 665 transitions. [2023-01-28 08:00:02,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 665 transitions. [2023-01-28 08:00:02,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:02,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 665 transitions. [2023-01-28 08:00:02,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:02,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 422.0) internal successors, (1688), 4 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:02,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 422.0) internal successors, (1688), 4 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:02,958 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 665 transitions. [2023-01-28 08:00:02,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 247 flow [2023-01-28 08:00:02,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:00:02,959 INFO L231 Difference]: Finished difference. Result has 66 places, 29 transitions, 73 flow [2023-01-28 08:00:02,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=66, PETRI_TRANSITIONS=29} [2023-01-28 08:00:02,960 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-01-28 08:00:02,960 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 29 transitions, 73 flow [2023-01-28 08:00:02,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:02,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:02,960 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:02,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 08:00:02,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:00:02,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 327184901, now seen corresponding path program 1 times [2023-01-28 08:00:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920417051] [2023-01-28 08:00:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920417051] [2023-01-28 08:00:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920417051] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378116036] [2023-01-28 08:00:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:02,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:02,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 08:00:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:00:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:03,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378116036] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:03,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:00:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378111762] [2023-01-28 08:00:03,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:03,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:03,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:00:03,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 422 [2023-01-28 08:00:03,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:03,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 422 [2023-01-28 08:00:03,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:03,139 INFO L130 PetriNetUnfolder]: 54/139 cut-off events. [2023-01-28 08:00:03,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:00:03,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 139 events. 54/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 377 event pairs, 45 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 265. Up to 119 conditions per place. [2023-01-28 08:00:03,140 INFO L137 encePairwiseOnDemand]: 419/422 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-01-28 08:00:03,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-01-28 08:00:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2023-01-28 08:00:03,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46919431279620855 [2023-01-28 08:00:03,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1188 transitions. [2023-01-28 08:00:03,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1188 transitions. [2023-01-28 08:00:03,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:03,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1188 transitions. [2023-01-28 08:00:03,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,149 INFO L175 Difference]: Start difference. First operand has 66 places, 29 transitions, 73 flow. Second operand 6 states and 1188 transitions. [2023-01-28 08:00:03,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-01-28 08:00:03,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 135 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:03,150 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-01-28 08:00:03,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-01-28 08:00:03,151 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-01-28 08:00:03,152 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-01-28 08:00:03,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:03,152 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-01-28 08:00:03,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:03,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:03,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:00:03,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1586320873, now seen corresponding path program 2 times [2023-01-28 08:00:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348080796] [2023-01-28 08:00:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348080796] [2023-01-28 08:00:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348080796] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279222028] [2023-01-28 08:00:03,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:00:03,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:03,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:03,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 08:00:03,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:00:03,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:03,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:00:03,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:03,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:00:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279222028] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:03,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:00:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743053194] [2023-01-28 08:00:03,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:03,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:00:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:03,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:00:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:00:03,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 422 [2023-01-28 08:00:03,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 194.30769230769232) internal successors, (2526), 13 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:03,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 422 [2023-01-28 08:00:03,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:03,601 INFO L130 PetriNetUnfolder]: 54/145 cut-off events. [2023-01-28 08:00:03,601 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 08:00:03,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 145 events. 54/145 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 373 event pairs, 45 based on Foata normal form. 6/122 useless extension candidates. Maximal degree in co-relation 256. Up to 119 conditions per place. [2023-01-28 08:00:03,602 INFO L137 encePairwiseOnDemand]: 419/422 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-01-28 08:00:03,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-01-28 08:00:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:00:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:00:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2355 transitions. [2023-01-28 08:00:03,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650473933649289 [2023-01-28 08:00:03,607 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2355 transitions. [2023-01-28 08:00:03,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2355 transitions. [2023-01-28 08:00:03,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:03,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2355 transitions. [2023-01-28 08:00:03,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 196.25) internal successors, (2355), 12 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 422.0) internal successors, (5486), 13 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,618 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 422.0) internal successors, (5486), 13 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,618 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2355 transitions. [2023-01-28 08:00:03,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-01-28 08:00:03,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 193 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:03,620 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-01-28 08:00:03,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=422, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-01-28 08:00:03,621 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-01-28 08:00:03,621 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-01-28 08:00:03,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 194.30769230769232) internal successors, (2526), 13 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:03,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:03,622 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-01-28 08:00:03,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:03,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-28 08:00:03,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:00:03,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 624730217, now seen corresponding path program 3 times [2023-01-28 08:00:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:03,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864927441] [2023-01-28 08:00:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:00:03,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 08:00:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:00:03,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 08:00:03,881 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 08:00:03,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 08:00:03,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 08:00:03,882 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 08:00:03,883 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 08:00:03,884 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 08:00:03,884 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 08:00:03,916 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 08:00:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:03,967 INFO L130 PetriNetUnfolder]: 118/602 cut-off events. [2023-01-28 08:00:03,967 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 08:00:03,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 602 events. 118/602 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3046 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 377. Up to 12 conditions per place. [2023-01-28 08:00:03,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:03,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:03,977 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:00:03,977 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:03,977 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 314 transitions, 646 flow [2023-01-28 08:00:04,028 INFO L130 PetriNetUnfolder]: 118/602 cut-off events. [2023-01-28 08:00:04,028 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 08:00:04,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 602 events. 118/602 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3046 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 377. Up to 12 conditions per place. [2023-01-28 08:00:04,054 INFO L119 LiptonReduction]: Number of co-enabled transitions 49128 [2023-01-28 08:00:06,747 INFO L134 LiptonReduction]: Checked pairs total: 85335 [2023-01-28 08:00:06,747 INFO L136 LiptonReduction]: Total number of compositions: 240 [2023-01-28 08:00:06,749 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:00:06,749 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;@2f76441f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:00:06,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 08:00:06,751 INFO L130 PetriNetUnfolder]: 16/51 cut-off events. [2023-01-28 08:00:06,752 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 08:00:06,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:06,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:06,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:06,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 544654291, now seen corresponding path program 1 times [2023-01-28 08:00:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005120188] [2023-01-28 08:00:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005120188] [2023-01-28 08:00:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005120188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:00:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:00:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978492246] [2023-01-28 08:00:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:06,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:00:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:00:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:00:06,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 554 [2023-01-28 08:00:06,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 134 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:06,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:06,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 554 [2023-01-28 08:00:06,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:08,718 INFO L130 PetriNetUnfolder]: 19933/30665 cut-off events. [2023-01-28 08:00:08,718 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-01-28 08:00:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58992 conditions, 30665 events. 19933/30665 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 212679 event pairs, 17166 based on Foata normal form. 5463/30480 useless extension candidates. Maximal degree in co-relation 20163. Up to 28224 conditions per place. [2023-01-28 08:00:08,854 INFO L137 encePairwiseOnDemand]: 509/554 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-01-28 08:00:08,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-01-28 08:00:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:00:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:00:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2023-01-28 08:00:08,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204572803850782 [2023-01-28 08:00:08,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 865 transitions. [2023-01-28 08:00:08,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 865 transitions. [2023-01-28 08:00:08,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:08,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 865 transitions. [2023-01-28 08:00:08,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:08,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:08,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:08,861 INFO L175 Difference]: Start difference. First operand has 87 places, 134 transitions, 286 flow. Second operand 3 states and 865 transitions. [2023-01-28 08:00:08,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-01-28 08:00:08,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:00:08,863 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-01-28 08:00:08,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2023-01-28 08:00:08,864 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-01-28 08:00:08,864 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-01-28 08:00:08,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:08,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:08,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:08,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 08:00:08,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:08,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1847258826, now seen corresponding path program 1 times [2023-01-28 08:00:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052103176] [2023-01-28 08:00:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052103176] [2023-01-28 08:00:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052103176] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496021997] [2023-01-28 08:00:08,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:08,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:08,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:08,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:08,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 08:00:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:08,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:00:08,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:00:08,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496021997] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:08,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:00:08,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37877415] [2023-01-28 08:00:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:08,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:00:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:08,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:00:08,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:00:08,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 554 [2023-01-28 08:00:08,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:08,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:08,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 554 [2023-01-28 08:00:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:10,399 INFO L130 PetriNetUnfolder]: 19612/30394 cut-off events. [2023-01-28 08:00:10,399 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-01-28 08:00:10,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58717 conditions, 30394 events. 19612/30394 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 215035 event pairs, 8256 based on Foata normal form. 0/24769 useless extension candidates. Maximal degree in co-relation 58704. Up to 28177 conditions per place. [2023-01-28 08:00:10,525 INFO L137 encePairwiseOnDemand]: 551/554 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-01-28 08:00:10,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-01-28 08:00:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:00:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:00:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-01-28 08:00:10,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054151624548736 [2023-01-28 08:00:10,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-01-28 08:00:10,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-01-28 08:00:10,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:10,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-01-28 08:00:10,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:10,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:10,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 554.0) internal successors, (2216), 4 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:10,532 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 840 transitions. [2023-01-28 08:00:10,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-01-28 08:00:10,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 432 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:10,534 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-01-28 08:00:10,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-01-28 08:00:10,534 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-01-28 08:00:10,535 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-01-28 08:00:10,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:10,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:10,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:10,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:10,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 08:00:10,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:10,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1224295752, now seen corresponding path program 1 times [2023-01-28 08:00:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562825043] [2023-01-28 08:00:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562825043] [2023-01-28 08:00:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562825043] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310434743] [2023-01-28 08:00:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:10,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:10,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 08:00:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:10,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:00:10,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:10,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:10,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310434743] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:10,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:10,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:00:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188325312] [2023-01-28 08:00:10,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:10,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:00:10,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 554 [2023-01-28 08:00:10,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 251.14285714285714) internal successors, (1758), 7 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:10,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:10,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 554 [2023-01-28 08:00:10,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:12,688 INFO L130 PetriNetUnfolder]: 20049/30702 cut-off events. [2023-01-28 08:00:12,688 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2023-01-28 08:00:12,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59605 conditions, 30702 events. 20049/30702 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 211204 event pairs, 17166 based on Foata normal form. 3/25281 useless extension candidates. Maximal degree in co-relation 59577. Up to 28195 conditions per place. [2023-01-28 08:00:12,807 INFO L137 encePairwiseOnDemand]: 551/554 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-01-28 08:00:12,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-01-28 08:00:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1575 transitions. [2023-01-28 08:00:12,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47382671480144406 [2023-01-28 08:00:12,816 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1575 transitions. [2023-01-28 08:00:12,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1575 transitions. [2023-01-28 08:00:12,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:12,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1575 transitions. [2023-01-28 08:00:12,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.5) internal successors, (1575), 6 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:12,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:12,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:12,828 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1575 transitions. [2023-01-28 08:00:12,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-01-28 08:00:12,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:12,831 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-01-28 08:00:12,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-01-28 08:00:12,832 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-01-28 08:00:12,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-01-28 08:00:12,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 251.14285714285714) internal successors, (1758), 7 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:12,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:12,833 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:12,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:13,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 08:00:13,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:13,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -95070875, now seen corresponding path program 2 times [2023-01-28 08:00:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579681216] [2023-01-28 08:00:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:00:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579681216] [2023-01-28 08:00:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579681216] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:13,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241869046] [2023-01-28 08:00:13,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:00:13,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:13,119 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:13,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 08:00:13,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:00:13,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:13,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-28 08:00:13,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:13,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:00:13,250 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:13,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:00:13,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:00:13,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241869046] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:13,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:13,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:00:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919675984] [2023-01-28 08:00:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:13,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:00:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:00:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:00:13,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 554 [2023-01-28 08:00:13,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 209.66666666666666) internal successors, (1258), 6 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:13,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:13,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 554 [2023-01-28 08:00:13,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:15,980 INFO L130 PetriNetUnfolder]: 28241/44238 cut-off events. [2023-01-28 08:00:15,980 INFO L131 PetriNetUnfolder]: For 1063/1063 co-relation queries the response was YES. [2023-01-28 08:00:16,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86420 conditions, 44238 events. 28241/44238 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 332813 event pairs, 4119 based on Foata normal form. 0/36612 useless extension candidates. Maximal degree in co-relation 86384. Up to 30377 conditions per place. [2023-01-28 08:00:16,150 INFO L137 encePairwiseOnDemand]: 544/554 looper letters, 203 selfloop transitions, 16 changer transitions 0/235 dead transitions. [2023-01-28 08:00:16,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 235 transitions, 1004 flow [2023-01-28 08:00:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1464 transitions. [2023-01-28 08:00:16,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4404332129963899 [2023-01-28 08:00:16,155 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1464 transitions. [2023-01-28 08:00:16,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1464 transitions. [2023-01-28 08:00:16,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:16,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1464 transitions. [2023-01-28 08:00:16,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:16,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:16,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:16,166 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1464 transitions. [2023-01-28 08:00:16,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 235 transitions, 1004 flow [2023-01-28 08:00:16,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 235 transitions, 990 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:16,170 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-01-28 08:00:16,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2023-01-28 08:00:16,170 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-01-28 08:00:16,170 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-01-28 08:00:16,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.66666666666666) internal successors, (1258), 6 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:16,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:16,171 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:16,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:16,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 08:00:16,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:16,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1150539119, now seen corresponding path program 1 times [2023-01-28 08:00:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225603525] [2023-01-28 08:00:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:00:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225603525] [2023-01-28 08:00:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225603525] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905775103] [2023-01-28 08:00:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:16,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:16,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:16,410 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:16,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 08:00:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:16,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:00:16,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:00:16,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:00:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905775103] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:16,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 08:00:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17337204] [2023-01-28 08:00:16,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:16,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 08:00:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:16,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 08:00:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:00:16,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 554 [2023-01-28 08:00:16,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 244.92857142857142) internal successors, (3429), 14 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:16,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:16,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 554 [2023-01-28 08:00:16,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:18,978 INFO L130 PetriNetUnfolder]: 25825/40715 cut-off events. [2023-01-28 08:00:18,978 INFO L131 PetriNetUnfolder]: For 7936/7936 co-relation queries the response was YES. [2023-01-28 08:00:19,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87564 conditions, 40715 events. 25825/40715 cut-off events. For 7936/7936 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 309880 event pairs, 331 based on Foata normal form. 33/35968 useless extension candidates. Maximal degree in co-relation 87505. Up to 36503 conditions per place. [2023-01-28 08:00:19,377 INFO L137 encePairwiseOnDemand]: 549/554 looper letters, 142 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2023-01-28 08:00:19,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-01-28 08:00:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:00:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:00:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3545 transitions. [2023-01-28 08:00:19,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570654976792161 [2023-01-28 08:00:19,383 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3545 transitions. [2023-01-28 08:00:19,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3545 transitions. [2023-01-28 08:00:19,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:19,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3545 transitions. [2023-01-28 08:00:19,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 253.21428571428572) internal successors, (3545), 14 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:19,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 554.0) internal successors, (8310), 15 states have internal predecessors, (8310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:19,403 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 554.0) internal successors, (8310), 15 states have internal predecessors, (8310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:19,403 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3545 transitions. [2023-01-28 08:00:19,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-01-28 08:00:19,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:00:19,429 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 415 flow [2023-01-28 08:00:19,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=415, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2023-01-28 08:00:19,430 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 34 predicate places. [2023-01-28 08:00:19,430 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 415 flow [2023-01-28 08:00:19,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 244.92857142857142) internal successors, (3429), 14 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:19,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:19,431 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:19,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:19,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 08:00:19,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:19,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash 183254497, now seen corresponding path program 1 times [2023-01-28 08:00:19,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369903326] [2023-01-28 08:00:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:19,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369903326] [2023-01-28 08:00:19,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369903326] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:19,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856578602] [2023-01-28 08:00:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:19,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:19,813 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:19,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 08:00:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:19,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 08:00:19,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:19,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:00:20,005 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:20,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:00:20,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:20,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:20,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:24,109 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_668) |c_~#cache~0.base|))) is different from false [2023-01-28 08:00:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:00:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856578602] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:24,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-01-28 08:00:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625512000] [2023-01-28 08:00:24,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:24,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 08:00:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:24,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 08:00:24,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-01-28 08:00:24,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 554 [2023-01-28 08:00:24,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 415 flow. Second operand has 12 states, 12 states have (on average 210.91666666666666) internal successors, (2531), 12 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:24,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:24,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 554 [2023-01-28 08:00:24,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:27,618 INFO L130 PetriNetUnfolder]: 32839/50613 cut-off events. [2023-01-28 08:00:27,618 INFO L131 PetriNetUnfolder]: For 11969/11969 co-relation queries the response was YES. [2023-01-28 08:00:27,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110359 conditions, 50613 events. 32839/50613 cut-off events. For 11969/11969 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 377536 event pairs, 4698 based on Foata normal form. 0/44664 useless extension candidates. Maximal degree in co-relation 110286. Up to 30199 conditions per place. [2023-01-28 08:00:27,933 INFO L137 encePairwiseOnDemand]: 540/554 looper letters, 253 selfloop transitions, 33 changer transitions 0/302 dead transitions. [2023-01-28 08:00:27,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 302 transitions, 1482 flow [2023-01-28 08:00:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:00:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 08:00:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1720 transitions. [2023-01-28 08:00:27,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443527591542032 [2023-01-28 08:00:27,937 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1720 transitions. [2023-01-28 08:00:27,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1720 transitions. [2023-01-28 08:00:27,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:27,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1720 transitions. [2023-01-28 08:00:27,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 245.71428571428572) internal successors, (1720), 7 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:27,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:27,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:27,944 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 415 flow. Second operand 7 states and 1720 transitions. [2023-01-28 08:00:27,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 302 transitions, 1482 flow [2023-01-28 08:00:27,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 302 transitions, 1405 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-01-28 08:00:27,999 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 573 flow [2023-01-28 08:00:27,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2023-01-28 08:00:27,999 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-01-28 08:00:28,000 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 573 flow [2023-01-28 08:00:28,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 210.91666666666666) internal successors, (2531), 12 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:28,001 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:28,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 08:00:28,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:28,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1892684362, now seen corresponding path program 1 times [2023-01-28 08:00:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948587421] [2023-01-28 08:00:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948587421] [2023-01-28 08:00:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948587421] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839206156] [2023-01-28 08:00:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:28,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:28,265 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 08:00:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 08:00:28,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:28,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839206156] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:28,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-01-28 08:00:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340630389] [2023-01-28 08:00:28,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:28,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 08:00:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 08:00:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-01-28 08:00:28,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 554 [2023-01-28 08:00:28,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 251.88888888888889) internal successors, (2267), 9 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:28,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 554 [2023-01-28 08:00:28,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:28,866 INFO L130 PetriNetUnfolder]: 2603/4612 cut-off events. [2023-01-28 08:00:28,866 INFO L131 PetriNetUnfolder]: For 3210/3210 co-relation queries the response was YES. [2023-01-28 08:00:28,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12792 conditions, 4612 events. 2603/4612 cut-off events. For 3210/3210 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 28619 event pairs, 181 based on Foata normal form. 477/4902 useless extension candidates. Maximal degree in co-relation 12303. Up to 2957 conditions per place. [2023-01-28 08:00:28,885 INFO L137 encePairwiseOnDemand]: 551/554 looper letters, 122 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-01-28 08:00:28,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 758 flow [2023-01-28 08:00:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:00:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:00:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1338 transitions. [2023-01-28 08:00:28,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830324909747292 [2023-01-28 08:00:28,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1338 transitions. [2023-01-28 08:00:28,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1338 transitions. [2023-01-28 08:00:28,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:28,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1338 transitions. [2023-01-28 08:00:28,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 554.0) internal successors, (3324), 6 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 554.0) internal successors, (3324), 6 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,894 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 573 flow. Second operand 5 states and 1338 transitions. [2023-01-28 08:00:28,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 758 flow [2023-01-28 08:00:28,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 720 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-01-28 08:00:28,904 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 253 flow [2023-01-28 08:00:28,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-01-28 08:00:28,904 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2023-01-28 08:00:28,904 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 253 flow [2023-01-28 08:00:28,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 251.88888888888889) internal successors, (2267), 9 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:28,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:28,905 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:28,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:29,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:29,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:29,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1516678882, now seen corresponding path program 1 times [2023-01-28 08:00:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985658433] [2023-01-28 08:00:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985658433] [2023-01-28 08:00:29,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985658433] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:00:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:00:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774713375] [2023-01-28 08:00:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:29,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:00:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:00:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:00:29,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 554 [2023-01-28 08:00:29,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:29,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:29,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 554 [2023-01-28 08:00:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:29,868 INFO L130 PetriNetUnfolder]: 3853/6515 cut-off events. [2023-01-28 08:00:29,868 INFO L131 PetriNetUnfolder]: For 5138/5138 co-relation queries the response was YES. [2023-01-28 08:00:29,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17202 conditions, 6515 events. 3853/6515 cut-off events. For 5138/5138 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40838 event pairs, 472 based on Foata normal form. 198/6442 useless extension candidates. Maximal degree in co-relation 15429. Up to 3045 conditions per place. [2023-01-28 08:00:29,895 INFO L137 encePairwiseOnDemand]: 539/554 looper letters, 114 selfloop transitions, 24 changer transitions 0/145 dead transitions. [2023-01-28 08:00:29,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 145 transitions, 809 flow [2023-01-28 08:00:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2023-01-28 08:00:29,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39651022864019253 [2023-01-28 08:00:29,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1318 transitions. [2023-01-28 08:00:29,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1318 transitions. [2023-01-28 08:00:29,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:29,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1318 transitions. [2023-01-28 08:00:29,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:29,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:29,900 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:29,900 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 253 flow. Second operand 6 states and 1318 transitions. [2023-01-28 08:00:29,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 145 transitions, 809 flow [2023-01-28 08:00:29,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 145 transitions, 797 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 08:00:29,906 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 386 flow [2023-01-28 08:00:29,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2023-01-28 08:00:29,907 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -3 predicate places. [2023-01-28 08:00:29,907 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 386 flow [2023-01-28 08:00:29,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:29,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:29,907 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:29,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-28 08:00:29,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:29,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:29,908 INFO L85 PathProgramCache]: Analyzing trace with hash 263056958, now seen corresponding path program 1 times [2023-01-28 08:00:29,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129294051] [2023-01-28 08:00:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129294051] [2023-01-28 08:00:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129294051] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793660689] [2023-01-28 08:00:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:30,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:30,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:30,439 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:30,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 08:00:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:30,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-28 08:00:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:30,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 08:00:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:30,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793660689] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-01-28 08:00:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326421528] [2023-01-28 08:00:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:30,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:00:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:00:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:00:30,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 554 [2023-01-28 08:00:30,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:30,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:30,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 554 [2023-01-28 08:00:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:31,761 INFO L130 PetriNetUnfolder]: 7811/13252 cut-off events. [2023-01-28 08:00:31,761 INFO L131 PetriNetUnfolder]: For 10723/10729 co-relation queries the response was YES. [2023-01-28 08:00:31,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39890 conditions, 13252 events. 7811/13252 cut-off events. For 10723/10729 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 94394 event pairs, 2843 based on Foata normal form. 226/12829 useless extension candidates. Maximal degree in co-relation 35112. Up to 5941 conditions per place. [2023-01-28 08:00:31,820 INFO L137 encePairwiseOnDemand]: 539/554 looper letters, 226 selfloop transitions, 35 changer transitions 0/268 dead transitions. [2023-01-28 08:00:31,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 268 transitions, 1742 flow [2023-01-28 08:00:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:00:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 08:00:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1600 transitions. [2023-01-28 08:00:31,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125838060856111 [2023-01-28 08:00:31,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1600 transitions. [2023-01-28 08:00:31,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1600 transitions. [2023-01-28 08:00:31,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:31,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1600 transitions. [2023-01-28 08:00:31,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 228.57142857142858) internal successors, (1600), 7 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:31,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:31,827 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:31,827 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 386 flow. Second operand 7 states and 1600 transitions. [2023-01-28 08:00:31,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 268 transitions, 1742 flow [2023-01-28 08:00:31,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 268 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:31,838 INFO L231 Difference]: Finished difference. Result has 93 places, 118 transitions, 724 flow [2023-01-28 08:00:31,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=724, PETRI_PLACES=93, PETRI_TRANSITIONS=118} [2023-01-28 08:00:31,838 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2023-01-28 08:00:31,838 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 118 transitions, 724 flow [2023-01-28 08:00:31,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:31,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:31,839 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:31,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:32,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:32,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 845597004, now seen corresponding path program 2 times [2023-01-28 08:00:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406086921] [2023-01-28 08:00:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406086921] [2023-01-28 08:00:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406086921] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39276815] [2023-01-28 08:00:32,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:00:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:32,645 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:32,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 08:00:32,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:00:32,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:32,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2023-01-28 08:00:32,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:32,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:00:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:00:32,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39276815] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:32,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-01-28 08:00:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046782512] [2023-01-28 08:00:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:32,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:00:32,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:00:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:00:32,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 554 [2023-01-28 08:00:32,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 118 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:32,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:32,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 554 [2023-01-28 08:00:32,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:34,163 INFO L130 PetriNetUnfolder]: 10593/18227 cut-off events. [2023-01-28 08:00:34,164 INFO L131 PetriNetUnfolder]: For 27868/27910 co-relation queries the response was YES. [2023-01-28 08:00:34,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62727 conditions, 18227 events. 10593/18227 cut-off events. For 27868/27910 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 139944 event pairs, 4811 based on Foata normal form. 156/17344 useless extension candidates. Maximal degree in co-relation 25994. Up to 11359 conditions per place. [2023-01-28 08:00:34,264 INFO L137 encePairwiseOnDemand]: 541/554 looper letters, 183 selfloop transitions, 40 changer transitions 0/230 dead transitions. [2023-01-28 08:00:34,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 230 transitions, 1857 flow [2023-01-28 08:00:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-01-28 08:00:34,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019253910950662 [2023-01-28 08:00:34,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-01-28 08:00:34,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-01-28 08:00:34,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:34,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-01-28 08:00:34,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:34,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:34,268 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:34,268 INFO L175 Difference]: Start difference. First operand has 93 places, 118 transitions, 724 flow. Second operand 6 states and 1336 transitions. [2023-01-28 08:00:34,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 230 transitions, 1857 flow [2023-01-28 08:00:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 230 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:34,293 INFO L231 Difference]: Finished difference. Result has 100 places, 141 transitions, 1096 flow [2023-01-28 08:00:34,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1096, PETRI_PLACES=100, PETRI_TRANSITIONS=141} [2023-01-28 08:00:34,294 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 13 predicate places. [2023-01-28 08:00:34,294 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 141 transitions, 1096 flow [2023-01-28 08:00:34,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:34,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:34,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:34,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:34,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-01-28 08:00:34,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:34,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -838986962, now seen corresponding path program 3 times [2023-01-28 08:00:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:34,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741474978] [2023-01-28 08:00:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741474978] [2023-01-28 08:00:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741474978] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651179099] [2023-01-28 08:00:34,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:00:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:34,965 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:34,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-28 08:00:35,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-28 08:00:35,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-28 08:00:35,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:35,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:00:35,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:35,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:00:35,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:35,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:00:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:35,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651179099] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-01-28 08:00:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565581726] [2023-01-28 08:00:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:35,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-01-28 08:00:35,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 554 [2023-01-28 08:00:35,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 141 transitions, 1096 flow. Second operand has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:35,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:35,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 554 [2023-01-28 08:00:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:37,025 INFO L130 PetriNetUnfolder]: 11268/19381 cut-off events. [2023-01-28 08:00:37,025 INFO L131 PetriNetUnfolder]: For 41553/41613 co-relation queries the response was YES. [2023-01-28 08:00:37,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72198 conditions, 19381 events. 11268/19381 cut-off events. For 41553/41613 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 151047 event pairs, 4291 based on Foata normal form. 42/18307 useless extension candidates. Maximal degree in co-relation 62409. Up to 9186 conditions per place. [2023-01-28 08:00:37,140 INFO L137 encePairwiseOnDemand]: 547/554 looper letters, 229 selfloop transitions, 30 changer transitions 0/266 dead transitions. [2023-01-28 08:00:37,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 266 transitions, 2397 flow [2023-01-28 08:00:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2023-01-28 08:00:37,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.394705174488568 [2023-01-28 08:00:37,142 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2023-01-28 08:00:37,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2023-01-28 08:00:37,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:37,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2023-01-28 08:00:37,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:37,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:37,145 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:37,145 INFO L175 Difference]: Start difference. First operand has 100 places, 141 transitions, 1096 flow. Second operand 6 states and 1312 transitions. [2023-01-28 08:00:37,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 266 transitions, 2397 flow [2023-01-28 08:00:37,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 266 transitions, 2392 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 08:00:37,170 INFO L231 Difference]: Finished difference. Result has 106 places, 148 transitions, 1251 flow [2023-01-28 08:00:37,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1251, PETRI_PLACES=106, PETRI_TRANSITIONS=148} [2023-01-28 08:00:37,171 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 19 predicate places. [2023-01-28 08:00:37,171 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 148 transitions, 1251 flow [2023-01-28 08:00:37,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:37,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:37,171 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:37,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:37,378 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:37,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1255288006, now seen corresponding path program 4 times [2023-01-28 08:00:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834901369] [2023-01-28 08:00:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834901369] [2023-01-28 08:00:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834901369] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754069186] [2023-01-28 08:00:37,782 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:00:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:37,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-28 08:00:37,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:00:37,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:37,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-28 08:00:37,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:38,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 08:00:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:00:38,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754069186] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:38,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:38,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-01-28 08:00:38,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412269664] [2023-01-28 08:00:38,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:38,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:00:38,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:38,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:00:38,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:00:38,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 554 [2023-01-28 08:00:38,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 148 transitions, 1251 flow. Second operand has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:38,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:38,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 554 [2023-01-28 08:00:38,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:39,606 INFO L130 PetriNetUnfolder]: 10712/18503 cut-off events. [2023-01-28 08:00:39,606 INFO L131 PetriNetUnfolder]: For 47405/47453 co-relation queries the response was YES. [2023-01-28 08:00:39,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71252 conditions, 18503 events. 10712/18503 cut-off events. For 47405/47453 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 144088 event pairs, 5390 based on Foata normal form. 54/17553 useless extension candidates. Maximal degree in co-relation 46804. Up to 12264 conditions per place. [2023-01-28 08:00:39,748 INFO L137 encePairwiseOnDemand]: 541/554 looper letters, 230 selfloop transitions, 34 changer transitions 0/271 dead transitions. [2023-01-28 08:00:39,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 271 transitions, 2505 flow [2023-01-28 08:00:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2023-01-28 08:00:39,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4094464500601685 [2023-01-28 08:00:39,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1361 transitions. [2023-01-28 08:00:39,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1361 transitions. [2023-01-28 08:00:39,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:39,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1361 transitions. [2023-01-28 08:00:39,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:39,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:39,753 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:39,753 INFO L175 Difference]: Start difference. First operand has 106 places, 148 transitions, 1251 flow. Second operand 6 states and 1361 transitions. [2023-01-28 08:00:39,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 271 transitions, 2505 flow [2023-01-28 08:00:39,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 271 transitions, 2469 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-01-28 08:00:39,791 INFO L231 Difference]: Finished difference. Result has 112 places, 159 transitions, 1509 flow [2023-01-28 08:00:39,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1509, PETRI_PLACES=112, PETRI_TRANSITIONS=159} [2023-01-28 08:00:39,792 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 25 predicate places. [2023-01-28 08:00:39,792 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 159 transitions, 1509 flow [2023-01-28 08:00:39,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:39,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:39,792 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:39,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:40,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:40,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:40,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1836507504, now seen corresponding path program 5 times [2023-01-28 08:00:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765700270] [2023-01-28 08:00:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:40,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765700270] [2023-01-28 08:00:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765700270] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:40,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9115210] [2023-01-28 08:00:40,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:00:40,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:40,549 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:40,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-28 08:00:40,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:00:40,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:40,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 08:00:40,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:40,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 08:00:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:40,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 08:00:40,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:40,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 08:00:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:40,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9115210] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:40,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:40,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-01-28 08:00:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584843626] [2023-01-28 08:00:40,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:40,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:40,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-01-28 08:00:40,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 554 [2023-01-28 08:00:40,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 159 transitions, 1509 flow. Second operand has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:40,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:40,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 554 [2023-01-28 08:00:40,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:42,804 INFO L130 PetriNetUnfolder]: 10218/17641 cut-off events. [2023-01-28 08:00:42,805 INFO L131 PetriNetUnfolder]: For 48447/48483 co-relation queries the response was YES. [2023-01-28 08:00:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68391 conditions, 17641 events. 10218/17641 cut-off events. For 48447/48483 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 137593 event pairs, 4621 based on Foata normal form. 48/16702 useless extension candidates. Maximal degree in co-relation 67424. Up to 8971 conditions per place. [2023-01-28 08:00:42,943 INFO L137 encePairwiseOnDemand]: 547/554 looper letters, 216 selfloop transitions, 16 changer transitions 0/239 dead transitions. [2023-01-28 08:00:42,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 239 transitions, 2284 flow [2023-01-28 08:00:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:00:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:00:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1309 transitions. [2023-01-28 08:00:42,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3938026474127557 [2023-01-28 08:00:42,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1309 transitions. [2023-01-28 08:00:42,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1309 transitions. [2023-01-28 08:00:42,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:42,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1309 transitions. [2023-01-28 08:00:42,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:42,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:42,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 554.0) internal successors, (3878), 7 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:42,949 INFO L175 Difference]: Start difference. First operand has 112 places, 159 transitions, 1509 flow. Second operand 6 states and 1309 transitions. [2023-01-28 08:00:42,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 239 transitions, 2284 flow [2023-01-28 08:00:42,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 239 transitions, 2250 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 08:00:42,984 INFO L231 Difference]: Finished difference. Result has 115 places, 147 transitions, 1333 flow [2023-01-28 08:00:42,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1333, PETRI_PLACES=115, PETRI_TRANSITIONS=147} [2023-01-28 08:00:42,984 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 28 predicate places. [2023-01-28 08:00:42,984 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 147 transitions, 1333 flow [2023-01-28 08:00:42,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:42,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:42,985 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:42,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:43,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:43,185 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:43,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 940114828, now seen corresponding path program 6 times [2023-01-28 08:00:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172809611] [2023-01-28 08:00:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:00:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172809611] [2023-01-28 08:00:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172809611] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66993558] [2023-01-28 08:00:43,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:00:43,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:43,689 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:43,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-28 08:00:43,826 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-01-28 08:00:43,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:00:43,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-28 08:00:43,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:43,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:00:43,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:43,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:00:44,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:00:44,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:00:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:00:44,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:00:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66993558] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:00:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:00:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-01-28 08:00:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925696987] [2023-01-28 08:00:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:00:44,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:00:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:00:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-01-28 08:00:44,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 554 [2023-01-28 08:00:44,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 147 transitions, 1333 flow. Second operand has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:44,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:44,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 554 [2023-01-28 08:00:44,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:00:45,651 INFO L130 PetriNetUnfolder]: 10207/17668 cut-off events. [2023-01-28 08:00:45,652 INFO L131 PetriNetUnfolder]: For 48507/48531 co-relation queries the response was YES. [2023-01-28 08:00:45,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67668 conditions, 17668 events. 10207/17668 cut-off events. For 48507/48531 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 136021 event pairs, 5194 based on Foata normal form. 36/16736 useless extension candidates. Maximal degree in co-relation 66650. Up to 12215 conditions per place. [2023-01-28 08:00:45,790 INFO L137 encePairwiseOnDemand]: 547/554 looper letters, 216 selfloop transitions, 22 changer transitions 0/245 dead transitions. [2023-01-28 08:00:45,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 245 transitions, 2234 flow [2023-01-28 08:00:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:00:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 08:00:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1525 transitions. [2023-01-28 08:00:45,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39324394017534814 [2023-01-28 08:00:45,792 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1525 transitions. [2023-01-28 08:00:45,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1525 transitions. [2023-01-28 08:00:45,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:45,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1525 transitions. [2023-01-28 08:00:45,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.85714285714286) internal successors, (1525), 7 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:45,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:45,797 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 554.0) internal successors, (4432), 8 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:45,797 INFO L175 Difference]: Start difference. First operand has 115 places, 147 transitions, 1333 flow. Second operand 7 states and 1525 transitions. [2023-01-28 08:00:45,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 245 transitions, 2234 flow [2023-01-28 08:00:45,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 245 transitions, 2212 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 08:00:45,844 INFO L231 Difference]: Finished difference. Result has 119 places, 139 transitions, 1228 flow [2023-01-28 08:00:45,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1228, PETRI_PLACES=119, PETRI_TRANSITIONS=139} [2023-01-28 08:00:45,844 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 32 predicate places. [2023-01-28 08:00:45,844 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 139 transitions, 1228 flow [2023-01-28 08:00:45,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.71428571428572) internal successors, (1398), 7 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:00:45,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:45,845 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:00:45,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-28 08:00:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-28 08:00:46,049 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:00:46,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 518824181, now seen corresponding path program 1 times [2023-01-28 08:00:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015898645] [2023-01-28 08:00:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:46,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:46,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015898645] [2023-01-28 08:00:46,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015898645] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:46,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229307858] [2023-01-28 08:00:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:46,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:46,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:46,337 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:00:46,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-28 08:00:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:46,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 08:00:46,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:00:46,546 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:46,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:00:46,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:00:46,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:00:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:00:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:00:50,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:00,846 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:01:02,869 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_1349 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1349)) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:01:15,003 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1349 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_68| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1345) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_68| v_ArrVal_1349) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2023-01-28 08:01:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-01-28 08:01:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229307858] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:15,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 08:01:15,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364259201] [2023-01-28 08:01:15,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:15,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:01:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:01:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=247, Unknown=16, NotChecked=108, Total=462 [2023-01-28 08:01:15,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 554 [2023-01-28 08:01:15,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 139 transitions, 1228 flow. Second operand has 22 states, 22 states have (on average 204.36363636363637) internal successors, (4496), 22 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:15,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:15,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 554 [2023-01-28 08:01:15,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:17,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:18,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:22,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:23,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:25,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:29,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:30,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:31,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:32,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:34,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:36,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:37,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:38,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:39,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:40,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:41,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:42,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:43,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:44,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:45,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:46,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:51,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:58,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:01:59,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:00,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:01,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:02,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:03,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:05,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:06,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:08,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:09,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:13,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:14,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:15,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:16,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:17,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:19,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:21,790 INFO L130 PetriNetUnfolder]: 17395/29980 cut-off events. [2023-01-28 08:02:21,790 INFO L131 PetriNetUnfolder]: For 82445/82466 co-relation queries the response was YES. [2023-01-28 08:02:21,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117005 conditions, 29980 events. 17395/29980 cut-off events. For 82445/82466 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 248170 event pairs, 2650 based on Foata normal form. 127/28499 useless extension candidates. Maximal degree in co-relation 90239. Up to 13649 conditions per place. [2023-01-28 08:02:22,049 INFO L137 encePairwiseOnDemand]: 529/554 looper letters, 364 selfloop transitions, 110 changer transitions 0/482 dead transitions. [2023-01-28 08:02:22,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 482 transitions, 4988 flow [2023-01-28 08:02:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:02:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:02:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2661 transitions. [2023-01-28 08:02:22,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4002707581227437 [2023-01-28 08:02:22,052 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2661 transitions. [2023-01-28 08:02:22,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2661 transitions. [2023-01-28 08:02:22,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:22,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2661 transitions. [2023-01-28 08:02:22,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.75) internal successors, (2661), 12 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:22,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 554.0) internal successors, (7202), 13 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:22,065 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 554.0) internal successors, (7202), 13 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:22,065 INFO L175 Difference]: Start difference. First operand has 119 places, 139 transitions, 1228 flow. Second operand 12 states and 2661 transitions. [2023-01-28 08:02:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 482 transitions, 4988 flow [2023-01-28 08:02:22,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 482 transitions, 4829 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 08:02:22,141 INFO L231 Difference]: Finished difference. Result has 133 places, 245 transitions, 2539 flow [2023-01-28 08:02:22,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2539, PETRI_PLACES=133, PETRI_TRANSITIONS=245} [2023-01-28 08:02:22,142 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 46 predicate places. [2023-01-28 08:02:22,142 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 245 transitions, 2539 flow [2023-01-28 08:02:22,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 204.36363636363637) internal successors, (4496), 22 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:22,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:22,142 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:22,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-01-28 08:02:22,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 08:02:22,348 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:02:22,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -622809492, now seen corresponding path program 1 times [2023-01-28 08:02:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421630518] [2023-01-28 08:02:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:22,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421630518] [2023-01-28 08:02:22,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421630518] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:22,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959082216] [2023-01-28 08:02:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:22,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:22,677 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-28 08:02:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:22,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:22,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:22,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:02:22,878 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:22,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:02:22,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:22,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:23,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:02:23,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:02:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:26,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:36,414 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:02:38,427 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1450 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1450) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:02:40,447 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1450 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1449)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1450) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:02:40,503 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1450 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1449 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1449)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1450) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-01-28 08:02:40,536 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1445 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1450 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1449 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1445))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1449))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1450) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-01-28 08:02:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-01-28 08:02:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959082216] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:40,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-01-28 08:02:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993537577] [2023-01-28 08:02:40,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:40,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:02:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:02:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=231, Unknown=12, NotChecked=180, Total=506 [2023-01-28 08:02:40,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 554 [2023-01-28 08:02:40,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 245 transitions, 2539 flow. Second operand has 23 states, 23 states have (on average 204.52173913043478) internal successors, (4704), 23 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:40,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:40,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 554 [2023-01-28 08:02:40,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:41,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:42,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:43,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:46,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:48,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:50,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:52,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:53,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:54,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:55,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:57,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:58,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:59,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:00,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:01,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:02,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:03,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:04,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:05,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:06,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:07,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:09,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:14,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:15,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:16,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:17,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:18,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:19,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:20,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:22,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:23,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:25,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:26,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:28,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:29,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:31,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:32,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:33,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:34,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:38,957 INFO L130 PetriNetUnfolder]: 21222/36685 cut-off events. [2023-01-28 08:03:38,957 INFO L131 PetriNetUnfolder]: For 174960/175033 co-relation queries the response was YES. [2023-01-28 08:03:39,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184119 conditions, 36685 events. 21222/36685 cut-off events. For 174960/175033 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 310801 event pairs, 3900 based on Foata normal form. 162/35723 useless extension candidates. Maximal degree in co-relation 131136. Up to 15449 conditions per place. [2023-01-28 08:03:39,447 INFO L137 encePairwiseOnDemand]: 530/554 looper letters, 419 selfloop transitions, 87 changer transitions 0/514 dead transitions. [2023-01-28 08:03:39,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 514 transitions, 6268 flow [2023-01-28 08:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 08:03:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 08:03:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2440 transitions. [2023-01-28 08:03:39,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4003938299967181 [2023-01-28 08:03:39,451 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2440 transitions. [2023-01-28 08:03:39,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2440 transitions. [2023-01-28 08:03:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:39,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2440 transitions. [2023-01-28 08:03:39,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 221.8181818181818) internal successors, (2440), 11 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:39,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 554.0) internal successors, (6648), 12 states have internal predecessors, (6648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:39,458 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 554.0) internal successors, (6648), 12 states have internal predecessors, (6648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:39,458 INFO L175 Difference]: Start difference. First operand has 133 places, 245 transitions, 2539 flow. Second operand 11 states and 2440 transitions. [2023-01-28 08:03:39,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 514 transitions, 6268 flow [2023-01-28 08:03:39,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 514 transitions, 6139 flow, removed 54 selfloop flow, removed 3 redundant places. [2023-01-28 08:03:39,752 INFO L231 Difference]: Finished difference. Result has 146 places, 277 transitions, 3085 flow [2023-01-28 08:03:39,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3085, PETRI_PLACES=146, PETRI_TRANSITIONS=277} [2023-01-28 08:03:39,753 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 59 predicate places. [2023-01-28 08:03:39,753 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 277 transitions, 3085 flow [2023-01-28 08:03:39,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 204.52173913043478) internal successors, (4704), 23 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:39,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:39,754 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:03:39,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-01-28 08:03:39,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-01-28 08:03:39,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:03:39,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1677361940, now seen corresponding path program 1 times [2023-01-28 08:03:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576982088] [2023-01-28 08:03:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:03:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576982088] [2023-01-28 08:03:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576982088] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952328049] [2023-01-28 08:03:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:40,234 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:03:40,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-28 08:03:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:40,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:03:40,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:40,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:03:40,437 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:40,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:03:40,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:40,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:40,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:03:40,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:03:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:03:44,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:54,932 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|) 0) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:03:56,949 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1551 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1551)) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|) 0) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:04:13,072 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1551 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_60| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_60| v_ArrVal_1551) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|) 0) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_60| 28)))) is different from false [2023-01-28 08:04:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-01-28 08:04:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952328049] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:04:13,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:04:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 08:04:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378823331] [2023-01-28 08:04:13,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:04:13,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:04:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:04:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:04:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=247, Unknown=16, NotChecked=108, Total=462 [2023-01-28 08:04:13,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 554 [2023-01-28 08:04:13,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 277 transitions, 3085 flow. Second operand has 22 states, 22 states have (on average 205.04545454545453) internal successors, (4511), 22 states have internal predecessors, (4511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:04:13,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:04:13,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 554 [2023-01-28 08:04:13,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:04:14,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:15,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:16,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:18,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:19,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:21,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:23,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:24,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:25,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:26,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:27,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:30,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:31,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:35,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:36,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:37,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:38,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:40,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:42,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:43,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:44,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:45,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:46,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:47,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:49,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:50,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:51,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:04,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:05,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:06,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:08,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:09,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:10,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:11,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:12,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:14,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:24,456 INFO L130 PetriNetUnfolder]: 27454/47260 cut-off events. [2023-01-28 08:05:24,456 INFO L131 PetriNetUnfolder]: For 253733/253788 co-relation queries the response was YES. [2023-01-28 08:05:24,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243879 conditions, 47260 events. 27454/47260 cut-off events. For 253733/253788 co-relation queries the response was YES. Maximal size of possible extension queue 1624. Compared 408299 event pairs, 4961 based on Foata normal form. 148/46075 useless extension candidates. Maximal degree in co-relation 209831. Up to 26061 conditions per place. [2023-01-28 08:05:24,877 INFO L137 encePairwiseOnDemand]: 531/554 looper letters, 513 selfloop transitions, 137 changer transitions 0/658 dead transitions. [2023-01-28 08:05:24,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 658 transitions, 8272 flow [2023-01-28 08:05:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:05:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:05:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2649 transitions. [2023-01-28 08:05:24,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39846570397111913 [2023-01-28 08:05:24,881 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2649 transitions. [2023-01-28 08:05:24,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2649 transitions. [2023-01-28 08:05:24,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:24,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2649 transitions. [2023-01-28 08:05:24,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 220.75) internal successors, (2649), 12 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:24,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 554.0) internal successors, (7202), 13 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:24,890 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 554.0) internal successors, (7202), 13 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:24,890 INFO L175 Difference]: Start difference. First operand has 146 places, 277 transitions, 3085 flow. Second operand 12 states and 2649 transitions. [2023-01-28 08:05:24,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 658 transitions, 8272 flow [2023-01-28 08:05:25,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 658 transitions, 8133 flow, removed 43 selfloop flow, removed 4 redundant places. [2023-01-28 08:05:25,974 INFO L231 Difference]: Finished difference. Result has 159 places, 385 transitions, 4857 flow [2023-01-28 08:05:25,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4857, PETRI_PLACES=159, PETRI_TRANSITIONS=385} [2023-01-28 08:05:25,975 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 72 predicate places. [2023-01-28 08:05:25,975 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 385 transitions, 4857 flow [2023-01-28 08:05:25,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 205.04545454545453) internal successors, (4511), 22 states have internal predecessors, (4511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:25,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:25,976 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:25,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-01-28 08:05:26,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:26,181 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:05:26,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 407858178, now seen corresponding path program 1 times [2023-01-28 08:05:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025973239] [2023-01-28 08:05:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025973239] [2023-01-28 08:05:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025973239] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889944418] [2023-01-28 08:05:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:26,512 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:05:26,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-28 08:05:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:26,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 46 conjunts are in the unsatisfiable core [2023-01-28 08:05:26,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:05:26,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-01-28 08:05:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:26,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:29,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| v_ArrVal_1646) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:05:29,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:05:29,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-01-28 08:05:29,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-01-28 08:05:29,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:05:29,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2023-01-28 08:05:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889944418] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:29,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:29,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-01-28 08:05:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498339140] [2023-01-28 08:05:29,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:29,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:05:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:05:29,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=612, Unknown=1, NotChecked=50, Total=756 [2023-01-28 08:05:29,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 554 [2023-01-28 08:05:29,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 385 transitions, 4857 flow. Second operand has 28 states, 28 states have (on average 194.5) internal successors, (5446), 28 states have internal predecessors, (5446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:29,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:29,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 554 [2023-01-28 08:05:29,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:43,692 INFO L130 PetriNetUnfolder]: 41295/70775 cut-off events. [2023-01-28 08:05:43,692 INFO L131 PetriNetUnfolder]: For 542452/542546 co-relation queries the response was YES. [2023-01-28 08:05:44,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429134 conditions, 70775 events. 41295/70775 cut-off events. For 542452/542546 co-relation queries the response was YES. Maximal size of possible extension queue 2040. Compared 631823 event pairs, 6770 based on Foata normal form. 187/70677 useless extension candidates. Maximal degree in co-relation 395958. Up to 28535 conditions per place. [2023-01-28 08:05:44,586 INFO L137 encePairwiseOnDemand]: 536/554 looper letters, 1131 selfloop transitions, 406 changer transitions 3/1548 dead transitions. [2023-01-28 08:05:44,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1548 transitions, 20891 flow [2023-01-28 08:05:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-01-28 08:05:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-01-28 08:05:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 10327 transitions. [2023-01-28 08:05:44,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3728158844765343 [2023-01-28 08:05:44,598 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 10327 transitions. [2023-01-28 08:05:44,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 10327 transitions. [2023-01-28 08:05:44,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:44,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 10327 transitions. [2023-01-28 08:05:44,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 206.54) internal successors, (10327), 50 states have internal predecessors, (10327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:44,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 554.0) internal successors, (28254), 51 states have internal predecessors, (28254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:44,638 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 554.0) internal successors, (28254), 51 states have internal predecessors, (28254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:44,639 INFO L175 Difference]: Start difference. First operand has 159 places, 385 transitions, 4857 flow. Second operand 50 states and 10327 transitions. [2023-01-28 08:05:44,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1548 transitions, 20891 flow [2023-01-28 08:05:48,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1548 transitions, 20455 flow, removed 177 selfloop flow, removed 3 redundant places. [2023-01-28 08:05:48,155 INFO L231 Difference]: Finished difference. Result has 235 places, 713 transitions, 10380 flow [2023-01-28 08:05:48,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=4672, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=10380, PETRI_PLACES=235, PETRI_TRANSITIONS=713} [2023-01-28 08:05:48,156 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 148 predicate places. [2023-01-28 08:05:48,156 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 713 transitions, 10380 flow [2023-01-28 08:05:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 194.5) internal successors, (5446), 28 states have internal predecessors, (5446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:48,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:48,157 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:48,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-01-28 08:05:48,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:48,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:05:48,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash -992085084, now seen corresponding path program 1 times [2023-01-28 08:05:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010695592] [2023-01-28 08:05:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010695592] [2023-01-28 08:05:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010695592] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971325337] [2023-01-28 08:05:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:48,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:48,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:48,714 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:05:48,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-01-28 08:05:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:48,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 56 conjunts are in the unsatisfiable core [2023-01-28 08:05:48,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:48,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:05:48,952 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:48,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:05:48,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:49,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:49,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 08:05:49,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:05:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:49,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:49,446 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1744 (Array Int Int)) (|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1744))) (store .cse0 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) is different from false [2023-01-28 08:05:49,456 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1744 (Array Int Int)) (|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1744))) (store .cse0 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) is different from false [2023-01-28 08:05:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:05:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971325337] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:49,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 28 [2023-01-28 08:05:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097506436] [2023-01-28 08:05:49,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:49,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 08:05:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 08:05:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=630, Unknown=2, NotChecked=106, Total=870 [2023-01-28 08:05:49,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 554 [2023-01-28 08:05:49,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 713 transitions, 10380 flow. Second operand has 30 states, 30 states have (on average 190.2) internal successors, (5706), 30 states have internal predecessors, (5706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:49,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:49,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 554 [2023-01-28 08:05:49,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:13,869 INFO L130 PetriNetUnfolder]: 52791/90337 cut-off events. [2023-01-28 08:06:13,869 INFO L131 PetriNetUnfolder]: For 1001822/1001901 co-relation queries the response was YES. [2023-01-28 08:06:15,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614535 conditions, 90337 events. 52791/90337 cut-off events. For 1001822/1001901 co-relation queries the response was YES. Maximal size of possible extension queue 2528. Compared 828387 event pairs, 7822 based on Foata normal form. 872/90779 useless extension candidates. Maximal degree in co-relation 609747. Up to 37181 conditions per place. [2023-01-28 08:06:15,649 INFO L137 encePairwiseOnDemand]: 533/554 looper letters, 1427 selfloop transitions, 868 changer transitions 36/2339 dead transitions. [2023-01-28 08:06:15,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 2339 transitions, 36185 flow [2023-01-28 08:06:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-01-28 08:06:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-01-28 08:06:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 18261 transitions. [2023-01-28 08:06:15,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3582836289436509 [2023-01-28 08:06:15,667 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 18261 transitions. [2023-01-28 08:06:15,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 18261 transitions. [2023-01-28 08:06:15,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:15,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 18261 transitions. [2023-01-28 08:06:15,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 198.4891304347826) internal successors, (18261), 92 states have internal predecessors, (18261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:06:15,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 554.0) internal successors, (51522), 93 states have internal predecessors, (51522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:06:15,734 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 554.0) internal successors, (51522), 93 states have internal predecessors, (51522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:06:15,734 INFO L175 Difference]: Start difference. First operand has 235 places, 713 transitions, 10380 flow. Second operand 92 states and 18261 transitions. [2023-01-28 08:06:15,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 2339 transitions, 36185 flow [2023-01-28 08:06:27,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2339 transitions, 35197 flow, removed 195 selfloop flow, removed 6 redundant places. [2023-01-28 08:06:27,369 INFO L231 Difference]: Finished difference. Result has 365 places, 1315 transitions, 21655 flow [2023-01-28 08:06:27,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=9895, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=21655, PETRI_PLACES=365, PETRI_TRANSITIONS=1315} [2023-01-28 08:06:27,370 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 278 predicate places. [2023-01-28 08:06:27,370 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 1315 transitions, 21655 flow [2023-01-28 08:06:27,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 190.2) internal successors, (5706), 30 states have internal predecessors, (5706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:06:27,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:27,371 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:27,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-01-28 08:06:27,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-01-28 08:06:27,580 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:06:27,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash -715390434, now seen corresponding path program 2 times [2023-01-28 08:06:27,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:27,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841719531] [2023-01-28 08:06:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:27,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:06:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841719531] [2023-01-28 08:06:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841719531] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363350670] [2023-01-28 08:06:27,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:06:27,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:27,893 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:06:27,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-01-28 08:06:28,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:06:28,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:28,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 08:06:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:06:28,174 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:28,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:06:28,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:28,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:06:28,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:06:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:06:28,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:30,616 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_1846 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_1846) |c_~#cache~0.offset|) 0))) is different from false [2023-01-28 08:06:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:06:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363350670] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:30,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2023-01-28 08:06:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583818462] [2023-01-28 08:06:30,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 08:06:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 08:06:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=581, Unknown=1, NotChecked=52, Total=812 [2023-01-28 08:06:30,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 554 [2023-01-28 08:06:30,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1315 transitions, 21655 flow. Second operand has 29 states, 29 states have (on average 194.44827586206895) internal successors, (5639), 29 states have internal predecessors, (5639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:06:30,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:30,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 554 [2023-01-28 08:06:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:42,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:44,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:46,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:48,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:50,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:52,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:54,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:56,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:58,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:00,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:02,816 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (let ((.cse2 (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_1846 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (store .cse0 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_1846) |c_~#cache~0.offset|) 0))))) (and (or (not (= (select .cse0 (+ .cse1 |c_~#cache~0.offset|)) 0)) .cse2) .cse2 (or (not (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)) .cse2)))) is different from false [2023-01-28 08:07:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:11,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:15,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:17,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:19,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:21,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:23,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:25,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:27,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:29,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:31,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:33,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:29,889 WARN L222 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 35 DAG size of output: 23 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:33,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:35,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:37,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:39,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:41,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:43,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:45,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:47,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:49,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:51,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:53,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:55,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:08:57,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:09:00,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:02,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:04,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:13,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:41,870 INFO L130 PetriNetUnfolder]: 70871/120747 cut-off events. [2023-01-28 08:09:41,870 INFO L131 PetriNetUnfolder]: For 1788846/1789184 co-relation queries the response was YES. [2023-01-28 08:09:45,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897619 conditions, 120747 events. 70871/120747 cut-off events. For 1788846/1789184 co-relation queries the response was YES. Maximal size of possible extension queue 3149. Compared 1138094 event pairs, 12982 based on Foata normal form. 200/120448 useless extension candidates. Maximal degree in co-relation 894548. Up to 51551 conditions per place. [2023-01-28 08:09:46,862 INFO L137 encePairwiseOnDemand]: 525/554 looper letters, 1432 selfloop transitions, 1178 changer transitions 4/2622 dead transitions. [2023-01-28 08:09:46,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 2622 transitions, 45410 flow [2023-01-28 08:09:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 08:09:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 08:09:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 9931 transitions. [2023-01-28 08:09:46,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37345818291215405 [2023-01-28 08:09:46,898 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 9931 transitions. [2023-01-28 08:09:46,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 9931 transitions. [2023-01-28 08:09:46,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:46,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 9931 transitions. [2023-01-28 08:09:46,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 206.89583333333334) internal successors, (9931), 48 states have internal predecessors, (9931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:46,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 554.0) internal successors, (27146), 49 states have internal predecessors, (27146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:46,943 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 554.0) internal successors, (27146), 49 states have internal predecessors, (27146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:46,943 INFO L175 Difference]: Start difference. First operand has 365 places, 1315 transitions, 21655 flow. Second operand 48 states and 9931 transitions. [2023-01-28 08:09:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 2622 transitions, 45410 flow [2023-01-28 08:10:36,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 2622 transitions, 43897 flow, removed 560 selfloop flow, removed 8 redundant places. [2023-01-28 08:10:36,375 INFO L231 Difference]: Finished difference. Result has 419 places, 1826 transitions, 33363 flow [2023-01-28 08:10:36,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=20445, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=739, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=33363, PETRI_PLACES=419, PETRI_TRANSITIONS=1826} [2023-01-28 08:10:36,376 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 332 predicate places. [2023-01-28 08:10:36,376 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 1826 transitions, 33363 flow [2023-01-28 08:10:36,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 194.44827586206895) internal successors, (5639), 29 states have internal predecessors, (5639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:36,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:36,377 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:36,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:36,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-01-28 08:10:36,578 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:10:36,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1839713728, now seen corresponding path program 1 times [2023-01-28 08:10:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153998779] [2023-01-28 08:10:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153998779] [2023-01-28 08:10:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153998779] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411294000] [2023-01-28 08:10:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:36,900 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:36,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-01-28 08:10:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:37,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:10:37,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:37,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:10:37,111 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:37,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:10:37,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:37,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:37,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:10:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:37,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:39,192 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1945 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1945) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-01-28 08:10:40,820 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1945 Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1945) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| 28)))) is different from false [2023-01-28 08:10:52,895 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1945 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1944) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1945) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_67| 28)))) is different from false [2023-01-28 08:10:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:10:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411294000] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:53,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:53,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-01-28 08:10:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601902144] [2023-01-28 08:10:53,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:53,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:10:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:10:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=492, Unknown=6, NotChecked=144, Total=756 [2023-01-28 08:10:53,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 554 [2023-01-28 08:10:53,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1826 transitions, 33363 flow. Second operand has 28 states, 28 states have (on average 194.60714285714286) internal successors, (5449), 28 states have internal predecessors, (5449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:53,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:53,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 554 [2023-01-28 08:10:53,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:56,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:00,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:02,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:04,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:05,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:09,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:10,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:11,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:15,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:19,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:20,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:25,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-01-28 08:11:57,375 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:11:57,375 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:11:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-01-28 08:11:58,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-01-28 08:11:59,209 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 08:11:59,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-01-28 08:11:59,210 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 08:11:59,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 08:11:59,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-28 08:11:59,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-28 08:11:59,210 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 08:11:59,210 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:11:59,211 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:11:59,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-01-28 08:11:59,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:11:59,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:11:59 BasicIcfg [2023-01-28 08:11:59,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:11:59,215 INFO L158 Benchmark]: Toolchain (without parser) took 808443.51ms. Allocated memory was 367.0MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 307.2MB in the beginning and 10.0GB in the end (delta: -9.7GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 367.0MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.72ms. Allocated memory was 367.0MB in the beginning and 576.7MB in the end (delta: 209.7MB). Free memory was 307.0MB in the beginning and 538.5MB in the end (delta: -231.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 576.7MB. Free memory was 538.5MB in the beginning and 535.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 576.7MB. Free memory was 535.5MB in the beginning and 533.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: RCFGBuilder took 608.89ms. Allocated memory is still 576.7MB. Free memory was 532.5MB in the beginning and 511.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 08:11:59,215 INFO L158 Benchmark]: TraceAbstraction took 807104.83ms. Allocated memory was 576.7MB in the beginning and 15.2GB in the end (delta: 14.6GB). Free memory was 511.5MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-01-28 08:11:59,216 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.54ms. Allocated memory is still 367.0MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 637.72ms. Allocated memory was 367.0MB in the beginning and 576.7MB in the end (delta: 209.7MB). Free memory was 307.0MB in the beginning and 538.5MB in the end (delta: -231.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 576.7MB. Free memory was 538.5MB in the beginning and 535.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 576.7MB. Free memory was 535.5MB in the beginning and 533.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 608.89ms. Allocated memory is still 576.7MB. Free memory was 532.5MB in the beginning and 511.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 807104.83ms. Allocated memory was 576.7MB in the beginning and 15.2GB in the end (delta: 14.6GB). Free memory was 511.5MB in the beginning and 10.0GB in the end (delta: -9.5GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 197 PlacesBefore, 63 PlacesAfterwards, 238 TransitionsBefore, 96 TransitionsAfterwards, 19044 CoEnabledTransitionPairs, 5 FixpointIterations, 25 TrivialSequentialCompositions, 123 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 23 ConcurrentYvCompositions, 8 ChoiceCompositions, 181 TotalNumberOfCompositions, 28154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13973, independent: 13628, independent conditional: 0, independent unconditional: 13628, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9107, independent: 9002, independent conditional: 0, independent unconditional: 9002, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13973, independent: 4626, independent conditional: 0, independent unconditional: 4626, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 9107, unknown conditional: 0, unknown unconditional: 9107] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 197 PlacesBefore, 63 PlacesAfterwards, 238 TransitionsBefore, 97 TransitionsAfterwards, 19044 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 122 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 179 TotalNumberOfCompositions, 30988 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14994, independent: 14585, independent conditional: 0, independent unconditional: 14585, dependent: 409, dependent conditional: 0, dependent unconditional: 409, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9245, independent: 9129, independent conditional: 0, independent unconditional: 9129, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14994, independent: 5456, independent conditional: 0, independent unconditional: 5456, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 9245, unknown conditional: 0, unknown unconditional: 9245] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 347, Positive conditional cache size: 0, Positive unconditional cache size: 347, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 259 PlacesBefore, 87 PlacesAfterwards, 314 TransitionsBefore, 134 TransitionsAfterwards, 49128 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 171 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 34 ConcurrentYvCompositions, 8 ChoiceCompositions, 240 TotalNumberOfCompositions, 85335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37481, independent: 36925, independent conditional: 0, independent unconditional: 36925, dependent: 556, dependent conditional: 0, dependent unconditional: 556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23397, independent: 23281, independent conditional: 0, independent unconditional: 23281, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37481, independent: 13644, independent conditional: 0, independent unconditional: 13644, dependent: 440, dependent conditional: 0, dependent unconditional: 440, unknown: 23397, unknown conditional: 0, unknown unconditional: 23397] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 610, Positive conditional cache size: 0, Positive unconditional cache size: 610, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 255 locations, 5 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: 88.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 42.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 59 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 792 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1583 IncrementalHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 1 mSDtfsCounter, 1583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 198 SyntacticMatches, 12 SemanticMatches, 119 ConstructedPredicates, 14 IntricatePredicates, 2 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 62.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 289 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 394 ConstructedInterpolants, 90 QuantifiedInterpolants, 6001 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 521/576 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 311 locations, 6 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: 715.3s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 593.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 181 mSolverCounterUnknown, 6451 SdHoareTripleChecker+Valid, 241.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6451 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 239.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7864 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17774 IncrementalHoareTripleChecker+Invalid, 26287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 468 mSolverCounterUnsat, 11 mSDtfsCounter, 17774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 781 SyntacticMatches, 30 SemanticMatches, 503 ConstructedPredicates, 20 IntricatePredicates, 5 DeprecatedPredicates, 8043 ImplicationChecksByTransitivity, 234.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33363occurred in iteration=20, InterpolantAutomatonStates: 313, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 112.2s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1053 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1372 ConstructedInterpolants, 225 QuantifiedInterpolants, 18896 SizeOfPredicates, 165 NumberOfNonLiveVariables, 4059 ConjunctsInSsa, 540 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 2265/2383 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 255 locations, 5 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: 3.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown