/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_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:58:29,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:58:29,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:58:29,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:58:29,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:58:29,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:58:29,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:58:29,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:58:29,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:58:29,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:58:29,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:58:29,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:58:29,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:58:29,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:58:29,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:58:29,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:58:29,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:58:29,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:58:29,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:58:29,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:58:29,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:58:29,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:58:29,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:58:29,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:58:29,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:58:29,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:58:29,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:58:29,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:58:29,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:58:29,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:58:29,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:58:29,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:58:29,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:58:29,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:58:29,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:58:29,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:58:29,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:58:29,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:58:29,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:58:29,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:58:29,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:58:29,324 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,350 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:58:29,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:58:29,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:58:29,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:58:29,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:58:29,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:58:29,352 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:58:29,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:58:29,353 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:58:29,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:58:29,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:58:29,355 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:58:29,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:58:29,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:58:29,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:58:29,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:58:29,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:58:29,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:58:29,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:58:29,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:58:29,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:58:29,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:58:29,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:58:29,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:58:29,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:58:29,357 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,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:58:29,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:58:29,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:58:29,613 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:58:29,613 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:58:29,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-01-28 07:58:30,739 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:58:30,957 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:58:30,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-01-28 07:58:30,968 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7260c217b/dde4f68aa2ce47529dc39e725b829142/FLAG11eb2e427 [2023-01-28 07:58:30,980 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7260c217b/dde4f68aa2ce47529dc39e725b829142 [2023-01-28 07:58:30,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:58:30,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:58:30,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:58:30,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:58:30,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:58:30,987 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,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17857d79 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,988 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,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:58:31,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:58:31,417 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_72-funloop_hard_racing.i[41323,41336] [2023-01-28 07:58:31,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:58:31,472 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:58:31,508 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_72-funloop_hard_racing.i[41323,41336] [2023-01-28 07:58:31,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:58:31,581 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:58:31,581 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,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:58:31,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:58:31,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:58:31,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:58:31,588 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,603 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,624 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-01-28 07:58:31,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:58:31,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:58:31,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:58:31,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:58:31,632 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,632 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,636 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,636 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,644 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,649 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,651 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,652 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,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:58:31,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:58:31,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:58:31,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:58:31,656 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,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:58:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:31,681 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,687 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,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 07:58:31,717 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 07:58:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:58:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:58:31,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:58:31,721 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,836 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:58:31,837 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:58:32,238 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:58:32,245 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:58:32,246 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-01-28 07:58:32,247 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,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:58:32,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:58:32,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:58:32,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:58:32,252 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,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ff1ff 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,252 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,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ff1ff 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,256 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,257 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-01-28 07:58:32,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:58:32,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 07:58:32,271 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:58:32,345 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 07:58:32,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 07:58:32,496 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-01-28 07:58:32,497 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 07:58:32,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-01-28 07:58:32,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 07:58:32,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-01-28 07:58:32,521 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:58:32,535 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 07:58:32,537 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 07:58:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-01-28 07:58:32,580 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-01-28 07:58:32,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:32,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-01-28 07:58:32,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-01-28 07:58:35,205 INFO L134 LiptonReduction]: Checked pairs total: 28650 [2023-01-28 07:58:35,205 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-01-28 07:58:35,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:58:35,224 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;@4cd6abb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:58:35,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:58:35,229 INFO L130 PetriNetUnfolder]: 9/39 cut-off events. [2023-01-28 07:58:35,229 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:35,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:35,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:35,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === 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,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -454048497, now seen corresponding path program 1 times [2023-01-28 07:58:35,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275356490] [2023-01-28 07:58:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:35,426 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,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275356490] [2023-01-28 07:58:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275356490] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:58:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:58:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489199289] [2023-01-28 07:58:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:35,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:58:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:58:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:58:35,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:58:35,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 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,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:35,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:58:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:35,702 INFO L130 PetriNetUnfolder]: 579/1212 cut-off events. [2023-01-28 07:58:35,702 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:35,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 1212 events. 579/1212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6864 event pairs, 465 based on Foata normal form. 213/1209 useless extension candidates. Maximal degree in co-relation 2191. Up to 1060 conditions per place. [2023-01-28 07:58:35,711 INFO L137 encePairwiseOnDemand]: 396/430 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-01-28 07:58:35,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-01-28 07:58:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:58:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:58:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2023-01-28 07:58:35,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217054263565891 [2023-01-28 07:58:35,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2023-01-28 07:58:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2023-01-28 07:58:35,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:35,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2023-01-28 07:58:35,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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 07:58:35,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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 07:58:35,742 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 197 flow. Second operand 3 states and 673 transitions. [2023-01-28 07:58:35,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-01-28 07:58:35,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:58:35,747 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-01-28 07:58:35,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-01-28 07:58:35,752 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-01-28 07:58:35,752 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-01-28 07:58:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 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,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:35,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:35,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:58:35,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 573264157, now seen corresponding path program 1 times [2023-01-28 07:58:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554048383] [2023-01-28 07:58:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:35,816 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,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554048383] [2023-01-28 07:58:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554048383] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:58:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:58:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400841374] [2023-01-28 07:58:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:35,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:58:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:58:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:58:35,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:58:35,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 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,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:35,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:58:35,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:36,021 INFO L130 PetriNetUnfolder]: 547/1178 cut-off events. [2023-01-28 07:58:36,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:58:36,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1178 events. 547/1178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7289 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2224. Up to 1012 conditions per place. [2023-01-28 07:58:36,028 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-01-28 07:58:36,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-01-28 07:58:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:58:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:58:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2023-01-28 07:58:36,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100775193798449 [2023-01-28 07:58:36,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2023-01-28 07:58:36,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2023-01-28 07:58:36,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:36,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2023-01-28 07:58:36,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:58:36,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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 07:58:36,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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 07:58:36,038 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 147 flow. Second operand 3 states and 658 transitions. [2023-01-28 07:58:36,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-01-28 07:58:36,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 317 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 07:58:36,041 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-01-28 07:58:36,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-01-28 07:58:36,042 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-01-28 07:58:36,042 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-01-28 07:58:36,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 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,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:36,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:58:36,044 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,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -646993721, now seen corresponding path program 1 times [2023-01-28 07:58:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678170954] [2023-01-28 07:58:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:58:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678170954] [2023-01-28 07:58:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678170954] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600191738] [2023-01-28 07:58:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:36,121 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,151 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,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:58:36,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:36,253 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,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:36,281 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,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600191738] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:36,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:36,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:58:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942823086] [2023-01-28 07:58:36,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:36,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:58:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:36,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:58:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:58:36,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:58:36,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:58:36,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:36,529 INFO L130 PetriNetUnfolder]: 576/1192 cut-off events. [2023-01-28 07:58:36,529 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-01-28 07:58:36,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1192 events. 576/1192 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6683 event pairs, 465 based on Foata normal form. 3/1005 useless extension candidates. Maximal degree in co-relation 2262. Up to 1030 conditions per place. [2023-01-28 07:58:36,536 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-01-28 07:58:36,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-01-28 07:58:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:58:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:58:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2023-01-28 07:58:36,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786821705426357 [2023-01-28 07:58:36,540 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1235 transitions. [2023-01-28 07:58:36,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1235 transitions. [2023-01-28 07:58:36,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:36,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1235 transitions. [2023-01-28 07:58:36,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 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,549 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 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,549 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 151 flow. Second operand 6 states and 1235 transitions. [2023-01-28 07:58:36,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-01-28 07:58:36,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:58:36,551 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-01-28 07:58:36,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-01-28 07:58:36,552 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-01-28 07:58:36,552 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-01-28 07:58:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:36,554 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:36,565 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,765 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,768 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,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash -254815792, now seen corresponding path program 2 times [2023-01-28 07:58:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260054907] [2023-01-28 07:58:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:36,880 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,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:36,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260054907] [2023-01-28 07:58:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260054907] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:36,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022442344] [2023-01-28 07:58:36,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:58:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:36,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:36,882 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,903 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,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:58:36,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:58:36,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-28 07:58:36,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:37,018 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,117 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:58:37,118 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,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 07:58:37,189 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,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:58:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022442344] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:58:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:58:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:58:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973034164] [2023-01-28 07:58:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:58:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:58:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:58:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:58:37,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 430 [2023-01-28 07:58:37,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 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,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:37,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 430 [2023-01-28 07:58:37,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:37,544 INFO L130 PetriNetUnfolder]: 878/1807 cut-off events. [2023-01-28 07:58:37,544 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-01-28 07:58:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 1807 events. 878/1807 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10759 event pairs, 120 based on Foata normal form. 0/1521 useless extension candidates. Maximal degree in co-relation 3495. Up to 1127 conditions per place. [2023-01-28 07:58:37,553 INFO L137 encePairwiseOnDemand]: 422/430 looper letters, 109 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2023-01-28 07:58:37,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 541 flow [2023-01-28 07:58:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:58:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:58:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2023-01-28 07:58:37,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42372093023255814 [2023-01-28 07:58:37,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 911 transitions. [2023-01-28 07:58:37,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 911 transitions. [2023-01-28 07:58:37,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:37,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 911 transitions. [2023-01-28 07:58:37,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 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,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 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,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 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,563 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 183 flow. Second operand 5 states and 911 transitions. [2023-01-28 07:58:37,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 541 flow [2023-01-28 07:58:37,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 527 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 07:58:37,566 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-01-28 07:58:37,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-01-28 07:58:37,567 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-01-28 07:58:37,567 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-01-28 07:58:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 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,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:37,568 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:58:37,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 07:58:37,773 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,774 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,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1650306531, now seen corresponding path program 1 times [2023-01-28 07:58:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977230025] [2023-01-28 07:58:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:37,851 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,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977230025] [2023-01-28 07:58:37,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977230025] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328531559] [2023-01-28 07:58:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:37,854 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,858 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,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:37,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:58:37,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:37,970 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:37,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:38,025 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,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328531559] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:38,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:58:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583289354] [2023-01-28 07:58:38,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:38,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:58:38,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:58:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:58:38,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 430 [2023-01-28 07:58:38,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 219 flow. Second operand has 14 states, 14 states have (on average 191.92857142857142) internal successors, (2687), 14 states have internal predecessors, (2687), 0 states have call successors, (0), 0 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,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:38,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 430 [2023-01-28 07:58:38,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:58:38,122 INFO L130 PetriNetUnfolder]: 61/186 cut-off events. [2023-01-28 07:58:38,122 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-01-28 07:58:38,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 186 events. 61/186 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 643 event pairs, 1 based on Foata normal form. 33/213 useless extension candidates. Maximal degree in co-relation 399. Up to 111 conditions per place. [2023-01-28 07:58:38,123 INFO L137 encePairwiseOnDemand]: 425/430 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-01-28 07:58:38,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-01-28 07:58:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:58:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:58:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2716 transitions. [2023-01-28 07:58:38,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511627906976744 [2023-01-28 07:58:38,130 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2716 transitions. [2023-01-28 07:58:38,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2716 transitions. [2023-01-28 07:58:38,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:58:38,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2716 transitions. [2023-01-28 07:58:38,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 194.0) internal successors, (2716), 14 states have internal predecessors, (2716), 0 states have call successors, (0), 0 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,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 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,147 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 430.0) internal successors, (6450), 15 states have internal predecessors, (6450), 0 states have call successors, (0), 0 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,147 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 219 flow. Second operand 14 states and 2716 transitions. [2023-01-28 07:58:38,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-01-28 07:58:38,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:58:38,152 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-01-28 07:58:38,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=169, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-01-28 07:58:38,155 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-01-28 07:58:38,155 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-01-28 07:58:38,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 191.92857142857142) internal successors, (2687), 14 states have internal predecessors, (2687), 0 states have call successors, (0), 0 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,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:58:38,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] [2023-01-28 07:58:38,165 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,365 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,365 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,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:58:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -630653115, now seen corresponding path program 1 times [2023-01-28 07:58:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:58:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363880898] [2023-01-28 07:58:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:58:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:39,285 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:39,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:58:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363880898] [2023-01-28 07:58:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363880898] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:58:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370690349] [2023-01-28 07:58:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:58:39,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:58:39,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:58:39,289 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:39,292 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,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:58:39,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 07:58:39,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:58:39,403 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,482 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:58:39,482 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,506 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,599 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,664 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,721 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,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:58:51,800 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-01-28 07:58:53,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= (select (select (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_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 0)) is different from false [2023-01-28 07:58:55,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (= 0 (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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|))) is different from false [2023-01-28 07:58:59,882 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_200) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-01-28 07:58:59,982 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:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370690349] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:58:59,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:58:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-01-28 07:58:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498709740] [2023-01-28 07:58:59,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:58:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 07:58:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:58:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 07:58:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=6, NotChecked=164, Total=600 [2023-01-28 07:58:59,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 430 [2023-01-28 07:58:59,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 169 flow. Second operand has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 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:59,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:58:59,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 430 [2023-01-28 07:58:59,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:06,310 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 07:59:12,402 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 07:59:32,528 WARN L222 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 45 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 07:59:34,584 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 07:59:36,592 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 07:59:38,597 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 07:59:40,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 07:59:42,623 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 07:59:44,627 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 07:59:46,632 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 07:59:48,636 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 07:59:50,638 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 07:59:52,646 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 07:59:54,661 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 07:59:59,792 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:00:02,580 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:00:04,585 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:00:06,589 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:00:08,592 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:00:10,597 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:00:12,606 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:00:14,613 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:00:16,616 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:00:18,619 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:00:20,624 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:00:28,858 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 39 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:00:28,964 INFO L130 PetriNetUnfolder]: 60/193 cut-off events. [2023-01-28 08:00:28,965 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-01-28 08:00:28,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 193 events. 60/193 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 551 event pairs, 0 based on Foata normal form. 3/189 useless extension candidates. Maximal degree in co-relation 400. Up to 35 conditions per place. [2023-01-28 08:00:28,987 INFO L137 encePairwiseOnDemand]: 419/430 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-01-28 08:00:28,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-01-28 08:00:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:00:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:00:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2530 transitions. [2023-01-28 08:00:28,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34610123119015046 [2023-01-28 08:00:28,999 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2530 transitions. [2023-01-28 08:00:28,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2530 transitions. [2023-01-28 08:00:29,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:00:29,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2530 transitions. [2023-01-28 08:00:29,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 148.8235294117647) internal successors, (2530), 17 states have internal predecessors, (2530), 0 states have call successors, (0), 0 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,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 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,018 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 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,019 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 17 states and 2530 transitions. [2023-01-28 08:00:29,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-01-28 08:00:29,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 423 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-01-28 08:00:29,022 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-01-28 08:00:29,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-01-28 08:00:29,024 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-01-28 08:00:29,024 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-01-28 08:00:29,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 146.4) internal successors, (3660), 25 states have internal predecessors, (3660), 0 states have call successors, (0), 0 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,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:00:29,026 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 08:00:29,033 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 08:00:29,231 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 08:00:29,232 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 08:00:29,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:00:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 470240073, now seen corresponding path program 1 times [2023-01-28 08:00:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:00:29,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560242911] [2023-01-28 08:00:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:00:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:30,577 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:00:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:00:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560242911] [2023-01-28 08:00:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560242911] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:00:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613474072] [2023-01-28 08:00:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:00:30,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:00:30,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:00:30,581 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 08:00:30,611 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 08:00:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:00:30,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:00:30,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:00:30,716 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:30,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:00:30,795 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:30,823 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:30,922 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:31,003 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:31,051 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:34,176 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:00:34,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:00:49,955 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-01-28 08:00:51,978 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_304)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-01-28 08:00:51,998 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (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_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:00:52,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303))) (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_304))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-01-28 08:00:52,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 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_62| v_ArrVal_302)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-01-28 08:00:52,111 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_302 Int) (v_ArrVal_303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_304 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_300))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_302))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_303) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_304) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2023-01-28 08:00:52,373 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:00:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613474072] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:00:52,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:00:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-01-28 08:00:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184836110] [2023-01-28 08:00:52,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:00:52,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:00:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:00:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:00:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=387, Unknown=16, NotChecked=270, Total=756 [2023-01-28 08:00:52,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-01-28 08:00:52,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 265 flow. Second operand has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 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:52,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:00:52,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-01-28 08:00:52,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:22,535 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 62 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:01:28,537 INFO L130 PetriNetUnfolder]: 134/391 cut-off events. [2023-01-28 08:01:28,538 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2023-01-28 08:01:28,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 391 events. 134/391 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1407 event pairs, 0 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1061. Up to 103 conditions per place. [2023-01-28 08:01:28,540 INFO L137 encePairwiseOnDemand]: 418/430 looper letters, 132 selfloop transitions, 56 changer transitions 0/192 dead transitions. [2023-01-28 08:01:28,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 192 transitions, 1159 flow [2023-01-28 08:01:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 08:01:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 08:01:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3236 transitions. [2023-01-28 08:01:28,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583610188261351 [2023-01-28 08:01:28,548 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3236 transitions. [2023-01-28 08:01:28,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3236 transitions. [2023-01-28 08:01:28,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:28,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3236 transitions. [2023-01-28 08:01:28,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 154.0952380952381) internal successors, (3236), 21 states have internal predecessors, (3236), 0 states have call successors, (0), 0 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:28,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 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:28,567 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 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:28,567 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 265 flow. Second operand 21 states and 3236 transitions. [2023-01-28 08:01:28,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 192 transitions, 1159 flow [2023-01-28 08:01:28,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 192 transitions, 1126 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-28 08:01:28,572 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 721 flow [2023-01-28 08:01:28,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=721, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2023-01-28 08:01:28,573 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2023-01-28 08:01:28,573 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 721 flow [2023-01-28 08:01:28,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 150.28571428571428) internal successors, (4208), 28 states have internal predecessors, (4208), 0 states have call successors, (0), 0 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:28,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:28,575 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 08:01:28,583 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 08:01:28,780 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 08:01:28,781 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 08:01:28,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1435047, now seen corresponding path program 2 times [2023-01-28 08:01:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196712891] [2023-01-28 08:01:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:29,859 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:01:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196712891] [2023-01-28 08:01:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196712891] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266057056] [2023-01-28 08:01:29,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:29,861 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 08:01:29,866 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 08:01:29,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:29,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:29,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:01:29,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:29,975 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:01:30,044 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:30,045 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:01:30,115 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:01:30,218 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:01:30,292 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:01:32,672 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:01:32,721 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:01:32,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:32,728 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-01-28 08:01:33,210 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-01-28 08:01:35,227 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-01-28 08:01:37,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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| v_ArrVal_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0))) is different from false [2023-01-28 08:01:37,328 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int)) (or (= (select (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_66| v_ArrVal_404)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-01-28 08:01:37,354 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_406 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_404 Int) (v_ArrVal_401 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_401))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_404))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_406) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| 28)))) is different from false [2023-01-28 08:01:37,529 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:01:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266057056] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:37,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-01-28 08:01:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081373510] [2023-01-28 08:01:37,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:37,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:01:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:01:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=363, Unknown=8, NotChecked=258, Total=702 [2023-01-28 08:01:37,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-01-28 08:01:37,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 721 flow. Second operand has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 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:37,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:37,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-01-28 08:01:37,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:38,654 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:01,508 WARN L222 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 61 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:02:17,273 INFO L130 PetriNetUnfolder]: 174/574 cut-off events. [2023-01-28 08:02:17,273 INFO L131 PetriNetUnfolder]: For 1465/1465 co-relation queries the response was YES. [2023-01-28 08:02:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 574 events. 174/574 cut-off events. For 1465/1465 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2741 event pairs, 10 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2095. Up to 118 conditions per place. [2023-01-28 08:02:17,278 INFO L137 encePairwiseOnDemand]: 420/430 looper letters, 171 selfloop transitions, 64 changer transitions 0/239 dead transitions. [2023-01-28 08:02:17,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 1969 flow [2023-01-28 08:02:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 08:02:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 08:02:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3242 transitions. [2023-01-28 08:02:17,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35902547065337764 [2023-01-28 08:02:17,285 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3242 transitions. [2023-01-28 08:02:17,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3242 transitions. [2023-01-28 08:02:17,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:17,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3242 transitions. [2023-01-28 08:02:17,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 154.38095238095238) internal successors, (3242), 21 states have internal predecessors, (3242), 0 states have call successors, (0), 0 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:17,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 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:17,303 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 430.0) internal successors, (9460), 22 states have internal predecessors, (9460), 0 states have call successors, (0), 0 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:17,304 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 721 flow. Second operand 21 states and 3242 transitions. [2023-01-28 08:02:17,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 1969 flow [2023-01-28 08:02:17,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 239 transitions, 1937 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 08:02:17,314 INFO L231 Difference]: Finished difference. Result has 118 places, 138 transitions, 1145 flow [2023-01-28 08:02:17,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1145, PETRI_PLACES=118, PETRI_TRANSITIONS=138} [2023-01-28 08:02:17,315 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2023-01-28 08:02:17,315 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 138 transitions, 1145 flow [2023-01-28 08:02:17,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 150.40740740740742) internal successors, (4061), 27 states have internal predecessors, (4061), 0 states have call successors, (0), 0 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:17,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:17,316 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:17,327 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:02:17,527 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:02:17,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:17,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1374964814, now seen corresponding path program 3 times [2023-01-28 08:02:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230007386] [2023-01-28 08:02:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230007386] [2023-01-28 08:02:18,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230007386] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857958079] [2023-01-28 08:02:18,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:02:18,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:18,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:18,419 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:02:18,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:02:18,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:18,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 08:02:18,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:18,547 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:18,596 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:18,596 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:18,604 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:18,694 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:02:18,738 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 21 treesize of output 23 [2023-01-28 08:02:18,796 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:02:18,934 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 19 [2023-01-28 08:02:18,993 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 27 treesize of output 22 [2023-01-28 08:02:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:28,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:42,062 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-01-28 08:02:44,080 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_543)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-01-28 08:03:08,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-01-28 08:03:10,276 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (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_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-01-28 08:03:11,050 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-01-28 08:03:11,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-01-28 08:03:11,088 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (= 0 (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))) is different from false [2023-01-28 08:03:25,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_534))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_543) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) 0))) is different from false [2023-01-28 08:03:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 15 not checked. [2023-01-28 08:03:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857958079] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:25,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-01-28 08:03:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634792840] [2023-01-28 08:03:25,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 08:03:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 08:03:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=541, Unknown=47, NotChecked=456, Total=1190 [2023-01-28 08:03:25,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-01-28 08:03:25,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 138 transitions, 1145 flow. Second operand has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 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:25,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:25,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-01-28 08:03:25,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:26,635 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:27,827 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:03:29,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s 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,609 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:32,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s 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,905 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:34,956 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:36,099 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:37,249 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:41,109 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:42,217 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:43,309 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:44,489 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:03:47,943 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:03:49,024 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:50,178 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:51,391 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:03:52,484 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:53,608 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:54,689 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:55,748 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:01,633 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:02,749 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:03,928 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:13,402 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 66 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:14,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s 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,923 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:37,145 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 65 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:38,270 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:39,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s 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,403 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:44,501 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:45,663 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:46,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:01,918 WARN L222 SmtUtils]: Spent 11.31s on a formula simplification. DAG size of input: 82 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:05:03,080 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:04,177 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:32,474 WARN L222 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 79 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:05:33,581 INFO L130 PetriNetUnfolder]: 189/615 cut-off events. [2023-01-28 08:05:33,582 INFO L131 PetriNetUnfolder]: For 2387/2387 co-relation queries the response was YES. [2023-01-28 08:05:33,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 615 events. 189/615 cut-off events. For 2387/2387 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2999 event pairs, 17 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 2481. Up to 174 conditions per place. [2023-01-28 08:05:33,584 INFO L137 encePairwiseOnDemand]: 418/430 looper letters, 0 selfloop transitions, 0 changer transitions 171/171 dead transitions. [2023-01-28 08:05:33,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 171 transitions, 1682 flow [2023-01-28 08:05:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:05:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:05:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2602 transitions. [2023-01-28 08:05:33,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35595075239398083 [2023-01-28 08:05:33,591 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2602 transitions. [2023-01-28 08:05:33,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2602 transitions. [2023-01-28 08:05:33,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:33,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2602 transitions. [2023-01-28 08:05:33,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 153.05882352941177) internal successors, (2602), 17 states have internal predecessors, (2602), 0 states have call successors, (0), 0 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:33,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 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:33,606 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 430.0) internal successors, (7740), 18 states have internal predecessors, (7740), 0 states have call successors, (0), 0 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:33,606 INFO L175 Difference]: Start difference. First operand has 118 places, 138 transitions, 1145 flow. Second operand 17 states and 2602 transitions. [2023-01-28 08:05:33,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 171 transitions, 1682 flow [2023-01-28 08:05:33,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 171 transitions, 1550 flow, removed 23 selfloop flow, removed 12 redundant places. [2023-01-28 08:05:33,618 INFO L231 Difference]: Finished difference. Result has 121 places, 0 transitions, 0 flow [2023-01-28 08:05:33,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=0, PETRI_PLACES=121, PETRI_TRANSITIONS=0} [2023-01-28 08:05:33,618 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2023-01-28 08:05:33,619 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 0 transitions, 0 flow [2023-01-28 08:05:33,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 151.57142857142858) internal successors, (5305), 35 states have internal predecessors, (5305), 0 states have call successors, (0), 0 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:33,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:05:33,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:05:33,622 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:05:33,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:05:33,633 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:05:33,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:33,829 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-01-28 08:05:33,830 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 08:05:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 08:05:33,861 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-01-28 08:05:33,862 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 08:05:33,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 381 events. 73/381 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-01-28 08:05:33,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 08:05:33,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-01-28 08:05:33,865 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:05:33,866 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 08:05:33,866 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 08:05:33,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-01-28 08:05:33,888 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-01-28 08:05:33,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:05:33,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 376 events. 72/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1659 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 209. Up to 8 conditions per place. [2023-01-28 08:05:33,897 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-01-28 08:05:36,389 INFO L134 LiptonReduction]: Checked pairs total: 31438 [2023-01-28 08:05:36,389 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-01-28 08:05:36,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 08:05:36,390 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;@4cd6abb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:05:36,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 08:05:36,393 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-01-28 08:05:36,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:05:36,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:36,394 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-01-28 08:05:36,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:05:36,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash 742146464, now seen corresponding path program 1 times [2023-01-28 08:05:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778534789] [2023-01-28 08:05:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:36,414 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:05:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778534789] [2023-01-28 08:05:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778534789] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:05:36,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:05:36,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:05:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647589166] [2023-01-28 08:05:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:05:36,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:05:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:36,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:05:36,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:05:36,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 08:05:36,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:36,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:36,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 08:05:36,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:36,541 INFO L130 PetriNetUnfolder]: 579/1211 cut-off events. [2023-01-28 08:05:36,541 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:05:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 1211 events. 579/1211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6859 event pairs, 465 based on Foata normal form. 214/1212 useless extension candidates. Maximal degree in co-relation 2190. Up to 1060 conditions per place. [2023-01-28 08:05:36,544 INFO L137 encePairwiseOnDemand]: 395/430 looper letters, 22 selfloop transitions, 2 changer transitions 37/66 dead transitions. [2023-01-28 08:05:36,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-01-28 08:05:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:05:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:05:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2023-01-28 08:05:36,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224806201550387 [2023-01-28 08:05:36,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2023-01-28 08:05:36,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2023-01-28 08:05:36,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:36,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2023-01-28 08:05:36,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 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:36,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:05:36,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 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:05:36,550 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 199 flow. Second operand 3 states and 674 transitions. [2023-01-28 08:05:36,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-01-28 08:05:36,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:05:36,551 INFO L231 Difference]: Finished difference. Result has 65 places, 29 transitions, 73 flow [2023-01-28 08:05:36,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=65, PETRI_TRANSITIONS=29} [2023-01-28 08:05:36,551 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-01-28 08:05:36,552 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 29 transitions, 73 flow [2023-01-28 08:05:36,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:36,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:36,552 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:36,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 08:05:36,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:05:36,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1451583011, now seen corresponding path program 1 times [2023-01-28 08:05:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:36,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878060384] [2023-01-28 08:05:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:36,575 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:05:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878060384] [2023-01-28 08:05:36,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878060384] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260761829] [2023-01-28 08:05:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:36,577 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:05:36,606 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:05:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:36,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:05:36,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:36,673 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:05:36,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:36,684 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:05:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260761829] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:36,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:36,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:05:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983714464] [2023-01-28 08:05:36,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:36,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:05:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:05:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:05:36,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 08:05:36,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 197.57142857142858) internal successors, (1383), 7 states have internal predecessors, (1383), 0 states have call successors, (0), 0 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:36,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:36,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 08:05:36,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:36,751 INFO L130 PetriNetUnfolder]: 54/139 cut-off events. [2023-01-28 08:05:36,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:05:36,752 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 375 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:05:36,752 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-01-28 08:05:36,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 139 flow [2023-01-28 08:05:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:05:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:05:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2023-01-28 08:05:36,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46744186046511627 [2023-01-28 08:05:36,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1206 transitions. [2023-01-28 08:05:36,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1206 transitions. [2023-01-28 08:05:36,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:36,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1206 transitions. [2023-01-28 08:05:36,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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:36,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 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:36,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 430.0) internal successors, (3010), 7 states have internal predecessors, (3010), 0 states have call successors, (0), 0 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:36,761 INFO L175 Difference]: Start difference. First operand has 65 places, 29 transitions, 73 flow. Second operand 6 states and 1206 transitions. [2023-01-28 08:05:36,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 139 flow [2023-01-28 08:05:36,761 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:05:36,762 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-01-28 08:05:36,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, 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:05:36,762 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -25 predicate places. [2023-01-28 08:05:36,763 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-01-28 08:05:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.57142857142858) internal successors, (1383), 7 states have internal predecessors, (1383), 0 states have call successors, (0), 0 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:36,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:36,763 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-01-28 08:05:36,773 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:05:36,970 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:05:36,970 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:05:36,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1255216928, now seen corresponding path program 2 times [2023-01-28 08:05:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914131178] [2023-01-28 08:05:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:37,037 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:05:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914131178] [2023-01-28 08:05:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914131178] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:37,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642226944] [2023-01-28 08:05:37,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:05:37,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:37,039 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:05:37,042 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:05:37,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:05:37,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:05:37,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:05:37,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:37,139 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:05:37,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:37,189 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:05:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642226944] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:37,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:05:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18374326] [2023-01-28 08:05:37,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:37,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:05:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:37,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:05:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:05:37,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 08:05:37,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 197.30769230769232) internal successors, (2565), 13 states have internal predecessors, (2565), 0 states have call successors, (0), 0 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:37,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:37,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 08:05:37,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:37,258 INFO L130 PetriNetUnfolder]: 54/145 cut-off events. [2023-01-28 08:05:37,258 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 08:05:37,258 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 379 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:05:37,259 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-01-28 08:05:37,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 207 flow [2023-01-28 08:05:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:05:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:05:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2391 transitions. [2023-01-28 08:05:37,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633720930232558 [2023-01-28 08:05:37,262 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2391 transitions. [2023-01-28 08:05:37,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2391 transitions. [2023-01-28 08:05:37,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:37,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2391 transitions. [2023-01-28 08:05:37,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 199.25) internal successors, (2391), 12 states have internal predecessors, (2391), 0 states have call successors, (0), 0 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:37,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 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:37,273 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 430.0) internal successors, (5590), 13 states have internal predecessors, (5590), 0 states have call successors, (0), 0 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:37,273 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 2391 transitions. [2023-01-28 08:05:37,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 207 flow [2023-01-28 08:05:37,273 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:05:37,274 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-01-28 08:05:37,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, 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:05:37,274 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-01-28 08:05:37,274 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-01-28 08:05:37,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 197.30769230769232) internal successors, (2565), 13 states have internal predecessors, (2565), 0 states have call successors, (0), 0 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:37,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:37,275 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-01-28 08:05:37,283 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:05:37,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:37,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:05:37,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash -527083584, now seen corresponding path program 3 times [2023-01-28 08:05:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491180480] [2023-01-28 08:05:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:05:37,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 08:05:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:05:37,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 08:05:37,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 08:05:37,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 08:05:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 08:05:37,526 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 08:05:37,526 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 08:05:37,526 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 08:05:37,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 08:05:37,560 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 08:05:37,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,645 INFO L130 PetriNetUnfolder]: 118/611 cut-off events. [2023-01-28 08:05:37,645 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 08:05:37,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-01-28 08:05:37,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,657 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:05:37,657 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,657 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 317 transitions, 652 flow [2023-01-28 08:05:37,700 INFO L130 PetriNetUnfolder]: 118/611 cut-off events. [2023-01-28 08:05:37,700 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-28 08:05:37,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 611 events. 118/611 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3087 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2023-01-28 08:05:37,726 INFO L119 LiptonReduction]: Number of co-enabled transitions 49956 [2023-01-28 08:05:40,770 INFO L134 LiptonReduction]: Checked pairs total: 85784 [2023-01-28 08:05:40,771 INFO L136 LiptonReduction]: Total number of compositions: 243 [2023-01-28 08:05:40,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:05:40,772 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;@4cd6abb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:05:40,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 08:05:40,774 INFO L130 PetriNetUnfolder]: 9/40 cut-off events. [2023-01-28 08:05:40,774 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 08:05:40,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:40,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:40,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:05:40,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -671268620, now seen corresponding path program 1 times [2023-01-28 08:05:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164018581] [2023-01-28 08:05:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:40,790 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:05:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164018581] [2023-01-28 08:05:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164018581] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:05:40,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:05:40,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:05:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101080415] [2023-01-28 08:05:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:05:40,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:05:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:40,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:05:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:05:40,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 560 [2023-01-28 08:05:40,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 133 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 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:40,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:40,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 560 [2023-01-28 08:05:40,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:42,413 INFO L130 PetriNetUnfolder]: 19961/30642 cut-off events. [2023-01-28 08:05:42,413 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2023-01-28 08:05:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58969 conditions, 30642 events. 19961/30642 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 212646 event pairs, 17166 based on Foata normal form. 5462/30473 useless extension candidates. Maximal degree in co-relation 20159. Up to 28224 conditions per place. [2023-01-28 08:05:42,566 INFO L137 encePairwiseOnDemand]: 516/560 looper letters, 73 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-01-28 08:05:42,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 354 flow [2023-01-28 08:05:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:05:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:05:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2023-01-28 08:05:42,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196428571428572 [2023-01-28 08:05:42,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 873 transitions. [2023-01-28 08:05:42,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 873 transitions. [2023-01-28 08:05:42,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:42,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 873 transitions. [2023-01-28 08:05:42,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:42,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 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:42,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 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:42,574 INFO L175 Difference]: Start difference. First operand has 87 places, 133 transitions, 284 flow. Second operand 3 states and 873 transitions. [2023-01-28 08:05:42,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 354 flow [2023-01-28 08:05:42,575 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:05:42,576 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 214 flow [2023-01-28 08:05:42,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:05:42,577 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2023-01-28 08:05:42,577 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 214 flow [2023-01-28 08:05:42,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 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:42,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:42,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:42,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 08:05:42,578 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:05:42,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1949750384, now seen corresponding path program 1 times [2023-01-28 08:05:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918537543] [2023-01-28 08:05:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:42,602 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:05:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:42,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918537543] [2023-01-28 08:05:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918537543] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:42,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578921180] [2023-01-28 08:05:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:42,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:42,605 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:05:42,624 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:05:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:42,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:05:42,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:42,700 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:05:42,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:05:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578921180] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:05:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:05:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:05:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476264875] [2023-01-28 08:05:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:05:42,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:05:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:42,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:05:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:05:42,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 560 [2023-01-28 08:05:42,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:42,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:42,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 560 [2023-01-28 08:05:42,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:44,318 INFO L130 PetriNetUnfolder]: 19644/30266 cut-off events. [2023-01-28 08:05:44,319 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-01-28 08:05:44,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58589 conditions, 30266 events. 19644/30266 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 213281 event pairs, 8256 based on Foata normal form. 0/24593 useless extension candidates. Maximal degree in co-relation 58576. Up to 28177 conditions per place. [2023-01-28 08:05:44,467 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 91 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2023-01-28 08:05:44,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 111 transitions, 436 flow [2023-01-28 08:05:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:05:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:05:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-01-28 08:05:44,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053571428571428 [2023-01-28 08:05:44,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-01-28 08:05:44,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-01-28 08:05:44,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:44,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-01-28 08:05:44,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 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,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 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,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 560.0) internal successors, (2240), 4 states have internal predecessors, (2240), 0 states have call successors, (0), 0 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,473 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 214 flow. Second operand 3 states and 849 transitions. [2023-01-28 08:05:44,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 111 transitions, 436 flow [2023-01-28 08:05:44,474 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:05:44,475 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 222 flow [2023-01-28 08:05:44,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:05:44,476 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-01-28 08:05:44,476 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 222 flow [2023-01-28 08:05:44,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 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,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:44,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:44,485 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:05:44,681 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:05:44,682 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:05:44,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1622301242, now seen corresponding path program 1 times [2023-01-28 08:05:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826753823] [2023-01-28 08:05:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:44,718 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:05:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826753823] [2023-01-28 08:05:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826753823] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657937234] [2023-01-28 08:05:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:44,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:44,720 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:05:44,746 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:05:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:44,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:05:44,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:44,830 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:05:44,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:44,841 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:05:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657937234] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:44,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:05:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772608272] [2023-01-28 08:05:44,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:44,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:05:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:05:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:05:44,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 560 [2023-01-28 08:05:44,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 254.14285714285714) internal successors, (1779), 7 states have internal predecessors, (1779), 0 states have call successors, (0), 0 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,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:44,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 560 [2023-01-28 08:05:44,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:46,597 INFO L130 PetriNetUnfolder]: 20049/30556 cut-off events. [2023-01-28 08:05:46,598 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2023-01-28 08:05:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59459 conditions, 30556 events. 20049/30556 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 209547 event pairs, 17166 based on Foata normal form. 3/25146 useless extension candidates. Maximal degree in co-relation 59431. Up to 28195 conditions per place. [2023-01-28 08:05:46,703 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 74 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-01-28 08:05:46,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 392 flow [2023-01-28 08:05:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:05:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:05:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1593 transitions. [2023-01-28 08:05:46,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47410714285714284 [2023-01-28 08:05:46,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1593 transitions. [2023-01-28 08:05:46,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1593 transitions. [2023-01-28 08:05:46,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:46,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1593 transitions. [2023-01-28 08:05:46,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 265.5) internal successors, (1593), 6 states have internal predecessors, (1593), 0 states have call successors, (0), 0 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:46,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:46,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:46,711 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 222 flow. Second operand 6 states and 1593 transitions. [2023-01-28 08:05:46,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 392 flow [2023-01-28 08:05:46,712 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:05:46,713 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 256 flow [2023-01-28 08:05:46,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:05:46,714 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2023-01-28 08:05:46,714 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 256 flow [2023-01-28 08:05:46,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 254.14285714285714) internal successors, (1779), 7 states have internal predecessors, (1779), 0 states have call successors, (0), 0 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:46,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:46,714 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:46,721 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:05:46,919 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:05:46,919 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:05:46,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1803240359, now seen corresponding path program 2 times [2023-01-28 08:05:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394442538] [2023-01-28 08:05:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:46,975 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:05:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394442538] [2023-01-28 08:05:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394442538] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461958493] [2023-01-28 08:05:46,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:05:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:46,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:46,977 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:05:46,988 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:05:47,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:05:47,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:05:47,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-28 08:05:47,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:47,076 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:47,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:47,105 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:47,130 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:47,160 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:05:47,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:05:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461958493] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:05:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:05:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:05:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187847794] [2023-01-28 08:05:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:05:47,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:05:47,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:47,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:05:47,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:05:47,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 560 [2023-01-28 08:05:47,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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:47,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:47,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 560 [2023-01-28 08:05:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:49,501 INFO L130 PetriNetUnfolder]: 28021/43546 cut-off events. [2023-01-28 08:05:49,502 INFO L131 PetriNetUnfolder]: For 1064/1064 co-relation queries the response was YES. [2023-01-28 08:05:49,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85366 conditions, 43546 events. 28021/43546 cut-off events. For 1064/1064 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 324824 event pairs, 4181 based on Foata normal form. 0/35978 useless extension candidates. Maximal degree in co-relation 85330. Up to 30470 conditions per place. [2023-01-28 08:05:49,705 INFO L137 encePairwiseOnDemand]: 550/560 looper letters, 201 selfloop transitions, 16 changer transitions 0/233 dead transitions. [2023-01-28 08:05:49,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 233 transitions, 996 flow [2023-01-28 08:05:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:05:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:05:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2023-01-28 08:05:49,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369047619047619 [2023-01-28 08:05:49,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1468 transitions. [2023-01-28 08:05:49,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1468 transitions. [2023-01-28 08:05:49,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:49,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1468 transitions. [2023-01-28 08:05:49,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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,713 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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,713 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 256 flow. Second operand 6 states and 1468 transitions. [2023-01-28 08:05:49,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 233 transitions, 996 flow [2023-01-28 08:05:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 233 transitions, 982 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:05:49,716 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 345 flow [2023-01-28 08:05:49,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:05:49,717 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2023-01-28 08:05:49,717 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 345 flow [2023-01-28 08:05:49,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:49,717 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:49,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-28 08:05:49,926 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:05:49,926 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:05:49,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1035869640, now seen corresponding path program 1 times [2023-01-28 08:05:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51182227] [2023-01-28 08:05:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:49,960 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:05:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51182227] [2023-01-28 08:05:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51182227] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299648497] [2023-01-28 08:05:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:49,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:49,962 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:05:49,987 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:05:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:50,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:05:50,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:50,102 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:05:50,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:50,157 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:05:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299648497] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:50,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 08:05:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865264288] [2023-01-28 08:05:50,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:50,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 08:05:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 08:05:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:05:50,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 560 [2023-01-28 08:05:50,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 345 flow. Second operand has 14 states, 14 states have (on average 247.92857142857142) internal successors, (3471), 14 states have internal predecessors, (3471), 0 states have call successors, (0), 0 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:50,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:50,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 560 [2023-01-28 08:05:50,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:52,920 INFO L130 PetriNetUnfolder]: 25483/40304 cut-off events. [2023-01-28 08:05:52,921 INFO L131 PetriNetUnfolder]: For 8365/8367 co-relation queries the response was YES. [2023-01-28 08:05:53,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86542 conditions, 40304 events. 25483/40304 cut-off events. For 8365/8367 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 308509 event pairs, 621 based on Foata normal form. 32/35590 useless extension candidates. Maximal degree in co-relation 86483. Up to 36042 conditions per place. [2023-01-28 08:05:53,141 INFO L137 encePairwiseOnDemand]: 555/560 looper letters, 142 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2023-01-28 08:05:53,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 849 flow [2023-01-28 08:05:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:05:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:05:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3587 transitions. [2023-01-28 08:05:53,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575255102040816 [2023-01-28 08:05:53,144 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3587 transitions. [2023-01-28 08:05:53,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3587 transitions. [2023-01-28 08:05:53,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:53,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3587 transitions. [2023-01-28 08:05:53,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 256.2142857142857) internal successors, (3587), 14 states have internal predecessors, (3587), 0 states have call successors, (0), 0 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:53,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 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:53,155 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 560.0) internal successors, (8400), 15 states have internal predecessors, (8400), 0 states have call successors, (0), 0 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:53,155 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 345 flow. Second operand 14 states and 3587 transitions. [2023-01-28 08:05:53,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 849 flow [2023-01-28 08:05:53,166 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:05:53,168 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 415 flow [2023-01-28 08:05:53,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:05:53,169 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 34 predicate places. [2023-01-28 08:05:53,169 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 415 flow [2023-01-28 08:05:53,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 247.92857142857142) internal successors, (3471), 14 states have internal predecessors, (3471), 0 states have call successors, (0), 0 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:53,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:53,170 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:53,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 08:05:53,374 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:05:53,375 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:05:53,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:53,375 INFO L85 PathProgramCache]: Analyzing trace with hash 111083739, now seen corresponding path program 1 times [2023-01-28 08:05:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808487197] [2023-01-28 08:05:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:53,529 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:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808487197] [2023-01-28 08:05:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808487197] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627022608] [2023-01-28 08:05:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:53,531 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:05:53,534 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:05:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:53,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-28 08:05:53,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:53,652 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:53,710 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:53,710 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:53,728 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:53,757 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:53,797 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:53,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:59,831 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_807 (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_807) |c_~#cache~0.base|))) is different from false [2023-01-28 08:05:59,899 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:05:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627022608] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:59,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-01-28 08:05:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937907786] [2023-01-28 08:05:59,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:59,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 08:05:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 08:05:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=79, Unknown=3, NotChecked=18, Total=132 [2023-01-28 08:05:59,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 560 [2023-01-28 08:05:59,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 415 flow. Second operand has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 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:59,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:59,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 560 [2023-01-28 08:05:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:03,638 INFO L130 PetriNetUnfolder]: 32541/49862 cut-off events. [2023-01-28 08:06:03,638 INFO L131 PetriNetUnfolder]: For 11987/11991 co-relation queries the response was YES. [2023-01-28 08:06:03,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109085 conditions, 49862 events. 32541/49862 cut-off events. For 11987/11991 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 370175 event pairs, 4806 based on Foata normal form. 4/43973 useless extension candidates. Maximal degree in co-relation 109012. Up to 30239 conditions per place. [2023-01-28 08:06:03,895 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 251 selfloop transitions, 33 changer transitions 0/300 dead transitions. [2023-01-28 08:06:03,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 300 transitions, 1474 flow [2023-01-28 08:06:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:06:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 08:06:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1725 transitions. [2023-01-28 08:06:03,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44005102040816324 [2023-01-28 08:06:03,898 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1725 transitions. [2023-01-28 08:06:03,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1725 transitions. [2023-01-28 08:06:03,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:03,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1725 transitions. [2023-01-28 08:06:03,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.42857142857142) internal successors, (1725), 7 states have internal predecessors, (1725), 0 states have call successors, (0), 0 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:03,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 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:03,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 560.0) internal successors, (4480), 8 states have internal predecessors, (4480), 0 states have call successors, (0), 0 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:03,904 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 415 flow. Second operand 7 states and 1725 transitions. [2023-01-28 08:06:03,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 300 transitions, 1474 flow [2023-01-28 08:06:03,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 300 transitions, 1397 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-01-28 08:06:03,935 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 573 flow [2023-01-28 08:06:03,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:06:03,935 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-01-28 08:06:03,935 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 573 flow [2023-01-28 08:06:03,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.91666666666666) internal successors, (2543), 12 states have internal predecessors, (2543), 0 states have call successors, (0), 0 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:03,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:03,936 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:03,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-28 08:06:04,141 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:06:04,141 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:06:04,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 530400722, now seen corresponding path program 1 times [2023-01-28 08:06:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507642111] [2023-01-28 08:06:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:04,192 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:06:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507642111] [2023-01-28 08:06:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507642111] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447199748] [2023-01-28 08:06:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:04,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:04,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:04,194 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:06:04,226 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:06:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:04,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-28 08:06:04,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:04,341 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:06:04,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:04,369 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:06:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447199748] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:04,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-01-28 08:06:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448402888] [2023-01-28 08:06:04,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:04,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 08:06:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 08:06:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-01-28 08:06:04,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 560 [2023-01-28 08:06:04,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 254.88888888888889) internal successors, (2294), 9 states have internal predecessors, (2294), 0 states have call successors, (0), 0 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:04,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:04,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 560 [2023-01-28 08:06:04,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:04,723 INFO L130 PetriNetUnfolder]: 2603/4612 cut-off events. [2023-01-28 08:06:04,723 INFO L131 PetriNetUnfolder]: For 3210/3210 co-relation queries the response was YES. [2023-01-28 08:06:04,732 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 28621 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:06:04,742 INFO L137 encePairwiseOnDemand]: 557/560 looper letters, 122 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-01-28 08:06:04,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 758 flow [2023-01-28 08:06:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:06:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:06:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1353 transitions. [2023-01-28 08:06:04,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4832142857142857 [2023-01-28 08:06:04,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1353 transitions. [2023-01-28 08:06:04,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1353 transitions. [2023-01-28 08:06:04,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:04,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1353 transitions. [2023-01-28 08:06:04,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 270.6) internal successors, (1353), 5 states have internal predecessors, (1353), 0 states have call successors, (0), 0 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:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 560.0) internal successors, (3360), 6 states have internal predecessors, (3360), 0 states have call successors, (0), 0 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:04,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 560.0) internal successors, (3360), 6 states have internal predecessors, (3360), 0 states have call successors, (0), 0 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:04,747 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 573 flow. Second operand 5 states and 1353 transitions. [2023-01-28 08:06:04,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 758 flow [2023-01-28 08:06:04,753 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:06:04,754 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 253 flow [2023-01-28 08:06:04,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, 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:06:04,754 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -8 predicate places. [2023-01-28 08:06:04,754 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 253 flow [2023-01-28 08:06:04,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 254.88888888888889) internal successors, (2294), 9 states have internal predecessors, (2294), 0 states have call successors, (0), 0 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:04,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:04,755 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:06:04,761 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:06:04,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:04,961 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:06:04,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -503458137, now seen corresponding path program 1 times [2023-01-28 08:06:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390991834] [2023-01-28 08:06:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:05,092 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:06:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390991834] [2023-01-28 08:06:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390991834] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 08:06:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690499223] [2023-01-28 08:06:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:05,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 08:06:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:05,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 08:06:05,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:06:05,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 560 [2023-01-28 08:06:05,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 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:05,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:05,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 560 [2023-01-28 08:06:05,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:05,674 INFO L130 PetriNetUnfolder]: 3663/6158 cut-off events. [2023-01-28 08:06:05,674 INFO L131 PetriNetUnfolder]: For 4875/4875 co-relation queries the response was YES. [2023-01-28 08:06:05,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16341 conditions, 6158 events. 3663/6158 cut-off events. For 4875/4875 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 38326 event pairs, 1273 based on Foata normal form. 198/6087 useless extension candidates. Maximal degree in co-relation 7321. Up to 3359 conditions per place. [2023-01-28 08:06:05,694 INFO L137 encePairwiseOnDemand]: 545/560 looper letters, 91 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2023-01-28 08:06:05,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 113 transitions, 626 flow [2023-01-28 08:06:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 08:06:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 08:06:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 920 transitions. [2023-01-28 08:06:05,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2023-01-28 08:06:05,695 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 920 transitions. [2023-01-28 08:06:05,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 920 transitions. [2023-01-28 08:06:05,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:05,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 920 transitions. [2023-01-28 08:06:05,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:05,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 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:05,699 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 560.0) internal successors, (2800), 5 states have internal predecessors, (2800), 0 states have call successors, (0), 0 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:05,699 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 253 flow. Second operand 4 states and 920 transitions. [2023-01-28 08:06:05,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 113 transitions, 626 flow [2023-01-28 08:06:05,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 113 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 08:06:05,703 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 324 flow [2023-01-28 08:06:05,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-01-28 08:06:05,704 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -7 predicate places. [2023-01-28 08:06:05,704 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 324 flow [2023-01-28 08:06:05,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 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:05,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:05,704 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:06:05,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 08:06:05,705 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:06:05,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1294900255, now seen corresponding path program 1 times [2023-01-28 08:06:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:05,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637557971] [2023-01-28 08:06:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:05,966 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:06:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637557971] [2023-01-28 08:06:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637557971] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:05,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:06:05,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447438174] [2023-01-28 08:06:05,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:05,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:06:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:06:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:06:05,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 560 [2023-01-28 08:06:05,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:05,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:05,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 560 [2023-01-28 08:06:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:06,926 INFO L130 PetriNetUnfolder]: 7166/12080 cut-off events. [2023-01-28 08:06:06,927 INFO L131 PetriNetUnfolder]: For 9244/9262 co-relation queries the response was YES. [2023-01-28 08:06:06,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36383 conditions, 12080 events. 7166/12080 cut-off events. For 9244/9262 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 85991 event pairs, 2856 based on Foata normal form. 148/11612 useless extension candidates. Maximal degree in co-relation 29111. Up to 5788 conditions per place. [2023-01-28 08:06:06,968 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 161 selfloop transitions, 16 changer transitions 0/184 dead transitions. [2023-01-28 08:06:06,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 184 transitions, 1151 flow [2023-01-28 08:06:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2023-01-28 08:06:06,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880952380952381 [2023-01-28 08:06:06,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1304 transitions. [2023-01-28 08:06:06,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1304 transitions. [2023-01-28 08:06:06,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:06,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1304 transitions. [2023-01-28 08:06:06,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 217.33333333333334) internal successors, (1304), 6 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:06,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:06,975 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:06,975 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 324 flow. Second operand 6 states and 1304 transitions. [2023-01-28 08:06:06,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 184 transitions, 1151 flow [2023-01-28 08:06:06,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 184 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:06:06,980 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 475 flow [2023-01-28 08:06:06,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=475, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2023-01-28 08:06:06,981 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2023-01-28 08:06:06,981 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 475 flow [2023-01-28 08:06:06,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:06,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:06,982 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:06:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-01-28 08:06:06,982 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:06:06,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1202449935, now seen corresponding path program 2 times [2023-01-28 08:06:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694630064] [2023-01-28 08:06:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:07,211 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:06:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694630064] [2023-01-28 08:06:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694630064] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:06:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197074587] [2023-01-28 08:06:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:06:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:06:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:06:07,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 560 [2023-01-28 08:06:07,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:07,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:07,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 560 [2023-01-28 08:06:07,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:08,719 INFO L130 PetriNetUnfolder]: 11788/19816 cut-off events. [2023-01-28 08:06:08,719 INFO L131 PetriNetUnfolder]: For 22830/22848 co-relation queries the response was YES. [2023-01-28 08:06:08,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65996 conditions, 19816 events. 11788/19816 cut-off events. For 22830/22848 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 150097 event pairs, 5479 based on Foata normal form. 153/18891 useless extension candidates. Maximal degree in co-relation 26043. Up to 11913 conditions per place. [2023-01-28 08:06:08,841 INFO L137 encePairwiseOnDemand]: 547/560 looper letters, 176 selfloop transitions, 25 changer transitions 0/207 dead transitions. [2023-01-28 08:06:08,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 207 transitions, 1508 flow [2023-01-28 08:06:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2023-01-28 08:06:08,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880952380952381 [2023-01-28 08:06:08,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1304 transitions. [2023-01-28 08:06:08,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1304 transitions. [2023-01-28 08:06:08,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:08,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1304 transitions. [2023-01-28 08:06:08,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 217.33333333333334) internal successors, (1304), 6 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:08,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:08,846 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:08,846 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 475 flow. Second operand 6 states and 1304 transitions. [2023-01-28 08:06:08,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 207 transitions, 1508 flow [2023-01-28 08:06:08,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 207 transitions, 1497 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:08,859 INFO L231 Difference]: Finished difference. Result has 93 places, 113 transitions, 765 flow [2023-01-28 08:06:08,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=93, PETRI_TRANSITIONS=113} [2023-01-28 08:06:08,860 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2023-01-28 08:06:08,860 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 113 transitions, 765 flow [2023-01-28 08:06:08,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:08,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:08,860 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:06:08,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-28 08:06:08,860 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:06:08,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1121901073, now seen corresponding path program 3 times [2023-01-28 08:06:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654713950] [2023-01-28 08:06:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:09,178 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:06:09,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654713950] [2023-01-28 08:06:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654713950] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189284551] [2023-01-28 08:06:09,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:06:09,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:09,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:09,181 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:06:09,213 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:06:09,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-28 08:06:09,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:09,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-28 08:06:09,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:09,406 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:06:09,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:09,440 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:06:09,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:09,469 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:06:09,505 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:06:09,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:06:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189284551] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:09,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:06:09,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2023-01-28 08:06:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477628018] [2023-01-28 08:06:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:09,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:06:09,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:06:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:06:09,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 560 [2023-01-28 08:06:09,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 765 flow. Second operand has 7 states, 7 states have (on average 200.71428571428572) internal successors, (1405), 7 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:09,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:09,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 560 [2023-01-28 08:06:09,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:11,412 INFO L130 PetriNetUnfolder]: 11737/20039 cut-off events. [2023-01-28 08:06:11,413 INFO L131 PetriNetUnfolder]: For 35621/35669 co-relation queries the response was YES. [2023-01-28 08:06:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72202 conditions, 20039 events. 11737/20039 cut-off events. For 35621/35669 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 156346 event pairs, 4995 based on Foata normal form. 24/18968 useless extension candidates. Maximal degree in co-relation 52124. Up to 10799 conditions per place. [2023-01-28 08:06:11,573 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 205 selfloop transitions, 22 changer transitions 0/234 dead transitions. [2023-01-28 08:06:11,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 234 transitions, 1937 flow [2023-01-28 08:06:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2023-01-28 08:06:11,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39226190476190476 [2023-01-28 08:06:11,576 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1318 transitions. [2023-01-28 08:06:11,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1318 transitions. [2023-01-28 08:06:11,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:11,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1318 transitions. [2023-01-28 08:06:11,578 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:06:11,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:11,581 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:11,581 INFO L175 Difference]: Start difference. First operand has 93 places, 113 transitions, 765 flow. Second operand 6 states and 1318 transitions. [2023-01-28 08:06:11,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 234 transitions, 1937 flow [2023-01-28 08:06:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 234 transitions, 1916 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:11,599 INFO L231 Difference]: Finished difference. Result has 98 places, 121 transitions, 891 flow [2023-01-28 08:06:11,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=891, PETRI_PLACES=98, PETRI_TRANSITIONS=121} [2023-01-28 08:06:11,600 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 11 predicate places. [2023-01-28 08:06:11,600 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 121 transitions, 891 flow [2023-01-28 08:06:11,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.71428571428572) internal successors, (1405), 7 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:11,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:11,601 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:06:11,613 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:06:11,801 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,SelfDestructingSolverStorable23 [2023-01-28 08:06:11,801 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:06:11,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash -273617943, now seen corresponding path program 4 times [2023-01-28 08:06:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:11,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561568791] [2023-01-28 08:06:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:12,053 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:06:12,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561568791] [2023-01-28 08:06:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561568791] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:12,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:06:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860928992] [2023-01-28 08:06:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:12,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:06:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:06:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:06:12,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 560 [2023-01-28 08:06:12,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 121 transitions, 891 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:12,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:12,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 560 [2023-01-28 08:06:12,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:13,906 INFO L130 PetriNetUnfolder]: 13337/22618 cut-off events. [2023-01-28 08:06:13,906 INFO L131 PetriNetUnfolder]: For 50014/50086 co-relation queries the response was YES. [2023-01-28 08:06:14,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84742 conditions, 22618 events. 13337/22618 cut-off events. For 50014/50086 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 176654 event pairs, 6428 based on Foata normal form. 33/21404 useless extension candidates. Maximal degree in co-relation 52759. Up to 12975 conditions per place. [2023-01-28 08:06:14,097 INFO L137 encePairwiseOnDemand]: 548/560 looper letters, 225 selfloop transitions, 30 changer transitions 0/261 dead transitions. [2023-01-28 08:06:14,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 261 transitions, 2327 flow [2023-01-28 08:06:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-01-28 08:06:14,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39345238095238094 [2023-01-28 08:06:14,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-01-28 08:06:14,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-01-28 08:06:14,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:14,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-01-28 08:06:14,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 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:14,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:14,105 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:14,105 INFO L175 Difference]: Start difference. First operand has 98 places, 121 transitions, 891 flow. Second operand 6 states and 1322 transitions. [2023-01-28 08:06:14,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 261 transitions, 2327 flow [2023-01-28 08:06:14,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 261 transitions, 2309 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:14,136 INFO L231 Difference]: Finished difference. Result has 104 places, 140 transitions, 1240 flow [2023-01-28 08:06:14,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1240, PETRI_PLACES=104, PETRI_TRANSITIONS=140} [2023-01-28 08:06:14,137 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 17 predicate places. [2023-01-28 08:06:14,137 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 140 transitions, 1240 flow [2023-01-28 08:06:14,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:14,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:14,138 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:06:14,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-01-28 08:06:14,138 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:06:14,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash -714373981, now seen corresponding path program 5 times [2023-01-28 08:06:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998217782] [2023-01-28 08:06:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:14,384 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:06:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998217782] [2023-01-28 08:06:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998217782] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:06:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675185833] [2023-01-28 08:06:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:06:14,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:06:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:06:14,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 560 [2023-01-28 08:06:14,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 140 transitions, 1240 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:14,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:14,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 560 [2023-01-28 08:06:14,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:16,801 INFO L130 PetriNetUnfolder]: 13313/22618 cut-off events. [2023-01-28 08:06:16,801 INFO L131 PetriNetUnfolder]: For 57798/57906 co-relation queries the response was YES. [2023-01-28 08:06:16,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86175 conditions, 22618 events. 13313/22618 cut-off events. For 57798/57906 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 176889 event pairs, 6071 based on Foata normal form. 48/21424 useless extension candidates. Maximal degree in co-relation 63688. Up to 11597 conditions per place. [2023-01-28 08:06:16,908 INFO L137 encePairwiseOnDemand]: 548/560 looper letters, 225 selfloop transitions, 34 changer transitions 0/265 dead transitions. [2023-01-28 08:06:16,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 265 transitions, 2513 flow [2023-01-28 08:06:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2023-01-28 08:06:16,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2023-01-28 08:06:16,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1323 transitions. [2023-01-28 08:06:16,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1323 transitions. [2023-01-28 08:06:16,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:16,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1323 transitions. [2023-01-28 08:06:16,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 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:16,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:16,913 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:16,913 INFO L175 Difference]: Start difference. First operand has 104 places, 140 transitions, 1240 flow. Second operand 6 states and 1323 transitions. [2023-01-28 08:06:16,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 265 transitions, 2513 flow [2023-01-28 08:06:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 265 transitions, 2491 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:16,940 INFO L231 Difference]: Finished difference. Result has 110 places, 149 transitions, 1472 flow [2023-01-28 08:06:16,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=110, PETRI_TRANSITIONS=149} [2023-01-28 08:06:16,941 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 23 predicate places. [2023-01-28 08:06:16,941 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 149 transitions, 1472 flow [2023-01-28 08:06:16,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:16,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:16,941 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:06:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-01-28 08:06:16,941 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:06:16,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1296490569, now seen corresponding path program 6 times [2023-01-28 08:06:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002442492] [2023-01-28 08:06:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:17,361 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:06:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002442492] [2023-01-28 08:06:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002442492] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:17,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110873487] [2023-01-28 08:06:17,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:06:17,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:17,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:17,363 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:06:17,391 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:06:17,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-01-28 08:06:17,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:17,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2023-01-28 08:06:17,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:17,602 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:06:17,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:17,640 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:06:17,668 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:06:17,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:06:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110873487] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:17,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:06:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2023-01-28 08:06:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208565283] [2023-01-28 08:06:17,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:06:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:06:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:06:17,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 560 [2023-01-28 08:06:17,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 149 transitions, 1472 flow. Second operand has 7 states, 7 states have (on average 200.71428571428572) internal successors, (1405), 7 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:17,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:17,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 560 [2023-01-28 08:06:17,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:19,503 INFO L130 PetriNetUnfolder]: 11713/20135 cut-off events. [2023-01-28 08:06:19,503 INFO L131 PetriNetUnfolder]: For 56324/56405 co-relation queries the response was YES. [2023-01-28 08:06:19,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77230 conditions, 20135 events. 11713/20135 cut-off events. For 56324/56405 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 157997 event pairs, 5480 based on Foata normal form. 72/19109 useless extension candidates. Maximal degree in co-relation 54023. Up to 10729 conditions per place. [2023-01-28 08:06:19,649 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 198 selfloop transitions, 20 changer transitions 0/225 dead transitions. [2023-01-28 08:06:19,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 225 transitions, 2143 flow [2023-01-28 08:06:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1315 transitions. [2023-01-28 08:06:19,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3913690476190476 [2023-01-28 08:06:19,651 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1315 transitions. [2023-01-28 08:06:19,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1315 transitions. [2023-01-28 08:06:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:19,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1315 transitions. [2023-01-28 08:06:19,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 0 states have call successors, (0), 0 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:19,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:19,656 INFO L175 Difference]: Start difference. First operand has 110 places, 149 transitions, 1472 flow. Second operand 6 states and 1315 transitions. [2023-01-28 08:06:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 225 transitions, 2143 flow [2023-01-28 08:06:19,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 225 transitions, 2110 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:19,699 INFO L231 Difference]: Finished difference. Result has 115 places, 137 transitions, 1278 flow [2023-01-28 08:06:19,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1278, PETRI_PLACES=115, PETRI_TRANSITIONS=137} [2023-01-28 08:06:19,699 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 28 predicate places. [2023-01-28 08:06:19,699 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 137 transitions, 1278 flow [2023-01-28 08:06:19,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.71428571428572) internal successors, (1405), 7 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:19,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:19,700 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:06:19,707 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:06:19,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 08:06:19,905 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:06:19,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1859196367, now seen corresponding path program 7 times [2023-01-28 08:06:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162471412] [2023-01-28 08:06:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:20,200 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:06:20,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:20,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162471412] [2023-01-28 08:06:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162471412] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:06:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 08:06:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422257469] [2023-01-28 08:06:20,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:20,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:06:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:06:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:06:20,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 560 [2023-01-28 08:06:20,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 137 transitions, 1278 flow. Second operand has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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:20,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:20,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 560 [2023-01-28 08:06:20,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:21,864 INFO L130 PetriNetUnfolder]: 11030/18909 cut-off events. [2023-01-28 08:06:21,865 INFO L131 PetriNetUnfolder]: For 53685/53721 co-relation queries the response was YES. [2023-01-28 08:06:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72354 conditions, 18909 events. 11030/18909 cut-off events. For 53685/53721 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 146001 event pairs, 5711 based on Foata normal form. 48/17981 useless extension candidates. Maximal degree in co-relation 71247. Up to 12201 conditions per place. [2023-01-28 08:06:22,016 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 191 selfloop transitions, 19 changer transitions 0/217 dead transitions. [2023-01-28 08:06:22,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 217 transitions, 2070 flow [2023-01-28 08:06:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1263 transitions. [2023-01-28 08:06:22,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37589285714285714 [2023-01-28 08:06:22,018 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1263 transitions. [2023-01-28 08:06:22,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1263 transitions. [2023-01-28 08:06:22,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:22,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1263 transitions. [2023-01-28 08:06:22,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 210.5) internal successors, (1263), 6 states have internal predecessors, (1263), 0 states have call successors, (0), 0 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:22,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:22,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:22,021 INFO L175 Difference]: Start difference. First operand has 115 places, 137 transitions, 1278 flow. Second operand 6 states and 1263 transitions. [2023-01-28 08:06:22,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 217 transitions, 2070 flow [2023-01-28 08:06:22,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 217 transitions, 2008 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-01-28 08:06:22,069 INFO L231 Difference]: Finished difference. Result has 119 places, 131 transitions, 1185 flow [2023-01-28 08:06:22,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1185, PETRI_PLACES=119, PETRI_TRANSITIONS=131} [2023-01-28 08:06:22,070 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 32 predicate places. [2023-01-28 08:06:22,070 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 131 transitions, 1185 flow [2023-01-28 08:06:22,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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:22,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:22,070 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:06:22,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-01-28 08:06:22,071 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:06:22,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 923061181, now seen corresponding path program 1 times [2023-01-28 08:06:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:22,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135495664] [2023-01-28 08:06:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:22,516 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:06:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135495664] [2023-01-28 08:06:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135495664] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048624260] [2023-01-28 08:06:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:22,522 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:06:22,528 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:06:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:22,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-28 08:06:22,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:22,726 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:06:22,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:22,763 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:06:22,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:22,783 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:06:22,827 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:06:22,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:06:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048624260] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:06:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-01-28 08:06:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992675343] [2023-01-28 08:06:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:22,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:06:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:06:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-01-28 08:06:22,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 560 [2023-01-28 08:06:22,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 131 transitions, 1185 flow. Second operand has 7 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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:22,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:22,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 560 [2023-01-28 08:06:22,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:24,662 INFO L130 PetriNetUnfolder]: 11662/20020 cut-off events. [2023-01-28 08:06:24,662 INFO L131 PetriNetUnfolder]: For 59558/59600 co-relation queries the response was YES. [2023-01-28 08:06:24,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77185 conditions, 20020 events. 11662/20020 cut-off events. For 59558/59600 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 157351 event pairs, 5421 based on Foata normal form. 21/19019 useless extension candidates. Maximal degree in co-relation 76040. Up to 12378 conditions per place. [2023-01-28 08:06:24,825 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 205 selfloop transitions, 28 changer transitions 0/240 dead transitions. [2023-01-28 08:06:24,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 240 transitions, 2318 flow [2023-01-28 08:06:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1315 transitions. [2023-01-28 08:06:24,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3913690476190476 [2023-01-28 08:06:24,827 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1315 transitions. [2023-01-28 08:06:24,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1315 transitions. [2023-01-28 08:06:24,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:24,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1315 transitions. [2023-01-28 08:06:24,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 0 states have call successors, (0), 0 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:24,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:24,830 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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:24,830 INFO L175 Difference]: Start difference. First operand has 119 places, 131 transitions, 1185 flow. Second operand 6 states and 1315 transitions. [2023-01-28 08:06:24,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 240 transitions, 2318 flow [2023-01-28 08:06:24,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 240 transitions, 2266 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-28 08:06:24,877 INFO L231 Difference]: Finished difference. Result has 123 places, 138 transitions, 1328 flow [2023-01-28 08:06:24,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1328, PETRI_PLACES=123, PETRI_TRANSITIONS=138} [2023-01-28 08:06:24,877 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 36 predicate places. [2023-01-28 08:06:24,877 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 138 transitions, 1328 flow [2023-01-28 08:06:24,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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:24,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:24,878 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:06:24,883 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:06:25,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-01-28 08:06:25,083 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:06:25,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1557358783, now seen corresponding path program 2 times [2023-01-28 08:06:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586750997] [2023-01-28 08:06:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:25,530 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:06:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586750997] [2023-01-28 08:06:25,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586750997] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895082994] [2023-01-28 08:06:25,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:06:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:25,532 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:06:25,534 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:06:25,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:06:25,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:06:25,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjunts are in the unsatisfiable core [2023-01-28 08:06:25,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:25,792 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:06:25,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:25,841 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:06:25,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:06:25,866 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:06:25,890 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:06:25,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:06:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895082994] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:06:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:06:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-01-28 08:06:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754210991] [2023-01-28 08:06:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:06:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:06:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:06:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-01-28 08:06:25,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 560 [2023-01-28 08:06:25,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 138 transitions, 1328 flow. Second operand has 7 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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:25,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:25,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 560 [2023-01-28 08:06:25,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:27,675 INFO L130 PetriNetUnfolder]: 11336/19502 cut-off events. [2023-01-28 08:06:27,676 INFO L131 PetriNetUnfolder]: For 56149/56173 co-relation queries the response was YES. [2023-01-28 08:06:27,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75022 conditions, 19502 events. 11336/19502 cut-off events. For 56149/56173 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 151769 event pairs, 5891 based on Foata normal form. 18/18516 useless extension candidates. Maximal degree in co-relation 74319. Up to 12293 conditions per place. [2023-01-28 08:06:27,872 INFO L137 encePairwiseOnDemand]: 553/560 looper letters, 192 selfloop transitions, 18 changer transitions 0/217 dead transitions. [2023-01-28 08:06:27,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 217 transitions, 2047 flow [2023-01-28 08:06:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:06:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:06:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2023-01-28 08:06:27,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2023-01-28 08:06:27,874 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2023-01-28 08:06:27,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2023-01-28 08:06:27,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:27,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2023-01-28 08:06:27,875 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:06:27,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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,877 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 560.0) internal successors, (3920), 7 states have internal predecessors, (3920), 0 states have call successors, (0), 0 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,878 INFO L175 Difference]: Start difference. First operand has 123 places, 138 transitions, 1328 flow. Second operand 6 states and 1312 transitions. [2023-01-28 08:06:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 217 transitions, 2047 flow [2023-01-28 08:06:27,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 217 transitions, 2024 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 08:06:27,948 INFO L231 Difference]: Finished difference. Result has 126 places, 131 transitions, 1199 flow [2023-01-28 08:06:27,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1199, PETRI_PLACES=126, PETRI_TRANSITIONS=131} [2023-01-28 08:06:27,949 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 39 predicate places. [2023-01-28 08:06:27,949 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 131 transitions, 1199 flow [2023-01-28 08:06:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:27,949 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:06:27,958 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:06:28,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:28,155 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:06:28,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1858616422, now seen corresponding path program 1 times [2023-01-28 08:06:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:28,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374977834] [2023-01-28 08:06:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:06:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:28,429 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:06:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:06:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374977834] [2023-01-28 08:06:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374977834] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:06:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058533015] [2023-01-28 08:06:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:06:28,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:06:28,433 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:06:28,456 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:06:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:06:28,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 08:06:28,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:06:28,581 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,626 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:06:28,627 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,642 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,701 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,750 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:06:33,655 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:06:33,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:06:43,711 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:06:45,732 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1523 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_1523)) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-01-28 08:06:55,872 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1520 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1523 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1520) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_1523) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_69| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_70| 28)))) is different from false [2023-01-28 08:06:56,005 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:06:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058533015] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:06:56,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:06:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 08:06:56,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877851385] [2023-01-28 08:06:56,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:06:56,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:06:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:06:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:06:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=247, Unknown=16, NotChecked=108, Total=462 [2023-01-28 08:06:56,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 560 [2023-01-28 08:06:56,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 131 transitions, 1199 flow. Second operand has 22 states, 22 states have (on average 205.36363636363637) internal successors, (4518), 22 states have internal predecessors, (4518), 0 states have call successors, (0), 0 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:56,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:06:56,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 560 [2023-01-28 08:06:56,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:06:57,142 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:06:58,355 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:06:59,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:02,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:03,440 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:07:04,531 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:07:05,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:10,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:11,587 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:07:12,776 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:07:13,986 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:07:15,153 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:07:16,372 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:07:17,514 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:07:18,705 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:07:19,837 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:07:21,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:22,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:23,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:24,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:26,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:27,311 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:07:28,431 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:07:29,557 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:07:34,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:38,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:39,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:41,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:43,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:45,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:46,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:48,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:50,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:53,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:07:54,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:00,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:01,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:03,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:05,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:06,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:08,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:11,496 INFO L130 PetriNetUnfolder]: 17890/30735 cut-off events. [2023-01-28 08:08:11,497 INFO L131 PetriNetUnfolder]: For 89102/89114 co-relation queries the response was YES. [2023-01-28 08:08:11,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119296 conditions, 30735 events. 17890/30735 cut-off events. For 89102/89114 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 256516 event pairs, 3241 based on Foata normal form. 135/29400 useless extension candidates. Maximal degree in co-relation 118563. Up to 15125 conditions per place. [2023-01-28 08:08:11,870 INFO L137 encePairwiseOnDemand]: 550/560 looper letters, 355 selfloop transitions, 50 changer transitions 0/413 dead transitions. [2023-01-28 08:08:11,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 413 transitions, 4475 flow [2023-01-28 08:08:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 08:08:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 08:08:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2227 transitions. [2023-01-28 08:08:11,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39767857142857144 [2023-01-28 08:08:11,873 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2227 transitions. [2023-01-28 08:08:11,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2227 transitions. [2023-01-28 08:08:11,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:08:11,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2227 transitions. [2023-01-28 08:08:11,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 222.7) internal successors, (2227), 10 states have internal predecessors, (2227), 0 states have call successors, (0), 0 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:08:11,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 560.0) internal successors, (6160), 11 states have internal predecessors, (6160), 0 states have call successors, (0), 0 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:08:11,879 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 560.0) internal successors, (6160), 11 states have internal predecessors, (6160), 0 states have call successors, (0), 0 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:08:11,879 INFO L175 Difference]: Start difference. First operand has 126 places, 131 transitions, 1199 flow. Second operand 10 states and 2227 transitions. [2023-01-28 08:08:11,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 413 transitions, 4475 flow [2023-01-28 08:08:11,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 413 transitions, 4375 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 08:08:11,964 INFO L231 Difference]: Finished difference. Result has 137 places, 172 transitions, 1788 flow [2023-01-28 08:08:11,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1788, PETRI_PLACES=137, PETRI_TRANSITIONS=172} [2023-01-28 08:08:11,964 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 50 predicate places. [2023-01-28 08:08:11,964 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 172 transitions, 1788 flow [2023-01-28 08:08:11,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 205.36363636363637) internal successors, (4518), 22 states have internal predecessors, (4518), 0 states have call successors, (0), 0 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:08:11,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:08:11,965 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:08:11,973 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:08:12,170 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,SelfDestructingSolverStorable30 [2023-01-28 08:08:12,171 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:08:12,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:08:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 835738970, now seen corresponding path program 1 times [2023-01-28 08:08:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:08:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076443201] [2023-01-28 08:08:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:08:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:08:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:08:12,523 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:08:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:08:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076443201] [2023-01-28 08:08:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076443201] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:08:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951819621] [2023-01-28 08:08:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:08:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:08:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:08:12,526 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:08:12,529 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:08:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:08:12,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:08:12,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:08:12,700 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:08:12,769 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:08:12,770 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:08:12,791 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:08:12,889 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:08:12,949 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:08:12,985 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:08:18,048 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:08:18,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:08:28,118 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-01-28 08:08:30,137 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-01-28 08:08:32,161 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| 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_1623)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:08:32,232 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| 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_74| v_ArrVal_1623)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0))) is different from false [2023-01-28 08:08:32,262 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (v_ArrVal_1623 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_1623))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1625) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_73| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_74| 28)))) is different from false [2023-01-28 08:08:32,402 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:08:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951819621] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:08:32,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:08:32,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-01-28 08:08:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175368772] [2023-01-28 08:08:32,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:08:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:08:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:08:32,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:08:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=231, Unknown=12, NotChecked=180, Total=506 [2023-01-28 08:08:32,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 560 [2023-01-28 08:08:32,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 172 transitions, 1788 flow. Second operand has 23 states, 23 states have (on average 205.52173913043478) internal successors, (4727), 23 states have internal predecessors, (4727), 0 states have call successors, (0), 0 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:08:32,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:08:32,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 560 [2023-01-28 08:08:32,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:08:33,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:35,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:37,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:42,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:46,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:47,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:49,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:08:57,242 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 39 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:59,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:00,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:02,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:04,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:05,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:07,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:09,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:11,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:12,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:14,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:16,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:18,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:19,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:21,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:23,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:24,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:26,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:32,612 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 38 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:09:37,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:39,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:41,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:43,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:45,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:47,069 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] [2023-01-28 08:09:48,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:50,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:52,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:54,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:58,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:09:59,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:06,018 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] [2023-01-28 08:10:08,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:09,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:10,611 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:10:11,823 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:10:13,088 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:10:16,833 INFO L130 PetriNetUnfolder]: 22626/38915 cut-off events. [2023-01-28 08:10:16,833 INFO L131 PetriNetUnfolder]: For 172220/172259 co-relation queries the response was YES. [2023-01-28 08:10:17,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172320 conditions, 38915 events. 22626/38915 cut-off events. For 172220/172259 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 332019 event pairs, 4314 based on Foata normal form. 159/37214 useless extension candidates. Maximal degree in co-relation 170949. Up to 14212 conditions per place. [2023-01-28 08:10:17,233 INFO L137 encePairwiseOnDemand]: 536/560 looper letters, 372 selfloop transitions, 92 changer transitions 0/472 dead transitions. [2023-01-28 08:10:17,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 472 transitions, 5396 flow [2023-01-28 08:10:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 08:10:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 08:10:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2451 transitions. [2023-01-28 08:10:17,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978896103896104 [2023-01-28 08:10:17,235 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2451 transitions. [2023-01-28 08:10:17,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2451 transitions. [2023-01-28 08:10:17,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:17,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2451 transitions. [2023-01-28 08:10:17,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 222.8181818181818) internal successors, (2451), 11 states have internal predecessors, (2451), 0 states have call successors, (0), 0 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:17,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 560.0) internal successors, (6720), 12 states have internal predecessors, (6720), 0 states have call successors, (0), 0 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:17,242 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 560.0) internal successors, (6720), 12 states have internal predecessors, (6720), 0 states have call successors, (0), 0 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:17,242 INFO L175 Difference]: Start difference. First operand has 137 places, 172 transitions, 1788 flow. Second operand 11 states and 2451 transitions. [2023-01-28 08:10:17,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 472 transitions, 5396 flow [2023-01-28 08:10:17,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 472 transitions, 5360 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-28 08:10:17,456 INFO L231 Difference]: Finished difference. Result has 150 places, 221 transitions, 2687 flow [2023-01-28 08:10:17,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2687, PETRI_PLACES=150, PETRI_TRANSITIONS=221} [2023-01-28 08:10:17,456 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 63 predicate places. [2023-01-28 08:10:17,456 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 221 transitions, 2687 flow [2023-01-28 08:10:17,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 205.52173913043478) internal successors, (4727), 23 states have internal predecessors, (4727), 0 states have call successors, (0), 0 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:17,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:17,457 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:10:17,462 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:10:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:17,662 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:10:17,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1383321978, now seen corresponding path program 1 times [2023-01-28 08:10:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967368946] [2023-01-28 08:10:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:17,928 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:10:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967368946] [2023-01-28 08:10:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967368946] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260995085] [2023-01-28 08:10:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:17,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:17,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:17,930 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:10:17,931 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:10:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:18,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 08:10:18,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:18,072 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:18,119 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:18,120 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:18,133 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:18,150 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:18,214 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:10:18,260 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:10:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:10:18,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:10:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260995085] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:27,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:27,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-01-28 08:10:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799241435] [2023-01-28 08:10:27,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:10:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:27,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:10:27,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=375, Unknown=3, NotChecked=0, Total=462 [2023-01-28 08:10:27,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 560 [2023-01-28 08:10:27,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 221 transitions, 2687 flow. Second operand has 22 states, 22 states have (on average 202.0909090909091) internal successors, (4446), 22 states have internal predecessors, (4446), 0 states have call successors, (0), 0 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:27,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:27,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 560 [2023-01-28 08:10:27,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:35,012 INFO L130 PetriNetUnfolder]: 25825/44601 cut-off events. [2023-01-28 08:10:35,013 INFO L131 PetriNetUnfolder]: For 259402/259453 co-relation queries the response was YES. [2023-01-28 08:10:35,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223480 conditions, 44601 events. 25825/44601 cut-off events. For 259402/259453 co-relation queries the response was YES. Maximal size of possible extension queue 1724. Compared 389631 event pairs, 5675 based on Foata normal form. 144/42630 useless extension candidates. Maximal degree in co-relation 221913. Up to 25479 conditions per place. [2023-01-28 08:10:35,586 INFO L137 encePairwiseOnDemand]: 546/560 looper letters, 491 selfloop transitions, 65 changer transitions 0/564 dead transitions. [2023-01-28 08:10:35,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 564 transitions, 7745 flow [2023-01-28 08:10:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:10:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:10:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2804 transitions. [2023-01-28 08:10:35,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3851648351648352 [2023-01-28 08:10:35,590 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2804 transitions. [2023-01-28 08:10:35,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2804 transitions. [2023-01-28 08:10:35,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:35,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2804 transitions. [2023-01-28 08:10:35,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 215.69230769230768) internal successors, (2804), 13 states have internal predecessors, (2804), 0 states have call successors, (0), 0 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:35,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 560.0) internal successors, (7840), 14 states have internal predecessors, (7840), 0 states have call successors, (0), 0 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:35,598 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 560.0) internal successors, (7840), 14 states have internal predecessors, (7840), 0 states have call successors, (0), 0 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:35,598 INFO L175 Difference]: Start difference. First operand has 150 places, 221 transitions, 2687 flow. Second operand 13 states and 2804 transitions. [2023-01-28 08:10:35,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 564 transitions, 7745 flow [2023-01-28 08:10:36,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 564 transitions, 7665 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-01-28 08:10:36,282 INFO L231 Difference]: Finished difference. Result has 166 places, 266 transitions, 3368 flow [2023-01-28 08:10:36,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3368, PETRI_PLACES=166, PETRI_TRANSITIONS=266} [2023-01-28 08:10:36,283 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 79 predicate places. [2023-01-28 08:10:36,283 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 266 transitions, 3368 flow [2023-01-28 08:10:36,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 202.0909090909091) internal successors, (4446), 22 states have internal predecessors, (4446), 0 states have call successors, (0), 0 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,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:36,284 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:10:36,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:36,485 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,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1960762675, now seen corresponding path program 1 times [2023-01-28 08:10:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735332385] [2023-01-28 08:10:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:36,884 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:10:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735332385] [2023-01-28 08:10:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735332385] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387953904] [2023-01-28 08:10:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:36,885 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:10:36,888 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:10:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:37,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2023-01-28 08:10:37,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:37,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:10:37,449 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:10:37,476 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:10:37,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:39,675 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1821 Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |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_77| v_ArrVal_1821) |c_~#cache~0.offset|) 0))) is different from false [2023-01-28 08:10:39,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:10:39,697 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:10:39,707 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:10:39,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:10:39,722 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:10:39,819 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:10:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387953904] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:39,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2023-01-28 08:10:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265678810] [2023-01-28 08:10:39,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:39,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:10:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:10:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=612, Unknown=1, NotChecked=50, Total=756 [2023-01-28 08:10:39,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 560 [2023-01-28 08:10:39,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 266 transitions, 3368 flow. Second operand has 28 states, 28 states have (on average 195.5) internal successors, (5474), 28 states have internal predecessors, (5474), 0 states have call successors, (0), 0 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:39,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:39,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 560 [2023-01-28 08:10:39,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:54,548 INFO L130 PetriNetUnfolder]: 39638/68037 cut-off events. [2023-01-28 08:10:54,549 INFO L131 PetriNetUnfolder]: For 458884/458976 co-relation queries the response was YES. [2023-01-28 08:10:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359861 conditions, 68037 events. 39638/68037 cut-off events. For 458884/458976 co-relation queries the response was YES. Maximal size of possible extension queue 2208. Compared 609342 event pairs, 7069 based on Foata normal form. 270/65024 useless extension candidates. Maximal degree in co-relation 358067. Up to 26740 conditions per place. [2023-01-28 08:10:55,542 INFO L137 encePairwiseOnDemand]: 542/560 looper letters, 1028 selfloop transitions, 368 changer transitions 3/1407 dead transitions. [2023-01-28 08:10:55,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1407 transitions, 17733 flow [2023-01-28 08:10:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-01-28 08:10:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-01-28 08:10:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 10377 transitions. [2023-01-28 08:10:55,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37060714285714286 [2023-01-28 08:10:55,552 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 10377 transitions. [2023-01-28 08:10:55,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 10377 transitions. [2023-01-28 08:10:55,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:55,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 10377 transitions. [2023-01-28 08:10:55,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 207.54) internal successors, (10377), 50 states have internal predecessors, (10377), 0 states have call successors, (0), 0 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:55,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 560.0) internal successors, (28560), 51 states have internal predecessors, (28560), 0 states have call successors, (0), 0 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:55,721 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 560.0) internal successors, (28560), 51 states have internal predecessors, (28560), 0 states have call successors, (0), 0 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:55,722 INFO L175 Difference]: Start difference. First operand has 166 places, 266 transitions, 3368 flow. Second operand 50 states and 10377 transitions. [2023-01-28 08:10:55,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1407 transitions, 17733 flow [2023-01-28 08:10:57,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1407 transitions, 17411 flow, removed 135 selfloop flow, removed 3 redundant places. [2023-01-28 08:10:57,970 INFO L231 Difference]: Finished difference. Result has 246 places, 588 transitions, 9000 flow [2023-01-28 08:10:57,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=3296, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=9000, PETRI_PLACES=246, PETRI_TRANSITIONS=588} [2023-01-28 08:10:57,971 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 159 predicate places. [2023-01-28 08:10:57,971 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 588 transitions, 9000 flow [2023-01-28 08:10:57,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 195.5) internal successors, (5474), 28 states have internal predecessors, (5474), 0 states have call successors, (0), 0 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:57,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:57,972 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:10:57,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:58,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:58,173 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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:58,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash -130961342, now seen corresponding path program 1 times [2023-01-28 08:10:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666272807] [2023-01-28 08:10:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:58,548 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:10:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666272807] [2023-01-28 08:10:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666272807] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828665306] [2023-01-28 08:10:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:58,550 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:10:58,551 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:10:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:58,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 08:10:58,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:58,712 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:58,793 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:58,793 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:58,819 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:58,850 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:59,010 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:10:59,115 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:10:59,182 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:10:59,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:10:59,354 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1919 (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_1919))) (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:10:59,463 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:10:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828665306] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:10:59,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:10:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 27 [2023-01-28 08:10:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735499694] [2023-01-28 08:10:59,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:10:59,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 08:10:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:10:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 08:10:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=629, Unknown=1, NotChecked=52, Total=812 [2023-01-28 08:10:59,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 560 [2023-01-28 08:10:59,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 588 transitions, 9000 flow. Second operand has 29 states, 29 states have (on average 191.27586206896552) internal successors, (5547), 29 states have internal predecessors, (5547), 0 states have call successors, (0), 0 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:59,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:10:59,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 560 [2023-01-28 08:10:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:23,119 INFO L130 PetriNetUnfolder]: 52115/89380 cut-off events. [2023-01-28 08:11:23,119 INFO L131 PetriNetUnfolder]: For 983019/983128 co-relation queries the response was YES. [2023-01-28 08:11:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541044 conditions, 89380 events. 52115/89380 cut-off events. For 983019/983128 co-relation queries the response was YES. Maximal size of possible extension queue 2817. Compared 827660 event pairs, 7726 based on Foata normal form. 1069/85886 useless extension candidates. Maximal degree in co-relation 539030. Up to 34486 conditions per place. [2023-01-28 08:11:25,312 INFO L137 encePairwiseOnDemand]: 540/560 looper letters, 1269 selfloop transitions, 704 changer transitions 35/2016 dead transitions. [2023-01-28 08:11:25,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 2016 transitions, 30189 flow [2023-01-28 08:11:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-01-28 08:11:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2023-01-28 08:11:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 17020 transitions. [2023-01-28 08:11:25,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35756302521008404 [2023-01-28 08:11:25,328 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 17020 transitions. [2023-01-28 08:11:25,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 17020 transitions. [2023-01-28 08:11:25,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:11:25,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 17020 transitions. [2023-01-28 08:11:25,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 200.23529411764707) internal successors, (17020), 85 states have internal predecessors, (17020), 0 states have call successors, (0), 0 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:11:25,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 560.0) internal successors, (48160), 86 states have internal predecessors, (48160), 0 states have call successors, (0), 0 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:11:25,383 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 560.0) internal successors, (48160), 86 states have internal predecessors, (48160), 0 states have call successors, (0), 0 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:11:25,383 INFO L175 Difference]: Start difference. First operand has 246 places, 588 transitions, 9000 flow. Second operand 85 states and 17020 transitions. [2023-01-28 08:11:25,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 2016 transitions, 30189 flow [2023-01-28 08:11:33,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2016 transitions, 28567 flow, removed 479 selfloop flow, removed 10 redundant places. [2023-01-28 08:11:33,489 INFO L231 Difference]: Finished difference. Result has 366 places, 1109 transitions, 18579 flow [2023-01-28 08:11:33,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=560, PETRI_DIFFERENCE_MINUEND_FLOW=8188, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=18579, PETRI_PLACES=366, PETRI_TRANSITIONS=1109} [2023-01-28 08:11:33,490 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 279 predicate places. [2023-01-28 08:11:33,490 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1109 transitions, 18579 flow [2023-01-28 08:11:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 191.27586206896552) internal successors, (5547), 29 states have internal predecessors, (5547), 0 states have call successors, (0), 0 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:11:33,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:11:33,490 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:11:33,495 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:11:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:33,691 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 08:11:33,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:11:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1821461285, now seen corresponding path program 2 times [2023-01-28 08:11:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:11:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630305287] [2023-01-28 08:11:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:11:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:11:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:11:34,002 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:11:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:11:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630305287] [2023-01-28 08:11:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630305287] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:11:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680974946] [2023-01-28 08:11:34,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:11:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:11:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:11:34,005 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:11:34,038 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:11:34,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:11:34,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:11:34,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-28 08:11:34,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:11:34,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:11:34,308 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:11:34,309 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:11:34,331 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:11:34,360 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:11:34,533 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:11:34,649 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:11:34,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:11:36,765 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:11:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 3 not checked. [2023-01-28 08:11:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680974946] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:11:36,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:11:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2023-01-28 08:11:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734915711] [2023-01-28 08:11:36,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:11:36,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:11:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:11:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=546, Unknown=3, NotChecked=50, Total=756 [2023-01-28 08:11:36,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 560 [2023-01-28 08:11:36,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1109 transitions, 18579 flow. Second operand has 28 states, 28 states have (on average 195.57142857142858) internal successors, (5476), 28 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:11:36,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:36,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 560 [2023-01-28 08:11:36,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:39,858 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (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_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-01-28 08:11:45,252 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (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_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_119| Int)) (or (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_119|) 0)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false [2023-01-28 08:11:50,397 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2021 Int)) (= (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_2021)) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2020) |c_~#cache~0.base|) |c_~#cache~0.offset|) 0)) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_2021 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_2021) |c_~#cache~0.offset|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))))) is different from false Received shutdown request... [2023-01-28 08:12:11,315 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:12:11,316 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:12:12,325 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:12:12,517 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 08:12:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-01-28 08:12:12,532 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 137 [2023-01-28 08:12:12,532 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 08:12:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-01-28 08:12:12,532 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 08:12:12,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 08:12:12,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-28 08:12:12,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-28 08:12:12,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 08:12:12,533 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:12:12,533 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:12:12,534 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-01-28 08:12:12,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:12:12,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:12:12 BasicIcfg [2023-01-28 08:12:12,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:12:12,537 INFO L158 Benchmark]: Toolchain (without parser) took 821554.53ms. Allocated memory was 367.0MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 324.9MB in the beginning and 8.4GB in the end (delta: -8.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.12ms. Allocated memory is still 367.0MB. Free memory was 324.6MB in the beginning and 295.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 367.0MB. Free memory was 295.2MB in the beginning and 292.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: Boogie Preprocessor took 29.82ms. Allocated memory is still 367.0MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: RCFGBuilder took 592.38ms. Allocated memory is still 367.0MB. Free memory was 290.1MB in the beginning and 336.9MB in the end (delta: -46.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.0GB. [2023-01-28 08:12:12,538 INFO L158 Benchmark]: TraceAbstraction took 820288.18ms. Allocated memory was 367.0MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 336.1MB in the beginning and 8.4GB in the end (delta: -8.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-01-28 08:12:12,539 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 598.12ms. Allocated memory is still 367.0MB. Free memory was 324.6MB in the beginning and 295.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 367.0MB. Free memory was 295.2MB in the beginning and 292.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.82ms. Allocated memory is still 367.0MB. Free memory was 292.2MB in the beginning and 290.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 592.38ms. Allocated memory is still 367.0MB. Free memory was 290.1MB in the beginning and 336.9MB in the end (delta: -46.7MB). Peak memory consumption was 23.7MB. Max. memory is 16.0GB. * TraceAbstraction took 820288.18ms. Allocated memory was 367.0MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 336.1MB in the beginning and 8.4GB in the end (delta: -8.0GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 200 PlacesBefore, 63 PlacesAfterwards, 241 TransitionsBefore, 96 TransitionsAfterwards, 19458 CoEnabledTransitionPairs, 5 FixpointIterations, 25 TrivialSequentialCompositions, 125 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 24 ConcurrentYvCompositions, 8 ChoiceCompositions, 184 TotalNumberOfCompositions, 28650 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14073, independent: 13727, independent conditional: 0, independent unconditional: 13727, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9231, independent: 9138, independent conditional: 0, independent unconditional: 9138, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14073, independent: 4589, independent conditional: 0, independent unconditional: 4589, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 9231, unknown conditional: 0, unknown unconditional: 9231] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 200 PlacesBefore, 63 PlacesAfterwards, 241 TransitionsBefore, 97 TransitionsAfterwards, 19458 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 126 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 24 ConcurrentYvCompositions, 7 ChoiceCompositions, 184 TotalNumberOfCompositions, 31438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15563, independent: 15155, independent conditional: 0, independent unconditional: 15155, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9413, independent: 9307, independent conditional: 0, independent unconditional: 9307, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15563, independent: 5848, independent conditional: 0, independent unconditional: 5848, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 9413, unknown conditional: 0, unknown unconditional: 9413] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 355, Positive conditional cache size: 0, Positive unconditional cache size: 355, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 262 PlacesBefore, 87 PlacesAfterwards, 317 TransitionsBefore, 133 TransitionsAfterwards, 49956 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 168 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 39 ConcurrentYvCompositions, 9 ChoiceCompositions, 243 TotalNumberOfCompositions, 85784 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37013, independent: 36444, independent conditional: 0, independent unconditional: 36444, dependent: 569, dependent conditional: 0, dependent unconditional: 569, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23753, independent: 23633, independent conditional: 0, independent unconditional: 23633, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37013, independent: 12811, independent conditional: 0, independent unconditional: 12811, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 23753, unknown conditional: 0, unknown unconditional: 23753] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 533, Positive conditional cache size: 0, Positive unconditional cache size: 533, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, 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, 258 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: 421.5s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 294.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 71 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 98.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 931 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 98.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2305 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2492 IncrementalHoareTripleChecker+Invalid, 4993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1 mSDtfsCounter, 2492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 268 SyntacticMatches, 27 SemanticMatches, 199 ConstructedPredicates, 24 IntricatePredicates, 7 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 309.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=8, InterpolantAutomatonStates: 107, 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, 121.6s InterpolantComputationTime, 383 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 532 ConstructedInterpolants, 180 QuantifiedInterpolants, 14580 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1432 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 685/795 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, 314 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: 395.0s, OverallIterations: 23, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 311.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 271 mSolverCounterUnknown, 6674 SdHoareTripleChecker+Valid, 141.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6674 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 139.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6019 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 455 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16500 IncrementalHoareTripleChecker+Invalid, 23245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 455 mSolverCounterUnsat, 17 mSDtfsCounter, 16500 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 642 SyntacticMatches, 27 SemanticMatches, 470 ConstructedPredicates, 15 IntricatePredicates, 2 DeprecatedPredicates, 7779 ImplicationChecksByTransitivity, 119.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18579occurred in iteration=22, InterpolantAutomatonStates: 271, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 74.7s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1294 ConstructedInterpolants, 182 QuantifiedInterpolants, 16676 SizeOfPredicates, 145 NumberOfNonLiveVariables, 3256 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 49 InterpolantComputations, 13 PerfectInterpolantSequences, 2156/2257 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, 258 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.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s 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, 290 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 290 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.2s 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