/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_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:59:13,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:59:13,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:59:13,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:59:13,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:59:13,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:59:13,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:59:13,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:59:13,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:59:13,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:59:13,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:59:13,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:59:13,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:59:13,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:59:13,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:59:13,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:59:13,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:59:13,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:59:13,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:59:13,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:59:13,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:59:13,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:59:13,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:59:13,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:59:13,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:59:13,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:59:13,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:59:13,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:59:13,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:59:13,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:59:13,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:59:13,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:59:13,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:59:13,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:59:13,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:59:13,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:59:13,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:59:13,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:59:13,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:59:13,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:59:13,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:59:13,592 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:59:13,614 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:59:13,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:59:13,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:59:13,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:59:13,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:59:13,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:59:13,615 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:59:13,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:59:13,615 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:59:13,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:59:13,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:59:13,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:59:13,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:59:13,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:59:13,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:59:13,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:13,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:59:13,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:59:13,622 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:59:13,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:59:13,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:59:13,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:59:13,778 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:59:13,778 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:59:13,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-01-28 07:59:14,763 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:59:14,966 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:59:14,966 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-01-28 07:59:14,981 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b330a03d/a4c4c3d91baf4089afcbce8a256a539b/FLAGb8e79030e [2023-01-28 07:59:14,996 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b330a03d/a4c4c3d91baf4089afcbce8a256a539b [2023-01-28 07:59:14,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:59:15,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:59:15,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:15,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:59:15,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:59:15,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:14" (1/1) ... [2023-01-28 07:59:15,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fbd8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15, skipping insertion in model container [2023-01-28 07:59:15,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:59:14" (1/1) ... [2023-01-28 07:59:15,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:59:15,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:59:15,340 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_73-funloop_hard_racefree.i[41323,41336] [2023-01-28 07:59:15,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:15,384 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:59:15,415 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_73-funloop_hard_racefree.i[41323,41336] [2023-01-28 07:59:15,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:59:15,463 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:59:15,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15 WrapperNode [2023-01-28 07:59:15,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:59:15,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:15,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:59:15,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:59:15,469 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:59:15" (1/1) ... [2023-01-28 07:59:15,479 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:59:15" (1/1) ... [2023-01-28 07:59:15,497 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 250 [2023-01-28 07:59:15,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:59:15,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:59:15,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:59:15,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:59:15,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,532 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:59:15,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:59:15,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:59:15,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:59:15,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (1/1) ... [2023-01-28 07:59:15,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:59:15,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:15,590 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:59:15,606 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:59:15,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 07:59:15,617 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 07:59:15,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:59:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:59:15,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:59:15,634 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:59:15,728 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:59:15,729 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:59:15,940 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:59:15,946 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:59:15,946 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-01-28 07:59:15,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:15 BoogieIcfgContainer [2023-01-28 07:59:15,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:59:15,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:59:15,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:59:15,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:59:15,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:59:14" (1/3) ... [2023-01-28 07:59:15,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1da71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:15, skipping insertion in model container [2023-01-28 07:59:15,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:59:15" (2/3) ... [2023-01-28 07:59:15,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1da71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:59:15, skipping insertion in model container [2023-01-28 07:59:15,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:59:15" (3/3) ... [2023-01-28 07:59:15,953 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-01-28 07:59:15,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:59:15,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 07:59:15,964 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:59:16,095 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 07:59:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 07:59:16,238 INFO L130 PetriNetUnfolder]: 73/381 cut-off events. [2023-01-28 07:59:16,238 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-28 07:59:16,247 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:59:16,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 246 transitions, 500 flow [2023-01-28 07:59:16,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 241 transitions, 487 flow [2023-01-28 07:59:16,260 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:59:16,268 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 07:59:16,270 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 241 transitions, 487 flow [2023-01-28 07:59:16,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 241 transitions, 487 flow [2023-01-28 07:59:16,308 INFO L130 PetriNetUnfolder]: 72/376 cut-off events. [2023-01-28 07:59:16,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:16,312 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:59:16,320 INFO L119 LiptonReduction]: Number of co-enabled transitions 19458 [2023-01-28 07:59:18,356 INFO L134 LiptonReduction]: Checked pairs total: 28650 [2023-01-28 07:59:18,357 INFO L136 LiptonReduction]: Total number of compositions: 184 [2023-01-28 07:59:18,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:59:18,372 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;@2ef2d66a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:59:18,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 07:59:18,376 INFO L130 PetriNetUnfolder]: 9/39 cut-off events. [2023-01-28 07:59:18,376 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:18,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:18,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:18,377 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:59:18,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -454048497, now seen corresponding path program 1 times [2023-01-28 07:59:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526752609] [2023-01-28 07:59:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:18,558 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:59:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526752609] [2023-01-28 07:59:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526752609] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:59:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102648448] [2023-01-28 07:59:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:18,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:18,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:59:18,591 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:59:18,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:18,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:59:18,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:18,786 INFO L130 PetriNetUnfolder]: 579/1212 cut-off events. [2023-01-28 07:59:18,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:18,787 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:59:18,791 INFO L137 encePairwiseOnDemand]: 396/430 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-01-28 07:59:18,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 243 flow [2023-01-28 07:59:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2023-01-28 07:59:18,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217054263565891 [2023-01-28 07:59:18,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2023-01-28 07:59:18,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2023-01-28 07:59:18,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:18,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2023-01-28 07:59:18,813 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:59:18,817 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:59:18,818 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:59:18,819 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:59:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 243 flow [2023-01-28 07:59:18,822 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:59:18,824 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 147 flow [2023-01-28 07:59:18,825 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:59:18,828 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-01-28 07:59:18,828 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 147 flow [2023-01-28 07:59:18,829 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:59:18,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:18,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:59:18,829 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:59:18,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 573264157, now seen corresponding path program 1 times [2023-01-28 07:59:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114602469] [2023-01-28 07:59:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:18,909 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:59:18,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:18,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114602469] [2023-01-28 07:59:18,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114602469] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:18,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:59:18,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:59:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257632477] [2023-01-28 07:59:18,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:18,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:59:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:59:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:59:18,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:59:18,918 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:59:18,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:18,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:59:18,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:19,044 INFO L130 PetriNetUnfolder]: 547/1178 cut-off events. [2023-01-28 07:59:19,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:59:19,045 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:59:19,048 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 68 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-01-28 07:59:19,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 321 flow [2023-01-28 07:59:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:59:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:59:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2023-01-28 07:59:19,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100775193798449 [2023-01-28 07:59:19,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2023-01-28 07:59:19,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2023-01-28 07:59:19,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:19,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2023-01-28 07:59:19,052 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:59:19,053 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:59:19,054 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:59:19,054 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:59:19,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 321 flow [2023-01-28 07:59:19,056 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:59:19,057 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 151 flow [2023-01-28 07:59:19,058 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:59:19,060 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2023-01-28 07:59:19,060 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 151 flow [2023-01-28 07:59:19,060 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:59:19,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:19,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:19,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:59:19,061 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:59:19,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -646993721, now seen corresponding path program 1 times [2023-01-28 07:59:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831679324] [2023-01-28 07:59:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:19,131 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:59:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831679324] [2023-01-28 07:59:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831679324] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:19,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685826407] [2023-01-28 07:59:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:19,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:19,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:19,135 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:59:19,156 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:59:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:19,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 07:59:19,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:19,271 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:59:19,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:19,284 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:59:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685826407] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:19,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 07:59:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032360331] [2023-01-28 07:59:19,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:59:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:59:19,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:59:19,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 430 [2023-01-28 07:59:19,288 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:59:19,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:19,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 430 [2023-01-28 07:59:19,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:19,463 INFO L130 PetriNetUnfolder]: 576/1192 cut-off events. [2023-01-28 07:59:19,464 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-01-28 07:59:19,465 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:59:19,468 INFO L137 encePairwiseOnDemand]: 427/430 looper letters, 51 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-01-28 07:59:19,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 275 flow [2023-01-28 07:59:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:59:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:59:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2023-01-28 07:59:19,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786821705426357 [2023-01-28 07:59:19,471 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1235 transitions. [2023-01-28 07:59:19,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1235 transitions. [2023-01-28 07:59:19,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:19,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1235 transitions. [2023-01-28 07:59:19,473 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:59:19,476 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:59:19,477 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:59:19,477 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:59:19,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 275 flow [2023-01-28 07:59:19,478 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:59:19,479 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 183 flow [2023-01-28 07:59:19,480 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:59:19,480 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2023-01-28 07:59:19,480 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 183 flow [2023-01-28 07:59:19,481 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:59:19,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:19,481 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:19,489 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:59:19,686 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:59:19,687 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:59:19,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -254815792, now seen corresponding path program 2 times [2023-01-28 07:59:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867924657] [2023-01-28 07:59:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:19,829 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:59:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867924657] [2023-01-28 07:59:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867924657] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576297166] [2023-01-28 07:59:19,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 07:59:19,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:19,839 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:59:19,841 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:59:19,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 07:59:19,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 07:59:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-28 07:59:19,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:19,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:59:20,018 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:20,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:20,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:20,088 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:59:20,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 07:59:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576297166] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:59:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 07:59:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 07:59:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296318806] [2023-01-28 07:59:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:59:20,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:59:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:59:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 07:59:20,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 430 [2023-01-28 07:59:20,093 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:59:20,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:20,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 430 [2023-01-28 07:59:20,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:20,357 INFO L130 PetriNetUnfolder]: 878/1807 cut-off events. [2023-01-28 07:59:20,357 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-01-28 07:59:20,358 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:59:20,363 INFO L137 encePairwiseOnDemand]: 422/430 looper letters, 109 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2023-01-28 07:59:20,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 541 flow [2023-01-28 07:59:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:59:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:59:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2023-01-28 07:59:20,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42372093023255814 [2023-01-28 07:59:20,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 911 transitions. [2023-01-28 07:59:20,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 911 transitions. [2023-01-28 07:59:20,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:20,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 911 transitions. [2023-01-28 07:59:20,368 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:59:20,370 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:59:20,371 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:59:20,371 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:59:20,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 541 flow [2023-01-28 07:59:20,374 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:59:20,376 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 219 flow [2023-01-28 07:59:20,376 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:59:20,377 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-01-28 07:59:20,377 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 219 flow [2023-01-28 07:59:20,378 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:59:20,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:20,378 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:59:20,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 07:59:20,583 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:59:20,583 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:59:20,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1650306531, now seen corresponding path program 1 times [2023-01-28 07:59:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806326930] [2023-01-28 07:59:20,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:20,633 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:59:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806326930] [2023-01-28 07:59:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806326930] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632774980] [2023-01-28 07:59:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:20,635 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:59:20,637 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:59:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:20,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 07:59:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:20,727 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:59:20,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:20,769 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:59:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632774980] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:20,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 07:59:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390821804] [2023-01-28 07:59:20,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:20,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 07:59:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 07:59:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 07:59:20,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 430 [2023-01-28 07:59:20,774 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:59:20,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:20,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 430 [2023-01-28 07:59:20,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:20,838 INFO L130 PetriNetUnfolder]: 61/186 cut-off events. [2023-01-28 07:59:20,839 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-01-28 07:59:20,839 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:59:20,839 INFO L137 encePairwiseOnDemand]: 425/430 looper letters, 38 selfloop transitions, 13 changer transitions 2/58 dead transitions. [2023-01-28 07:59:20,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 306 flow [2023-01-28 07:59:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 07:59:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 07:59:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2716 transitions. [2023-01-28 07:59:20,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511627906976744 [2023-01-28 07:59:20,844 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2716 transitions. [2023-01-28 07:59:20,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2716 transitions. [2023-01-28 07:59:20,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:59:20,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2716 transitions. [2023-01-28 07:59:20,848 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:59:20,854 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:59:20,854 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:59:20,854 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:59:20,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 306 flow [2023-01-28 07:59:20,856 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:59:20,857 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-01-28 07:59:20,857 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:59:20,857 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-01-28 07:59:20,857 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-01-28 07:59:20,858 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:59:20,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:59:20,858 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:59:20,865 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:59:21,063 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:59:21,063 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:59:21,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:59:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -630653115, now seen corresponding path program 1 times [2023-01-28 07:59:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:59:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988008048] [2023-01-28 07:59:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:59:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:21,867 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:59:21,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:59:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988008048] [2023-01-28 07:59:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988008048] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 07:59:21,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181387292] [2023-01-28 07:59:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:59:21,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 07:59:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:59:21,869 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:59:21,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 07:59:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:59:21,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 07:59:21,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 07:59:21,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 07:59:22,048 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 07:59:22,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 07:59:22,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 07:59:22,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 07:59:22,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 07:59:22,267 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:59:22,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 07:59:30,359 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:59:32,366 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:59:34,386 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:59:34,464 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:59:34,558 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:59:34,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181387292] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 07:59:34,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 07:59:34,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-01-28 07:59:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867107839] [2023-01-28 07:59:34,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 07:59:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 07:59:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:59:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 07:59:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=6, NotChecked=164, Total=600 [2023-01-28 07:59:34,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 430 [2023-01-28 07:59:34,565 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:59:34,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:59:34,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 430 [2023-01-28 07:59:34,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:59:40,827 WARN L222 SmtUtils]: Spent 6.05s 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:46,877 WARN L222 SmtUtils]: Spent 6.04s 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 08:00:06,992 WARN L222 SmtUtils]: Spent 20.06s 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 08:00:09,037 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:11,043 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:13,047 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:15,049 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:17,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:00:19,066 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:21,071 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:23,075 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:25,077 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:27,086 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:29,093 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:34,514 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:37,268 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:39,275 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:41,279 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:43,282 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:45,287 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:47,299 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:49,305 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:51,309 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:53,310 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:55,315 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:01:03,512 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:01:03,591 INFO L130 PetriNetUnfolder]: 60/193 cut-off events. [2023-01-28 08:01:03,591 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-01-28 08:01:03,592 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:01:03,592 INFO L137 encePairwiseOnDemand]: 419/430 looper letters, 59 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2023-01-28 08:01:03,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 497 flow [2023-01-28 08:01:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:01:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:01:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2530 transitions. [2023-01-28 08:01:03,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34610123119015046 [2023-01-28 08:01:03,597 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2530 transitions. [2023-01-28 08:01:03,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2530 transitions. [2023-01-28 08:01:03,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:03,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2530 transitions. [2023-01-28 08:01:03,601 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:01:03,607 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:01:03,608 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:01:03,608 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:01:03,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 497 flow [2023-01-28 08:01:03,609 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:01:03,610 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 265 flow [2023-01-28 08:01:03,610 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:01:03,611 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2023-01-28 08:01:03,611 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 265 flow [2023-01-28 08:01:03,612 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:01:03,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:03,613 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:03,618 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:01:03,817 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:01:03,818 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:01:03,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 470240073, now seen corresponding path program 1 times [2023-01-28 08:01:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520838862] [2023-01-28 08:01:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:04,751 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:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520838862] [2023-01-28 08:01:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520838862] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033938286] [2023-01-28 08:01:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:04,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:04,765 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:01:04,770 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:01:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:04,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:01:04,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:04,869 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:04,953 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:04,954 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:04,975 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:05,071 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:05,136 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:05,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:01:08,348 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:08,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:24,362 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:01:26,381 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:01:28,401 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:01:28,432 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:01:28,480 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:01:28,507 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:01:28,657 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:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033938286] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:28,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-01-28 08:01:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668583205] [2023-01-28 08:01:28,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:28,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:01:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:01:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=387, Unknown=16, NotChecked=270, Total=756 [2023-01-28 08:01:28,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-01-28 08:01:28,663 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:01:28,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:28,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-01-28 08:01:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:58,631 WARN L222 SmtUtils]: Spent 8.05s 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:02:05,872 INFO L130 PetriNetUnfolder]: 134/391 cut-off events. [2023-01-28 08:02:05,872 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2023-01-28 08:02:05,873 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:02:05,874 INFO L137 encePairwiseOnDemand]: 418/430 looper letters, 132 selfloop transitions, 56 changer transitions 0/192 dead transitions. [2023-01-28 08:02:05,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 192 transitions, 1159 flow [2023-01-28 08:02:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 08:02:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 08:02:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3236 transitions. [2023-01-28 08:02:05,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3583610188261351 [2023-01-28 08:02:05,880 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3236 transitions. [2023-01-28 08:02:05,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3236 transitions. [2023-01-28 08:02:05,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:05,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3236 transitions. [2023-01-28 08:02:05,885 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:02:05,892 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:05,893 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:05,894 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:02:05,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 192 transitions, 1159 flow [2023-01-28 08:02:05,896 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:02:05,897 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 721 flow [2023-01-28 08:02:05,898 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:02:05,898 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 28 predicate places. [2023-01-28 08:02:05,898 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 721 flow [2023-01-28 08:02:05,899 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:02:05,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:05,900 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:02:05,919 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:02:06,117 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:02:06,117 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:02:06,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1435047, now seen corresponding path program 2 times [2023-01-28 08:02:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911019752] [2023-01-28 08:02:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:06,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911019752] [2023-01-28 08:02:06,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911019752] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954436695] [2023-01-28 08:02:06,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:02:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:06,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:06,985 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:02:06,987 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:02:07,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:02:07,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:07,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:07,077 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:07,136 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:07,136 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:07,161 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:07,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:07,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:02:09,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:02:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:02:09,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:09,595 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:02:11,519 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:02:13,598 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:02:13,646 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:02:13,666 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:02:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-01-28 08:02:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954436695] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:13,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-01-28 08:02:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263808452] [2023-01-28 08:02:13,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:13,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:02:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:13,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:02:13,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=397, Unknown=10, NotChecked=220, Total=702 [2023-01-28 08:02:13,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 430 [2023-01-28 08:02:13,791 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:02:13,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:13,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 430 [2023-01-28 08:02:13,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:37,286 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:46,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:02:47,516 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:02:52,053 INFO L130 PetriNetUnfolder]: 174/574 cut-off events. [2023-01-28 08:02:52,053 INFO L131 PetriNetUnfolder]: For 1465/1465 co-relation queries the response was YES. [2023-01-28 08:02:52,054 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:52,056 INFO L137 encePairwiseOnDemand]: 420/430 looper letters, 171 selfloop transitions, 64 changer transitions 0/239 dead transitions. [2023-01-28 08:02:52,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 1969 flow [2023-01-28 08:02:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-28 08:02:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-28 08:02:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3242 transitions. [2023-01-28 08:02:52,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35902547065337764 [2023-01-28 08:02:52,062 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3242 transitions. [2023-01-28 08:02:52,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3242 transitions. [2023-01-28 08:02:52,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:52,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3242 transitions. [2023-01-28 08:02:52,067 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:52,073 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:52,074 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:52,074 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:52,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 1969 flow [2023-01-28 08:02:52,080 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:52,082 INFO L231 Difference]: Finished difference. Result has 118 places, 138 transitions, 1145 flow [2023-01-28 08:02:52,082 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:52,082 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 55 predicate places. [2023-01-28 08:02:52,082 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 138 transitions, 1145 flow [2023-01-28 08:02:52,083 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:52,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:52,083 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:52,107 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:52,288 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:52,289 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:52,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1374964814, now seen corresponding path program 3 times [2023-01-28 08:02:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128985633] [2023-01-28 08:02:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:52,960 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:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128985633] [2023-01-28 08:02:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128985633] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779574406] [2023-01-28 08:02:52,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:02:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:52,961 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:52,966 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:53,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:02:53,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:53,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 08:02:53,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:53,064 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:53,105 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:53,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:02:53,111 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:53,186 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:53,220 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:53,262 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:53,334 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:53,382 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:03:02,605 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:03:02,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:16,635 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:03:18,652 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:34,806 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:36,815 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:36,824 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:36,843 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:36,852 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:49,425 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:49,563 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:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779574406] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:49,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2023-01-28 08:03:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346693203] [2023-01-28 08:03:49,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:49,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 08:03:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 08:03:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=545, Unknown=42, NotChecked=456, Total=1190 [2023-01-28 08:03:49,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-01-28 08:03:49,569 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:49,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:49,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-01-28 08:03:49,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:50,688 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:51,810 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:52,950 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:03:55,382 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:56,562 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:03:57,630 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:58,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:03:59,887 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:04:01,047 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:04,776 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:05,981 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:04:07,085 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:08,212 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:04:11,619 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:12,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:13,852 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:15,066 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:04:16,229 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:20,798 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:04:21,864 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:30,308 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:31,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:04:40,842 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:50,103 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:51,224 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:52,472 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:04:55,871 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:56,961 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:58,086 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:04:59,289 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:05:13,481 WARN L222 SmtUtils]: Spent 10.20s 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:14,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:15,811 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:05:18,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:32,382 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:05:33,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:05:43,348 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:05:44,607 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:05:45,735 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:05:46,970 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:06:14,121 WARN L222 SmtUtils]: Spent 25.80s on a formula simplification. DAG size of input: 79 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:06:15,312 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:06:23,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:24,238 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:06:35,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:37,090 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:06:38,292 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:06:59,741 INFO L130 PetriNetUnfolder]: 197/720 cut-off events. [2023-01-28 08:06:59,742 INFO L131 PetriNetUnfolder]: For 3008/3008 co-relation queries the response was YES. [2023-01-28 08:06:59,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 720 events. 197/720 cut-off events. For 3008/3008 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3580 event pairs, 15 based on Foata normal form. 4/689 useless extension candidates. Maximal degree in co-relation 2900. Up to 158 conditions per place. [2023-01-28 08:06:59,746 INFO L137 encePairwiseOnDemand]: 417/430 looper letters, 101 selfloop transitions, 72 changer transitions 68/245 dead transitions. [2023-01-28 08:06:59,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 245 transitions, 2442 flow [2023-01-28 08:06:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-28 08:06:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-28 08:06:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3855 transitions. [2023-01-28 08:06:59,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3586046511627907 [2023-01-28 08:06:59,756 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3855 transitions. [2023-01-28 08:06:59,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3855 transitions. [2023-01-28 08:06:59,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:06:59,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3855 transitions. [2023-01-28 08:06:59,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 154.2) internal successors, (3855), 25 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call 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:59,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 430.0) internal successors, (11180), 26 states have internal predecessors, (11180), 0 states have call successors, (0), 0 states have call 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:59,772 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 430.0) internal successors, (11180), 26 states have internal predecessors, (11180), 0 states have call successors, (0), 0 states have call 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:59,773 INFO L175 Difference]: Start difference. First operand has 118 places, 138 transitions, 1145 flow. Second operand 25 states and 3855 transitions. [2023-01-28 08:06:59,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 245 transitions, 2442 flow [2023-01-28 08:06:59,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 245 transitions, 2372 flow, removed 22 selfloop flow, removed 7 redundant places. [2023-01-28 08:06:59,784 INFO L231 Difference]: Finished difference. Result has 149 places, 128 transitions, 1315 flow [2023-01-28 08:06:59,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1315, PETRI_PLACES=149, PETRI_TRANSITIONS=128} [2023-01-28 08:06:59,785 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 86 predicate places. [2023-01-28 08:06:59,785 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 128 transitions, 1315 flow [2023-01-28 08:06:59,786 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:06:59,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:06:59,787 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:06:59,797 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:06:59,992 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:06:59,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:06:59,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:06:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash -946426340, now seen corresponding path program 4 times [2023-01-28 08:06:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:06:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941380671] [2023-01-28 08:06:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:06:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:07:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941380671] [2023-01-28 08:07:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941380671] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790433563] [2023-01-28 08:07:09,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:07:09,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:09,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:09,240 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:07:09,242 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:07:09,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:07:09,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:09,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 104 conjunts are in the unsatisfiable core [2023-01-28 08:07:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:09,538 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:07:09,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:09,595 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:07:09,633 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:07:09,714 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:07:09,841 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:07:09,971 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 20 treesize of output 20 [2023-01-28 08:07:10,003 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 23 treesize of output 18 [2023-01-28 08:07:10,096 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:07:20,230 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:07:28,742 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:07:56,125 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 33 treesize of output 26 [2023-01-28 08:07:56,317 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 50 treesize of output 43 [2023-01-28 08:08:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 5 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-28 08:08:23,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:08:56,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |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_77|) 0))) is different from false [2023-01-28 08:08:58,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) is different from false [2023-01-28 08:09:00,090 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (= (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_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:09:02,107 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |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| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) is different from false [2023-01-28 08:09:04,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (= (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| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-01-28 08:09:06,140 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0)))) is different from false [2023-01-28 08:09:08,153 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0)))) is different from false [2023-01-28 08:09:10,179 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (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_747)) |c_~#cache~0.base|))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse1 |c_~#cache~0.offset|))))) is different from false [2023-01-28 08:09:12,257 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse1 |c_~#cache~0.offset|))))) is different from false [2023-01-28 08:09:42,711 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (= (select (let ((.cse1 (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_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-01-28 08:09:44,738 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (store (select (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 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-01-28 08:09:45,658 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (= (select (let ((.cse1 (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~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-01-28 08:09:45,682 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (let ((.cse1 (store (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |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_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0)))) is different from false [2023-01-28 08:09:47,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (store (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-01-28 08:09:49,802 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-01-28 08:09:51,832 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 28)) (= (select (let ((.cse2 (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|))))) is different from false [2023-01-28 08:09:51,929 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|) (= (select (let ((.cse2 (store (let ((.cse3 (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)))))) (store (select (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))))) is different from false [2023-01-28 08:09:53,969 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (let ((.cse4 (+ .cse3 |c_~#cache~0.offset|))) (or (= (select (let ((.cse0 (store (let ((.cse1 (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 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store (select (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse3 |c_~#cache~0.offset|)) (< .cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse4 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|))))) is different from false [2023-01-28 08:09:54,053 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse2 (store (let ((.cse3 (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|)))) (store (select (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|))))) is different from false [2023-01-28 08:09:56,084 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_72| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_72| 28))) (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 .cse0 |c_~#cache~0.offset|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store (select (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_72| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|))))) is different from false [2023-01-28 08:09:58,192 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 84)) (= (select (let ((.cse0 (store (let ((.cse1 (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|))))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|)))) is different from false [2023-01-28 08:09:58,297 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_747 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| Int)) (or (= (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_735))) (let ((.cse2 (let ((.cse3 (select .cse1 |c_~#cache~0.base|))) (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (select .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|))))) (store (select (store (store .cse1 |c_~#cache~0.base| .cse2) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| (select .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_747))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_80| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_78| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|)))) is different from false [2023-01-28 08:09:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 87 not checked. [2023-01-28 08:09:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790433563] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:58,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 26] total 61 [2023-01-28 08:09:58,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495903402] [2023-01-28 08:09:58,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:58,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-01-28 08:09:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-01-28 08:09:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1271, Unknown=95, NotChecked=2178, Total=3906 [2023-01-28 08:09:58,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 430 [2023-01-28 08:09:58,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 128 transitions, 1315 flow. Second operand has 63 states, 63 states have (on average 151.4920634920635) internal successors, (9544), 63 states have internal predecessors, (9544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:58,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:58,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 430 [2023-01-28 08:09:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:10:00,089 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:10:01,385 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:10:02,633 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:10:06,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s 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,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s 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,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s 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,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:15,478 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:10:16,727 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:10:21,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:22,660 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:10:24,005 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:25,282 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:10:38,674 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:10:39,874 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:10:41,099 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:10:42,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:43,726 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:10:44,957 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:10:46,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:47,693 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:48,912 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:10:50,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:10:51,581 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:52,818 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:10:54,037 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:11:03,115 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:11:04,258 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:11:05,539 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:11:06,841 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:11:08,002 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:11:09,177 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:11:14,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:15,811 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:11:17,009 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:11:18,199 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:11:19,394 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:11:20,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:21,919 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:11:23,104 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:11:24,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:25,644 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:11:26,802 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:11:28,030 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:11:34,132 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:11:35,352 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:11:36,551 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:11:37,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:11:39,070 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:11:40,240 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:11:47,745 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:11:48,959 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:11:50,215 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:12:02,092 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:12:03,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:12,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:13,605 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:12:20,183 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:12:21,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:22,668 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:12:23,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:27,765 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:12:29,258 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:12:36,013 WARN L222 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 75 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:12:37,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:38,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:39,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:45,939 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:12:47,234 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:12:48,445 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:12:49,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:51,124 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:12:52,336 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:12:53,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:55,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:12:56,409 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:12:57,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:02,811 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:13:04,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:13,321 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:13:14,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:18,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:19,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:23,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:38,713 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:13:39,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-28 08:13:41,324 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] Received shutdown request... [2023-01-28 08:13:47,014 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:13:47,031 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:13:48,027 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:13:48,232 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:13:48,252 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:13:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 08:13:48,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:13:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 08:13:48,254 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 08:13:48,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:13:48,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:13:48,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:13:48,255 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-01-28 08:13:48,256 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:13:48,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 08:13:48,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:13:48,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:13:48 BasicIcfg [2023-01-28 08:13:48,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:13:48,260 INFO L158 Benchmark]: Toolchain (without parser) took 873260.56ms. Allocated memory was 364.9MB in the beginning and 788.5MB in the end (delta: 423.6MB). Free memory was 297.5MB in the beginning and 307.9MB in the end (delta: -10.4MB). Peak memory consumption was 414.7MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,260 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 364.9MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:13:48,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.87ms. Allocated memory is still 364.9MB. Free memory was 297.2MB in the beginning and 267.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.79ms. Allocated memory is still 364.9MB. Free memory was 267.8MB in the beginning and 265.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,270 INFO L158 Benchmark]: Boogie Preprocessor took 46.75ms. Allocated memory is still 364.9MB. Free memory was 265.1MB in the beginning and 262.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,271 INFO L158 Benchmark]: RCFGBuilder took 402.85ms. Allocated memory was 364.9MB in the beginning and 650.1MB in the end (delta: 285.2MB). Free memory was 262.6MB in the beginning and 594.4MB in the end (delta: -331.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,273 INFO L158 Benchmark]: TraceAbstraction took 872310.64ms. Allocated memory was 650.1MB in the beginning and 788.5MB in the end (delta: 138.4MB). Free memory was 594.2MB in the beginning and 307.9MB in the end (delta: 286.3MB). Peak memory consumption was 425.1MB. Max. memory is 16.0GB. [2023-01-28 08:13:48,276 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.12ms. Allocated memory is still 364.9MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 461.87ms. Allocated memory is still 364.9MB. Free memory was 297.2MB in the beginning and 267.8MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.79ms. Allocated memory is still 364.9MB. Free memory was 267.8MB in the beginning and 265.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.75ms. Allocated memory is still 364.9MB. Free memory was 265.1MB in the beginning and 262.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 402.85ms. Allocated memory was 364.9MB in the beginning and 650.1MB in the end (delta: 285.2MB). Free memory was 262.6MB in the beginning and 594.4MB in the end (delta: -331.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.0GB. * TraceAbstraction took 872310.64ms. Allocated memory was 650.1MB in the beginning and 788.5MB in the end (delta: 138.4MB). Free memory was 594.2MB in the beginning and 307.9MB in the end (delta: 286.3MB). Peak memory consumption was 425.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 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 - 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: 872.1s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 585.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 168 mSolverCounterUnknown, 1092 SdHoareTripleChecker+Valid, 224.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1092 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 223.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3494 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2925 IncrementalHoareTripleChecker+Invalid, 6748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 1 mSDtfsCounter, 2925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 699 GetRequests, 383 SyntacticMatches, 35 SemanticMatches, 280 ConstructedPredicates, 45 IntricatePredicates, 7 DeprecatedPredicates, 2802 ImplicationChecksByTransitivity, 620.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1315occurred in iteration=9, InterpolantAutomatonStates: 115, 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.5s SatisfiabilityAnalysisTime, 281.9s InterpolantComputationTime, 529 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 748 ConstructedInterpolants, 282 QuantifiedInterpolants, 60995 SizeOfPredicates, 95 NumberOfNonLiveVariables, 1880 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 860/1221 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